./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 03:37:55,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:37:55,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:37:55,216 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:37:55,216 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:37:55,217 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:37:55,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:37:55,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:37:55,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:37:55,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:37:55,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:37:55,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:37:55,221 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:37:55,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:37:55,223 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:37:55,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:37:55,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:37:55,225 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:37:55,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:37:55,227 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:37:55,228 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:37:55,229 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:37:55,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:37:55,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:37:55,231 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:37:55,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:37:55,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:37:55,232 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:37:55,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:37:55,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:37:55,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:37:55,234 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:37:55,235 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:37:55,235 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:37:55,235 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:37:55,236 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:37:55,236 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 03:37:55,247 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:37:55,247 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:37:55,248 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:37:55,248 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:37:55,249 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:37:55,249 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 03:37:55,249 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 03:37:55,249 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 03:37:55,249 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 03:37:55,249 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 03:37:55,250 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 03:37:55,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:37:55,250 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:37:55,250 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 03:37:55,250 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:37:55,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 03:37:55,251 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 03:37:55,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:37:55,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:37:55,252 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 03:37:55,252 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:37:55,252 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:37:55,252 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 03:37:55,253 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 03:37:55,253 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-11-10 03:37:55,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:37:55,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:37:55,285 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:37:55,286 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:37:55,286 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:37:55,287 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 03:37:55,322 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/data/b42d2bbdb/3422cd43ba534babbc09da279f9a1069/FLAG1b48112a2 [2018-11-10 03:37:55,710 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:37:55,711 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 03:37:55,715 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/data/b42d2bbdb/3422cd43ba534babbc09da279f9a1069/FLAG1b48112a2 [2018-11-10 03:37:55,723 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/data/b42d2bbdb/3422cd43ba534babbc09da279f9a1069 [2018-11-10 03:37:55,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:37:55,726 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 03:37:55,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:55,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:37:55,730 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:37:55,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ba002d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55, skipping insertion in model container [2018-11-10 03:37:55,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:37:55,753 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:37:55,861 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:55,863 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:37:55,883 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:37:55,891 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:37:55,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55 WrapperNode [2018-11-10 03:37:55,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:37:55,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:55,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 03:37:55,892 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 03:37:55,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,903 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 03:37:55,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:37:55,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:37:55,917 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:37:55,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... [2018-11-10 03:37:55,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:37:55,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:37:55,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:37:55,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:37:55,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:37:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:37:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:37:56,220 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:37:56,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:56 BoogieIcfgContainer [2018-11-10 03:37:56,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:37:56,222 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 03:37:56,222 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 03:37:56,226 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 03:37:56,227 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:37:56,227 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 03:37:55" (1/3) ... [2018-11-10 03:37:56,228 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432a65e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:37:56, skipping insertion in model container [2018-11-10 03:37:56,228 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:37:56,228 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:37:55" (2/3) ... [2018-11-10 03:37:56,229 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432a65e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 03:37:56, skipping insertion in model container [2018-11-10 03:37:56,229 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 03:37:56,229 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:56" (3/3) ... [2018-11-10 03:37:56,232 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-10 03:37:56,280 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:37:56,281 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 03:37:56,281 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 03:37:56,281 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 03:37:56,281 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:37:56,281 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:37:56,281 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 03:37:56,281 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:37:56,281 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 03:37:56,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 03:37:56,313 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 03:37:56,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:56,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:56,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:37:56,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:56,320 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 03:37:56,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 03:37:56,323 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 03:37:56,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:56,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:56,324 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 03:37:56,324 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:56,330 INFO L793 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L40true assume !(mp_add_~a3~0 % 256 == 0); 8#L40-1true mp_add_~nb~0 := 4; 31#L50true assume !(mp_add_~b3~0 % 256 == 0); 28#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-3true [2018-11-10 03:37:56,331 INFO L795 eck$LassoCheckResult]: Loop: 23#L61-3true assume true; 29#L61-1true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26#L70true assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14#L76-1true assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 24#L81-1true assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 33#L83-1true mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 23#L61-3true [2018-11-10 03:37:56,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:56,335 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2018-11-10 03:37:56,337 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:56,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:37:56,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:56,444 INFO L82 PathProgramCache]: Analyzing trace with hash -486457291, now seen corresponding path program 1 times [2018-11-10 03:37:56,444 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:56,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:56,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:56,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:56,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:37:56,499 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:37:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:37:56,510 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-10 03:37:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:56,636 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-11-10 03:37:56,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:37:56,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2018-11-10 03:37:56,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-10 03:37:56,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 90 transitions. [2018-11-10 03:37:56,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 03:37:56,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-10 03:37:56,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 90 transitions. [2018-11-10 03:37:56,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:56,645 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-10 03:37:56,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 90 transitions. [2018-11-10 03:37:56,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-10 03:37:56,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 03:37:56,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-11-10 03:37:56,670 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-10 03:37:56,670 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-10 03:37:56,670 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 03:37:56,670 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 88 transitions. [2018-11-10 03:37:56,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 03:37:56,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:56,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:56,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:56,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:56,672 INFO L793 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 131#L40 assume !(mp_add_~a3~0 % 256 == 0); 128#L40-1 mp_add_~nb~0 := 4; 129#L50 assume !(mp_add_~b3~0 % 256 == 0); 140#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 147#L61-3 assume true; 148#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 151#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 145#L64-1 [2018-11-10 03:37:56,672 INFO L795 eck$LassoCheckResult]: Loop: 145#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 134#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 138#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 120#L80-1 assume !(mp_add_~i~0 % 256 == 1); 121#L81-1 assume !(mp_add_~i~0 % 256 == 2); 126#L82-1 assume !(mp_add_~i~0 % 256 == 3); 127#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 153#L61-3 assume true; 170#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 167#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 168#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 136#L65-2 assume !(mp_add_~i~0 % 256 == 1); 137#L66-1 assume !(mp_add_~i~0 % 256 == 2); 144#L67-1 assume !(mp_add_~i~0 % 256 == 3); 145#L64-1 [2018-11-10 03:37:56,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:56,672 INFO L82 PathProgramCache]: Analyzing trace with hash -685617854, now seen corresponding path program 1 times [2018-11-10 03:37:56,672 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:56,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:56,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:56,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:37:56,756 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:56,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:56,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 1 times [2018-11-10 03:37:56,757 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:56,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:56,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:56,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:56,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:56,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:56,828 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:56,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:37:56,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:37:56,829 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-10 03:37:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:37:57,063 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2018-11-10 03:37:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:37:57,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 226 transitions. [2018-11-10 03:37:57,066 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-10 03:37:57,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 226 transitions. [2018-11-10 03:37:57,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-11-10 03:37:57,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-11-10 03:37:57,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 226 transitions. [2018-11-10 03:37:57,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:37:57,070 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 226 transitions. [2018-11-10 03:37:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 226 transitions. [2018-11-10 03:37:57,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2018-11-10 03:37:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 03:37:57,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2018-11-10 03:37:57,075 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-10 03:37:57,075 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-10 03:37:57,075 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 03:37:57,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2018-11-10 03:37:57,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 03:37:57,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:37:57,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:37:57,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:57,078 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:37:57,078 INFO L793 eck$LassoCheckResult]: Stem: 388#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 362#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 358#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 359#L42 assume !(mp_add_~a2~0 % 256 == 0); 385#L40-1 mp_add_~nb~0 := 4; 382#L50 assume !(mp_add_~b3~0 % 256 == 0); 365#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 400#L61-3 assume true; 398#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 399#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 384#L64-1 [2018-11-10 03:37:57,078 INFO L795 eck$LassoCheckResult]: Loop: 384#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 357#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 363#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 344#L80-1 assume !(mp_add_~i~0 % 256 == 1); 345#L81-1 assume !(mp_add_~i~0 % 256 == 2); 350#L82-1 assume !(mp_add_~i~0 % 256 == 3); 351#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 374#L61-3 assume true; 375#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 395#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 387#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 367#L65-2 assume !(mp_add_~i~0 % 256 == 1); 390#L66-1 assume !(mp_add_~i~0 % 256 == 2); 391#L67-1 assume !(mp_add_~i~0 % 256 == 3); 384#L64-1 [2018-11-10 03:37:57,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash 959922624, now seen corresponding path program 1 times [2018-11-10 03:37:57,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:57,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:57,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:57,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:57,162 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:37:57,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:37:57,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 2 times [2018-11-10 03:37:57,162 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:37:57,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:37:57,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:57,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:37:57,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:37:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:37:57,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:37:57,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:37:57,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:37:57,220 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:37:57,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:37:57,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:37:57,221 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. cyclomatic complexity: 37 Second operand 6 states. [2018-11-10 03:38:00,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:00,470 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2018-11-10 03:38:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:38:00,471 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 344 transitions. [2018-11-10 03:38:00,473 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 176 [2018-11-10 03:38:00,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 344 transitions. [2018-11-10 03:38:00,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2018-11-10 03:38:00,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2018-11-10 03:38:00,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 344 transitions. [2018-11-10 03:38:00,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:00,477 INFO L705 BuchiCegarLoop]: Abstraction has 230 states and 344 transitions. [2018-11-10 03:38:00,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 344 transitions. [2018-11-10 03:38:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 155. [2018-11-10 03:38:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-11-10 03:38:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2018-11-10 03:38:00,486 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 225 transitions. [2018-11-10 03:38:00,486 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 225 transitions. [2018-11-10 03:38:00,487 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 03:38:00,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 225 transitions. [2018-11-10 03:38:00,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 103 [2018-11-10 03:38:00,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:00,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:00,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:00,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:00,490 INFO L793 eck$LassoCheckResult]: Stem: 718#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 693#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 688#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 690#L42 assume !(mp_add_~a2~0 % 256 == 0); 715#L40-1 mp_add_~nb~0 := 4; 794#L50 assume !(mp_add_~b3~0 % 256 == 0); 791#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 790#L61-3 assume true; 789#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 788#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 787#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 772#L65-2 [2018-11-10 03:38:00,490 INFO L795 eck$LassoCheckResult]: Loop: 772#L65-2 assume !(mp_add_~i~0 % 256 == 1); 786#L66-1 assume !(mp_add_~i~0 % 256 == 2); 785#L67-1 assume !(mp_add_~i~0 % 256 == 3); 782#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 780#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 779#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 753#L80-1 assume !(mp_add_~i~0 % 256 == 1); 778#L81-1 assume !(mp_add_~i~0 % 256 == 2); 777#L82-1 assume !(mp_add_~i~0 % 256 == 3); 776#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 775#L61-3 assume true; 774#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 773#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 764#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 772#L65-2 [2018-11-10 03:38:00,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:00,490 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 1 times [2018-11-10 03:38:00,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:00,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:00,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:00,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1892987967, now seen corresponding path program 3 times [2018-11-10 03:38:00,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:00,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:00,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:00,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:00,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:00,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:00,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:38:00,579 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:38:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:38:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:38:00,579 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. cyclomatic complexity: 74 Second operand 5 states. [2018-11-10 03:38:00,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:00,711 INFO L93 Difference]: Finished difference Result 261 states and 372 transitions. [2018-11-10 03:38:00,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 03:38:00,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 261 states and 372 transitions. [2018-11-10 03:38:00,713 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 209 [2018-11-10 03:38:00,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 261 states to 261 states and 372 transitions. [2018-11-10 03:38:00,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 261 [2018-11-10 03:38:00,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 261 [2018-11-10 03:38:00,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 261 states and 372 transitions. [2018-11-10 03:38:00,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:00,716 INFO L705 BuchiCegarLoop]: Abstraction has 261 states and 372 transitions. [2018-11-10 03:38:00,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states and 372 transitions. [2018-11-10 03:38:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 246. [2018-11-10 03:38:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-10 03:38:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 348 transitions. [2018-11-10 03:38:00,728 INFO L728 BuchiCegarLoop]: Abstraction has 246 states and 348 transitions. [2018-11-10 03:38:00,728 INFO L608 BuchiCegarLoop]: Abstraction has 246 states and 348 transitions. [2018-11-10 03:38:00,728 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 03:38:00,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 246 states and 348 transitions. [2018-11-10 03:38:00,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 194 [2018-11-10 03:38:00,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:00,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:00,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:00,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:00,731 INFO L793 eck$LassoCheckResult]: Stem: 1144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1112#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1114#L42 assume !(mp_add_~a2~0 % 256 == 0); 1108#L40-1 mp_add_~nb~0 := 4; 1109#L50 assume !(mp_add_~b3~0 % 256 == 0); 1136#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1137#L61-3 assume true; 1332#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1328#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1327#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1326#L65-2 [2018-11-10 03:38:00,731 INFO L795 eck$LassoCheckResult]: Loop: 1326#L65-2 assume !(mp_add_~i~0 % 256 == 1); 1324#L66-1 assume !(mp_add_~i~0 % 256 == 2); 1321#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1317#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1313#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1118#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 1119#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1339#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1104#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1105#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1129#L61-3 assume true; 1130#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1138#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1122#L65 assume !(mp_add_~i~0 % 256 == 0); 1115#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 1116#L66-1 assume !(mp_add_~i~0 % 256 == 2); 1125#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1126#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1340#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1342#L76-1 assume !(mp_add_~i~0 % 256 == 0); 1297#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 1296#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1295#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1249#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1250#L61-3 assume true; 1149#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1150#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1330#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1134#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1135#L76-1 assume !(mp_add_~i~0 % 256 == 0); 1292#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1283#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1281#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 1282#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1152#L61-3 assume true; 1153#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1293#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1305#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1326#L65-2 [2018-11-10 03:38:00,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 2 times [2018-11-10 03:38:00,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:00,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:00,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:00,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1256298437, now seen corresponding path program 1 times [2018-11-10 03:38:00,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:00,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:00,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:00,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:38:00,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:00,919 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:00,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:00,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:01,053 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 03:38:01,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:38:01,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2018-11-10 03:38:01,081 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:38:01,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:38:01,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:38:01,081 INFO L87 Difference]: Start difference. First operand 246 states and 348 transitions. cyclomatic complexity: 106 Second operand 9 states. [2018-11-10 03:38:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:01,409 INFO L93 Difference]: Finished difference Result 372 states and 475 transitions. [2018-11-10 03:38:01,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:38:01,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 475 transitions. [2018-11-10 03:38:01,411 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 288 [2018-11-10 03:38:01,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 372 states and 475 transitions. [2018-11-10 03:38:01,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-10 03:38:01,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-10 03:38:01,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 475 transitions. [2018-11-10 03:38:01,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:01,414 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 475 transitions. [2018-11-10 03:38:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 475 transitions. [2018-11-10 03:38:01,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 243. [2018-11-10 03:38:01,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-11-10 03:38:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 324 transitions. [2018-11-10 03:38:01,422 INFO L728 BuchiCegarLoop]: Abstraction has 243 states and 324 transitions. [2018-11-10 03:38:01,422 INFO L608 BuchiCegarLoop]: Abstraction has 243 states and 324 transitions. [2018-11-10 03:38:01,422 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 03:38:01,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 243 states and 324 transitions. [2018-11-10 03:38:01,423 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 191 [2018-11-10 03:38:01,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:01,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:01,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:01,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:01,424 INFO L793 eck$LassoCheckResult]: Stem: 1885#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1863#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1858#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1860#L42 assume !(mp_add_~a2~0 % 256 == 0); 1854#L40-1 mp_add_~nb~0 := 4; 1855#L50 assume !(mp_add_~b3~0 % 256 == 0); 1867#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2047#L61-3 assume true; 2046#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2045#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2044#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1998#L65-2 [2018-11-10 03:38:01,424 INFO L795 eck$LassoCheckResult]: Loop: 1998#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2043#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2042#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2039#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2037#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2036#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 1974#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2035#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2034#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2033#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2032#L61-3 assume true; 2031#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2030#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2029#L65 assume !(mp_add_~i~0 % 256 == 0); 2028#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 1997#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2026#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2024#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2022#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2021#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2019#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 1972#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2017#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2015#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2012#L61-3 assume true; 1889#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1884#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1872#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1857#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1864#L76-1 assume !(mp_add_~i~0 % 256 == 0); 1865#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1985#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 1969#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1918#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1919#L61-3 assume true; 1906#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1908#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1981#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1998#L65-2 [2018-11-10 03:38:01,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:01,424 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 3 times [2018-11-10 03:38:01,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:01,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:01,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:01,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:01,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1320919799, now seen corresponding path program 1 times [2018-11-10 03:38:01,447 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:01,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:38:01,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:01,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:38:01,488 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:38:01,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:38:01,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:38:01,489 INFO L87 Difference]: Start difference. First operand 243 states and 324 transitions. cyclomatic complexity: 85 Second operand 4 states. [2018-11-10 03:38:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:01,545 INFO L93 Difference]: Finished difference Result 457 states and 602 transitions. [2018-11-10 03:38:01,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:38:01,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 602 transitions. [2018-11-10 03:38:01,548 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 397 [2018-11-10 03:38:01,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 457 states and 602 transitions. [2018-11-10 03:38:01,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 457 [2018-11-10 03:38:01,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2018-11-10 03:38:01,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 457 states and 602 transitions. [2018-11-10 03:38:01,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:01,552 INFO L705 BuchiCegarLoop]: Abstraction has 457 states and 602 transitions. [2018-11-10 03:38:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states and 602 transitions. [2018-11-10 03:38:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 326. [2018-11-10 03:38:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-10 03:38:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 447 transitions. [2018-11-10 03:38:01,560 INFO L728 BuchiCegarLoop]: Abstraction has 326 states and 447 transitions. [2018-11-10 03:38:01,560 INFO L608 BuchiCegarLoop]: Abstraction has 326 states and 447 transitions. [2018-11-10 03:38:01,560 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 03:38:01,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 326 states and 447 transitions. [2018-11-10 03:38:01,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 274 [2018-11-10 03:38:01,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:01,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:01,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:01,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:01,562 INFO L793 eck$LassoCheckResult]: Stem: 2598#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2569#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2564#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2566#L42 assume !(mp_add_~a2~0 % 256 == 0); 2560#L40-1 mp_add_~nb~0 := 4; 2561#L50 assume !(mp_add_~b3~0 % 256 == 0); 2587#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2588#L61-3 assume true; 2589#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2590#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2599#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2613#L65-2 [2018-11-10 03:38:01,563 INFO L795 eck$LassoCheckResult]: Loop: 2613#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2601#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2578#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2579#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2568#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2572#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 2552#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2553#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2558#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2559#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2582#L61-3 assume true; 2583#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2757#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2575#L65 assume !(mp_add_~i~0 % 256 == 0); 2570#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 2571#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2836#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2835#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2833#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 2832#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2830#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 2636#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2828#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2827#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2826#L61-3 assume true; 2824#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2823#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2822#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2817#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 2818#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2840#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2779#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 2628#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2625#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2622#L61-3 assume true; 2623#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2615#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2616#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2613#L65-2 [2018-11-10 03:38:01,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:01,563 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 4 times [2018-11-10 03:38:01,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:01,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:01,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:01,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:01,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:01,585 INFO L82 PathProgramCache]: Analyzing trace with hash 110244339, now seen corresponding path program 1 times [2018-11-10 03:38:01,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:01,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:01,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:01,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:01,633 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:01,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:01,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:01,691 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:38:01,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:38:01,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-11-10 03:38:01,714 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:38:01,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:38:01,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:38:01,715 INFO L87 Difference]: Start difference. First operand 326 states and 447 transitions. cyclomatic complexity: 125 Second operand 7 states. [2018-11-10 03:38:01,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:01,829 INFO L93 Difference]: Finished difference Result 479 states and 631 transitions. [2018-11-10 03:38:01,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:38:01,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 479 states and 631 transitions. [2018-11-10 03:38:01,831 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 407 [2018-11-10 03:38:01,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 479 states to 479 states and 631 transitions. [2018-11-10 03:38:01,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 479 [2018-11-10 03:38:01,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2018-11-10 03:38:01,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 479 states and 631 transitions. [2018-11-10 03:38:01,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:01,835 INFO L705 BuchiCegarLoop]: Abstraction has 479 states and 631 transitions. [2018-11-10 03:38:01,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states and 631 transitions. [2018-11-10 03:38:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 331. [2018-11-10 03:38:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-11-10 03:38:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 451 transitions. [2018-11-10 03:38:01,841 INFO L728 BuchiCegarLoop]: Abstraction has 331 states and 451 transitions. [2018-11-10 03:38:01,841 INFO L608 BuchiCegarLoop]: Abstraction has 331 states and 451 transitions. [2018-11-10 03:38:01,841 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 03:38:01,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 451 transitions. [2018-11-10 03:38:01,843 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 278 [2018-11-10 03:38:01,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:01,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:01,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:01,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:01,844 INFO L793 eck$LassoCheckResult]: Stem: 3525#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3491#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3492#L42 assume !(mp_add_~a2~0 % 256 == 0); 3521#L40-1 mp_add_~nb~0 := 4; 3517#L50 assume !(mp_add_~b3~0 % 256 == 0); 3498#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3506#L61-3 assume true; 3507#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3523#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3493#L65-2 [2018-11-10 03:38:01,844 INFO L795 eck$LassoCheckResult]: Loop: 3493#L65-2 assume !(mp_add_~i~0 % 256 == 1); 3494#L66-1 assume !(mp_add_~i~0 % 256 == 2); 3503#L67-1 assume !(mp_add_~i~0 % 256 == 3); 3504#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3509#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3496#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 3478#L80-1 assume !(mp_add_~i~0 % 256 == 1); 3479#L81-1 assume !(mp_add_~i~0 % 256 == 2); 3484#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3485#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3701#L61-3 assume true; 3700#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3699#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3698#L65 assume !(mp_add_~i~0 % 256 == 0); 3697#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 3678#L66-1 assume !(mp_add_~i~0 % 256 == 2); 3695#L67-1 assume !(mp_add_~i~0 % 256 == 3); 3693#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3690#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3689#L76-1 assume !(mp_add_~i~0 % 256 == 0); 3688#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 3636#L81-1 assume !(mp_add_~i~0 % 256 == 2); 3687#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3684#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3682#L61-3 assume true; 3679#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3665#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 3666#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3800#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 3652#L76-1 assume !(mp_add_~i~0 % 256 == 0); 3708#L80-1 assume !(mp_add_~i~0 % 256 == 1); 3703#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 3614#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3558#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3556#L61-3 assume true; 3552#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3553#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3646#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3493#L65-2 [2018-11-10 03:38:01,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:01,844 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 5 times [2018-11-10 03:38:01,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:01,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:01,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:01,861 INFO L82 PathProgramCache]: Analyzing trace with hash 927892789, now seen corresponding path program 2 times [2018-11-10 03:38:01,861 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:01,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:01,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:01,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:38:01,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:38:01,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:38:01,910 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:38:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:38:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:38:01,911 INFO L87 Difference]: Start difference. First operand 331 states and 451 transitions. cyclomatic complexity: 124 Second operand 5 states. [2018-11-10 03:38:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:02,157 INFO L93 Difference]: Finished difference Result 670 states and 950 transitions. [2018-11-10 03:38:02,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:38:02,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 950 transitions. [2018-11-10 03:38:02,161 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 591 [2018-11-10 03:38:02,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 670 states and 950 transitions. [2018-11-10 03:38:02,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 670 [2018-11-10 03:38:02,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 670 [2018-11-10 03:38:02,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 670 states and 950 transitions. [2018-11-10 03:38:02,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:02,165 INFO L705 BuchiCegarLoop]: Abstraction has 670 states and 950 transitions. [2018-11-10 03:38:02,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states and 950 transitions. [2018-11-10 03:38:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 531. [2018-11-10 03:38:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-11-10 03:38:02,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 783 transitions. [2018-11-10 03:38:02,176 INFO L728 BuchiCegarLoop]: Abstraction has 531 states and 783 transitions. [2018-11-10 03:38:02,176 INFO L608 BuchiCegarLoop]: Abstraction has 531 states and 783 transitions. [2018-11-10 03:38:02,176 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 03:38:02,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 531 states and 783 transitions. [2018-11-10 03:38:02,178 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 470 [2018-11-10 03:38:02,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:02,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:02,179 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:02,179 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:02,179 INFO L793 eck$LassoCheckResult]: Stem: 4534#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4503#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4504#L42 assume !(mp_add_~a2~0 % 256 == 0); 4530#L40-1 mp_add_~nb~0 := 4; 4816#L50 assume !(mp_add_~b3~0 % 256 == 0); 4524#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4525#L61-3 assume true; 4526#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4527#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4995#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4936#L65-2 [2018-11-10 03:38:02,179 INFO L795 eck$LassoCheckResult]: Loop: 4936#L65-2 assume !(mp_add_~i~0 % 256 == 1); 4994#L66-1 assume !(mp_add_~i~0 % 256 == 2); 4993#L67-1 assume !(mp_add_~i~0 % 256 == 3); 4990#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4988#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4967#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 4614#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4966#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4965#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4964#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4959#L61-3 assume true; 4960#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4532#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4533#L65 assume !(mp_add_~i~0 % 256 == 0); 4505#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4506#L66-1 assume !(mp_add_~i~0 % 256 == 2); 4516#L67-1 assume !(mp_add_~i~0 % 256 == 3); 4517#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4502#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4997#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4490#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 4491#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4496#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4497#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4963#L61-3 assume true; 4957#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4958#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4962#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4961#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 4944#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4955#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4939#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 4578#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4872#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4924#L61-3 assume true; 4923#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4922#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4921#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4919#L71 assume !(mp_add_~i~0 % 256 == 0); 4920#L71-2 assume !(mp_add_~i~0 % 256 == 1); 4909#L72-1 assume !(mp_add_~i~0 % 256 == 2); 4910#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 4885#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4907#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4905#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4903#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4900#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 4899#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4898#L61-3 assume true; 4896#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4892#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4887#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4883#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 4879#L76-1 assume !(mp_add_~i~0 % 256 == 0); 4877#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4875#L81-1 assume !(mp_add_~i~0 % 256 == 2); 4873#L82-1 assume !(mp_add_~i~0 % 256 == 3); 4562#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 4563#L61-3 assume true; 4556#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4557#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4640#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4936#L65-2 [2018-11-10 03:38:02,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 6 times [2018-11-10 03:38:02,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:02,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:02,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:02,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:02,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:02,201 INFO L82 PathProgramCache]: Analyzing trace with hash -625713779, now seen corresponding path program 1 times [2018-11-10 03:38:02,201 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:02,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:02,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:38:02,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:02,289 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 82 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:38:02,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:02,289 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:02,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:02,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 03:38:02,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:38:02,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-10 03:38:02,402 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:38:02,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:38:02,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:38:02,402 INFO L87 Difference]: Start difference. First operand 531 states and 783 transitions. cyclomatic complexity: 256 Second operand 8 states. [2018-11-10 03:38:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:38:02,887 INFO L93 Difference]: Finished difference Result 1479 states and 2081 transitions. [2018-11-10 03:38:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:38:02,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1479 states and 2081 transitions. [2018-11-10 03:38:02,896 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1342 [2018-11-10 03:38:02,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1479 states to 1445 states and 2047 transitions. [2018-11-10 03:38:02,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1445 [2018-11-10 03:38:02,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1445 [2018-11-10 03:38:02,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1445 states and 2047 transitions. [2018-11-10 03:38:02,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:38:02,906 INFO L705 BuchiCegarLoop]: Abstraction has 1445 states and 2047 transitions. [2018-11-10 03:38:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states and 2047 transitions. [2018-11-10 03:38:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1346. [2018-11-10 03:38:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-11-10 03:38:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1929 transitions. [2018-11-10 03:38:02,928 INFO L728 BuchiCegarLoop]: Abstraction has 1346 states and 1929 transitions. [2018-11-10 03:38:02,929 INFO L608 BuchiCegarLoop]: Abstraction has 1346 states and 1929 transitions. [2018-11-10 03:38:02,929 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 03:38:02,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1346 states and 1929 transitions. [2018-11-10 03:38:02,934 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1278 [2018-11-10 03:38:02,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:38:02,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:38:02,935 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:02,935 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:38:02,935 INFO L793 eck$LassoCheckResult]: Stem: 6751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6726#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6722#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6723#L42 assume !(mp_add_~a2~0 % 256 == 0); 6748#L40-1 mp_add_~nb~0 := 4; 6744#L50 assume !(mp_add_~b3~0 % 256 == 0); 6729#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7143#L61-3 assume true; 7141#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7140#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7094#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7066#L65-2 [2018-11-10 03:38:02,935 INFO L795 eck$LassoCheckResult]: Loop: 7066#L65-2 assume !(mp_add_~i~0 % 256 == 1); 7091#L66-1 assume !(mp_add_~i~0 % 256 == 2); 7087#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7088#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7070#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6841#L71-2 assume !(mp_add_~i~0 % 256 == 1); 7069#L72-1 assume !(mp_add_~i~0 % 256 == 2); 7057#L73-1 assume !(mp_add_~i~0 % 256 == 3); 7056#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7052#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 6870#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7051#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7050#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7049#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7048#L61-3 assume true; 7047#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7046#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7045#L65 assume !(mp_add_~i~0 % 256 == 0); 7044#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 6953#L66-1 assume !(mp_add_~i~0 % 256 == 2); 7043#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7041#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7040#L71 assume !(mp_add_~i~0 % 256 == 0); 7039#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 6838#L72-1 assume !(mp_add_~i~0 % 256 == 2); 7038#L73-1 assume !(mp_add_~i~0 % 256 == 3); 7037#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7035#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7033#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 6868#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7031#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7029#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7027#L61-3 assume true; 7024#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7019#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7020#L65 assume !(mp_add_~i~0 % 256 == 0); 7023#L65-2 assume !(mp_add_~i~0 % 256 == 1); 7022#L66-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 7017#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7018#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7158#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7157#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7155#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7151#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 7083#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7150#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7149#L61-3 assume true; 7146#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7144#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7142#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6998#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 7136#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7134#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7133#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7131#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 7130#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7129#L61-3 assume true; 7128#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7127#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7126#L65 assume !(mp_add_~i~0 % 256 == 0); 7120#L65-2 assume !(mp_add_~i~0 % 256 == 1); 7116#L66-1 assume !(mp_add_~i~0 % 256 == 2); 7114#L67-1 assume !(mp_add_~i~0 % 256 == 3); 7110#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6902#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7086#L76-1 assume !(mp_add_~i~0 % 256 == 0); 7084#L80-1 assume !(mp_add_~i~0 % 256 == 1); 7082#L81-1 assume !(mp_add_~i~0 % 256 == 2); 7081#L82-1 assume !(mp_add_~i~0 % 256 == 3); 7080#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 7079#L61-3 assume true; 7078#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7076#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7077#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7066#L65-2 [2018-11-10 03:38:02,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:02,936 INFO L82 PathProgramCache]: Analyzing trace with hash -307170478, now seen corresponding path program 7 times [2018-11-10 03:38:02,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:02,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:02,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:38:02,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:38:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1313734941, now seen corresponding path program 1 times [2018-11-10 03:38:02,951 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:38:02,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:38:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:02,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:38:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:02,998 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 83 proven. 3 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 03:38:02,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:38:02,999 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:38:03,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:38:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:38:03,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:38:03,880 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 03:38:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 110 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:38:03,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:38:03,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-11-10 03:38:03,984 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:38:03,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:38:03,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=67, Unknown=1, NotChecked=0, Total=90 [2018-11-10 03:38:03,984 INFO L87 Difference]: Start difference. First operand 1346 states and 1929 transitions. cyclomatic complexity: 591 Second operand 10 states. [2018-11-10 03:38:05,574 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-10 03:38:05,937 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-10 03:38:07,258 WARN L179 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-10 03:38:10,397 WARN L179 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-10 03:38:39,831 WARN L179 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-10 03:38:42,780 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 03:38:43,239 WARN L179 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-10 03:38:45,491 WARN L179 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 03:38:47,472 WARN L179 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 03:38:52,633 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-10 03:39:04,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:04,496 INFO L93 Difference]: Finished difference Result 3931 states and 5166 transitions. [2018-11-10 03:39:04,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-10 03:39:04,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3931 states and 5166 transitions. [2018-11-10 03:39:04,513 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 3295 [2018-11-10 03:39:04,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3931 states to 3845 states and 5047 transitions. [2018-11-10 03:39:04,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3845 [2018-11-10 03:39:04,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3845 [2018-11-10 03:39:04,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3845 states and 5047 transitions. [2018-11-10 03:39:04,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:04,538 INFO L705 BuchiCegarLoop]: Abstraction has 3845 states and 5047 transitions. [2018-11-10 03:39:04,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states and 5047 transitions. [2018-11-10 03:39:04,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 2089. [2018-11-10 03:39:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2018-11-10 03:39:04,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2820 transitions. [2018-11-10 03:39:04,583 INFO L728 BuchiCegarLoop]: Abstraction has 2089 states and 2820 transitions. [2018-11-10 03:39:04,583 INFO L608 BuchiCegarLoop]: Abstraction has 2089 states and 2820 transitions. [2018-11-10 03:39:04,584 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 03:39:04,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2089 states and 2820 transitions. [2018-11-10 03:39:04,591 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1889 [2018-11-10 03:39:04,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:04,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:04,592 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:04,592 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:04,592 INFO L793 eck$LassoCheckResult]: Stem: 12402#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 12368#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 12369#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 12401#L44 assume !(mp_add_~a1~0 % 256 == 0); 12405#L40-1 mp_add_~nb~0 := 4; 12438#L50 assume !(mp_add_~b3~0 % 256 == 0); 12439#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 13361#L61-3 assume true; 13658#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13657#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13264#L64-1 [2018-11-10 03:39:04,592 INFO L795 eck$LassoCheckResult]: Loop: 13264#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13265#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 13256#L71-2 assume !(mp_add_~i~0 % 256 == 1); 13257#L72-1 assume !(mp_add_~i~0 % 256 == 2); 14063#L73-1 assume !(mp_add_~i~0 % 256 == 3); 14061#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14058#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 14055#L80-1 assume !(mp_add_~i~0 % 256 == 1); 14052#L81-1 assume !(mp_add_~i~0 % 256 == 2); 14049#L82-1 assume !(mp_add_~i~0 % 256 == 3); 14046#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 14042#L61-3 assume true; 14043#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14032#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14031#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13998#L71 assume !(mp_add_~i~0 % 256 == 0); 13983#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 13440#L72-1 assume !(mp_add_~i~0 % 256 == 2); 13982#L73-1 assume !(mp_add_~i~0 % 256 == 3); 13980#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13979#L76-1 assume !(mp_add_~i~0 % 256 == 0); 13978#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 13977#L81-1 assume !(mp_add_~i~0 % 256 == 2); 13976#L82-1 assume !(mp_add_~i~0 % 256 == 3); 13975#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 13974#L61-3 assume true; 13973#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13969#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13970#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13967#L71 assume !(mp_add_~i~0 % 256 == 0); 13966#L71-2 assume !(mp_add_~i~0 % 256 == 1); 13965#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 13964#L73-1 assume !(mp_add_~i~0 % 256 == 3); 13962#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13961#L76-1 assume !(mp_add_~i~0 % 256 == 0); 13960#L80-1 assume !(mp_add_~i~0 % 256 == 1); 13959#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 13958#L82-1 assume !(mp_add_~i~0 % 256 == 3); 13957#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 13956#L61-3 assume true; 13955#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13883#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13884#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13881#L71 assume !(mp_add_~i~0 % 256 == 0); 13602#L71-2 assume !(mp_add_~i~0 % 256 == 1); 13603#L72-1 assume !(mp_add_~i~0 % 256 == 2); 13506#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 13486#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 13504#L76-1 assume !(mp_add_~i~0 % 256 == 0); 13503#L80-1 assume !(mp_add_~i~0 % 256 == 1); 13502#L81-1 assume !(mp_add_~i~0 % 256 == 2); 13500#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 13499#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 13498#L61-3 assume true; 13495#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13492#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13494#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 13877#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 13876#L76-1 assume !(mp_add_~i~0 % 256 == 0); 13875#L80-1 assume !(mp_add_~i~0 % 256 == 1); 13863#L81-1 assume !(mp_add_~i~0 % 256 == 2); 13862#L82-1 assume !(mp_add_~i~0 % 256 == 3); 13262#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 13263#L61-3 assume true; 13274#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13275#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13264#L64-1 [2018-11-10 03:39:04,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash -363513735, now seen corresponding path program 1 times [2018-11-10 03:39:04,593 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:04,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:04,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:04,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:04,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:04,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:04,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:04,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:39:04,664 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:04,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:04,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1064436471, now seen corresponding path program 1 times [2018-11-10 03:39:04,664 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:04,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:04,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:04,847 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 03:39:04,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:04,848 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:04,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:04,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:05,093 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 03:39:05,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:05,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-10 03:39:05,110 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:05,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:39:05,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:39:05,111 INFO L87 Difference]: Start difference. First operand 2089 states and 2820 transitions. cyclomatic complexity: 745 Second operand 8 states. [2018-11-10 03:39:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:05,780 INFO L93 Difference]: Finished difference Result 4721 states and 6259 transitions. [2018-11-10 03:39:05,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 03:39:05,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4721 states and 6259 transitions. [2018-11-10 03:39:05,795 INFO L131 ngComponentsAnalysis]: Automaton has 39 accepting balls. 4097 [2018-11-10 03:39:05,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4721 states to 4686 states and 6215 transitions. [2018-11-10 03:39:05,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4686 [2018-11-10 03:39:05,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4686 [2018-11-10 03:39:05,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4686 states and 6215 transitions. [2018-11-10 03:39:05,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:05,819 INFO L705 BuchiCegarLoop]: Abstraction has 4686 states and 6215 transitions. [2018-11-10 03:39:05,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4686 states and 6215 transitions. [2018-11-10 03:39:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4686 to 2671. [2018-11-10 03:39:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2671 states. [2018-11-10 03:39:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2671 states to 2671 states and 3593 transitions. [2018-11-10 03:39:05,867 INFO L728 BuchiCegarLoop]: Abstraction has 2671 states and 3593 transitions. [2018-11-10 03:39:05,867 INFO L608 BuchiCegarLoop]: Abstraction has 2671 states and 3593 transitions. [2018-11-10 03:39:05,867 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 03:39:05,867 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2671 states and 3593 transitions. [2018-11-10 03:39:05,875 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 2406 [2018-11-10 03:39:05,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:05,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:05,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:05,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:05,876 INFO L793 eck$LassoCheckResult]: Stem: 19442#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 19412#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 19408#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 19409#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 19440#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 19447#L40-1 mp_add_~nb~0 := 4; 19487#L50 assume !(mp_add_~b3~0 % 256 == 0); 19488#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 20961#L61-3 assume true; 20974#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20973#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 20936#L64-1 [2018-11-10 03:39:05,876 INFO L795 eck$LassoCheckResult]: Loop: 20936#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20997#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 20874#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21751#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21750#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21749#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 21747#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 21745#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21743#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21741#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21739#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21737#L61-3 assume true; 21734#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 21735#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22064#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21690#L71 assume !(mp_add_~i~0 % 256 == 0); 21689#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 20869#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21688#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21687#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 21685#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21683#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 21682#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21680#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21678#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21676#L61-3 assume true; 21673#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 21674#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22063#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21642#L71 assume !(mp_add_~i~0 % 256 == 0); 21640#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21638#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 21636#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21634#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 21589#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21628#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21625#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 20790#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21622#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21619#L61-3 assume true; 21614#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 21591#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21548#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21571#L71 assume !(mp_add_~i~0 % 256 == 0); 21569#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21567#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21561#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 20569#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20570#L76-1 assume !(mp_add_~i~0 % 256 == 0); 20908#L80-1 assume !(mp_add_~i~0 % 256 == 1); 20910#L81-1 assume !(mp_add_~i~0 % 256 == 2); 20902#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 20903#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 20898#L61-3 assume true; 20899#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20889#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 20891#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 21563#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 20528#L76-1 assume !(mp_add_~i~0 % 256 == 0); 20529#L80-1 assume !(mp_add_~i~0 % 256 == 1); 20518#L81-1 assume !(mp_add_~i~0 % 256 == 2); 20519#L82-1 assume !(mp_add_~i~0 % 256 == 3); 20979#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21717#L61-3 assume true; 21716#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 21715#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 20936#L64-1 [2018-11-10 03:39:05,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521097, now seen corresponding path program 1 times [2018-11-10 03:39:05,877 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:05,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:05,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:05,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:05,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:05,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:39:05,938 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:05,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash 992049913, now seen corresponding path program 2 times [2018-11-10 03:39:05,939 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:05,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:05,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 03:39:06,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:06,066 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:06,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:39:06,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 03:39:06,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:39:06,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 58 proven. 9 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 03:39:06,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:06,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-10 03:39:06,446 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:06,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:39:06,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:39:06,446 INFO L87 Difference]: Start difference. First operand 2671 states and 3593 transitions. cyclomatic complexity: 943 Second operand 8 states. [2018-11-10 03:39:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:07,693 INFO L93 Difference]: Finished difference Result 3196 states and 4197 transitions. [2018-11-10 03:39:07,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:39:07,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3196 states and 4197 transitions. [2018-11-10 03:39:07,698 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 2719 [2018-11-10 03:39:07,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3196 states to 3175 states and 4167 transitions. [2018-11-10 03:39:07,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3175 [2018-11-10 03:39:07,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3175 [2018-11-10 03:39:07,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3175 states and 4167 transitions. [2018-11-10 03:39:07,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:07,709 INFO L705 BuchiCegarLoop]: Abstraction has 3175 states and 4167 transitions. [2018-11-10 03:39:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states and 4167 transitions. [2018-11-10 03:39:07,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2720. [2018-11-10 03:39:07,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2720 states. [2018-11-10 03:39:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 3636 transitions. [2018-11-10 03:39:07,759 INFO L728 BuchiCegarLoop]: Abstraction has 2720 states and 3636 transitions. [2018-11-10 03:39:07,759 INFO L608 BuchiCegarLoop]: Abstraction has 2720 states and 3636 transitions. [2018-11-10 03:39:07,759 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 03:39:07,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2720 states and 3636 transitions. [2018-11-10 03:39:07,766 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 2460 [2018-11-10 03:39:07,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:07,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:07,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:07,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:07,767 INFO L793 eck$LassoCheckResult]: Stem: 25538#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 25503#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25504#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25536#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25542#L40-1 mp_add_~nb~0 := 4; 25958#L50 assume !(mp_add_~b3~0 % 256 == 0); 25959#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 27500#L61-3 assume true; 27499#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27498#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27190#L65 [2018-11-10 03:39:07,767 INFO L795 eck$LassoCheckResult]: Loop: 27190#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 27497#L65-2 assume !(mp_add_~i~0 % 256 == 1); 27496#L66-1 assume !(mp_add_~i~0 % 256 == 2); 27494#L67-1 assume !(mp_add_~i~0 % 256 == 3); 26502#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26497#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 26496#L71-2 assume !(mp_add_~i~0 % 256 == 1); 26494#L72-1 assume !(mp_add_~i~0 % 256 == 2); 26495#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28032#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28030#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 28028#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28026#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28024#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28022#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 26483#L61-3 assume true; 26484#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 28020#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27998#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25497#L71 assume !(mp_add_~i~0 % 256 == 0); 25498#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 25528#L72-1 assume !(mp_add_~i~0 % 256 == 2); 25529#L73-1 assume !(mp_add_~i~0 % 256 == 3); 27837#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 27835#L76-1 assume !(mp_add_~i~0 % 256 == 0); 27836#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 26515#L81-1 assume !(mp_add_~i~0 % 256 == 2); 27831#L82-1 assume !(mp_add_~i~0 % 256 == 3); 27832#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 27990#L61-3 assume true; 27826#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27827#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27774#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27773#L71 assume !(mp_add_~i~0 % 256 == 0); 27772#L71-2 assume !(mp_add_~i~0 % 256 == 1); 27771#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 27770#L73-1 assume !(mp_add_~i~0 % 256 == 3); 27768#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 27767#L76-1 assume !(mp_add_~i~0 % 256 == 0); 27766#L80-1 assume !(mp_add_~i~0 % 256 == 1); 27508#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 27507#L82-1 assume !(mp_add_~i~0 % 256 == 3); 27506#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 27505#L61-3 assume true; 27501#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27502#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27909#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27875#L71 assume !(mp_add_~i~0 % 256 == 0); 27110#L71-2 assume !(mp_add_~i~0 % 256 == 1); 27107#L72-1 assume !(mp_add_~i~0 % 256 == 2); 27109#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 27866#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 27865#L76-1 assume !(mp_add_~i~0 % 256 == 0); 27864#L80-1 assume !(mp_add_~i~0 % 256 == 1); 27863#L81-1 assume !(mp_add_~i~0 % 256 == 2); 27862#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 27078#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 27079#L61-3 assume true; 27860#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27069#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27070#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27103#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 27104#L76-1 assume !(mp_add_~i~0 % 256 == 0); 27094#L80-1 assume !(mp_add_~i~0 % 256 == 1); 27095#L81-1 assume !(mp_add_~i~0 % 256 == 2); 26508#L82-1 assume !(mp_add_~i~0 % 256 == 3); 26507#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 26498#L61-3 assume true; 26499#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27495#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27190#L65 [2018-11-10 03:39:07,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:07,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2138521123, now seen corresponding path program 1 times [2018-11-10 03:39:07,768 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:07,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:07,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:07,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:07,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1874364975, now seen corresponding path program 1 times [2018-11-10 03:39:07,784 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:07,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:07,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:07,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 56 proven. 58 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-10 03:39:07,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:07,893 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:07,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:07,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 97 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 03:39:08,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:08,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-10 03:39:08,109 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:08,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 03:39:08,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-10 03:39:08,110 INFO L87 Difference]: Start difference. First operand 2720 states and 3636 transitions. cyclomatic complexity: 938 Second operand 14 states. [2018-11-10 03:39:11,461 WARN L179 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 25 DAG size of output: 14 [2018-11-10 03:39:24,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:24,188 INFO L93 Difference]: Finished difference Result 4739 states and 5899 transitions. [2018-11-10 03:39:24,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-10 03:39:24,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4739 states and 5899 transitions. [2018-11-10 03:39:24,197 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 3560 [2018-11-10 03:39:24,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4739 states to 4575 states and 5704 transitions. [2018-11-10 03:39:24,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4575 [2018-11-10 03:39:24,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4575 [2018-11-10 03:39:24,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4575 states and 5704 transitions. [2018-11-10 03:39:24,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:24,210 INFO L705 BuchiCegarLoop]: Abstraction has 4575 states and 5704 transitions. [2018-11-10 03:39:24,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states and 5704 transitions. [2018-11-10 03:39:24,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 2320. [2018-11-10 03:39:24,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2320 states. [2018-11-10 03:39:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2320 states to 2320 states and 3025 transitions. [2018-11-10 03:39:24,249 INFO L728 BuchiCegarLoop]: Abstraction has 2320 states and 3025 transitions. [2018-11-10 03:39:24,249 INFO L608 BuchiCegarLoop]: Abstraction has 2320 states and 3025 transitions. [2018-11-10 03:39:24,249 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 03:39:24,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2320 states and 3025 transitions. [2018-11-10 03:39:24,254 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 1980 [2018-11-10 03:39:24,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:24,255 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:24,255 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:24,255 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:24,256 INFO L793 eck$LassoCheckResult]: Stem: 33288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 33258#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 33253#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 33255#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 33286#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 33249#L40-1 mp_add_~nb~0 := 4; 33250#L50 assume !(mp_add_~b3~0 % 256 == 0); 33862#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 33861#L61-3 assume true; 33860#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33859#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33856#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33855#L65-2 assume !(mp_add_~i~0 % 256 == 1); 33853#L66-1 assume !(mp_add_~i~0 % 256 == 2); 33854#L67-1 assume !(mp_add_~i~0 % 256 == 3); 34033#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33849#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 33848#L71-2 [2018-11-10 03:39:24,256 INFO L795 eck$LassoCheckResult]: Loop: 33848#L71-2 assume !(mp_add_~i~0 % 256 == 1); 33847#L72-1 assume !(mp_add_~i~0 % 256 == 2); 33846#L73-1 assume !(mp_add_~i~0 % 256 == 3); 33844#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33841#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 33839#L80-1 assume !(mp_add_~i~0 % 256 == 1); 33838#L81-1 assume !(mp_add_~i~0 % 256 == 2); 33836#L82-1 assume !(mp_add_~i~0 % 256 == 3); 33837#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 33810#L61-3 assume true; 33811#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35530#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35365#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33248#L71 assume !(mp_add_~i~0 % 256 == 0); 33244#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 33245#L72-1 assume !(mp_add_~i~0 % 256 == 2); 33251#L73-1 assume !(mp_add_~i~0 % 256 == 3); 33252#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35555#L76-1 assume !(mp_add_~i~0 % 256 == 0); 35556#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 34474#L81-1 assume !(mp_add_~i~0 % 256 == 2); 35558#L82-1 assume !(mp_add_~i~0 % 256 == 3); 35384#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 35383#L61-3 assume true; 35378#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35376#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35377#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35374#L71 assume !(mp_add_~i~0 % 256 == 0); 35373#L71-2 assume !(mp_add_~i~0 % 256 == 1); 35372#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 35371#L73-1 assume !(mp_add_~i~0 % 256 == 3); 35369#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35368#L76-1 assume !(mp_add_~i~0 % 256 == 0); 35367#L80-1 assume !(mp_add_~i~0 % 256 == 1); 35362#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 35361#L82-1 assume !(mp_add_~i~0 % 256 == 3); 35359#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 35358#L61-3 assume true; 35356#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35357#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35490#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35352#L71 assume !(mp_add_~i~0 % 256 == 0); 35351#L71-2 assume !(mp_add_~i~0 % 256 == 1); 35350#L72-1 assume !(mp_add_~i~0 % 256 == 2); 35349#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 33927#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35348#L76-1 assume !(mp_add_~i~0 % 256 == 0); 35347#L80-1 assume !(mp_add_~i~0 % 256 == 1); 35346#L81-1 assume !(mp_add_~i~0 % 256 == 2); 35345#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 34441#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 34437#L61-3 assume true; 34432#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34427#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33951#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33950#L71 assume !(mp_add_~i~0 % 256 == 0); 33949#L71-2 assume !(mp_add_~i~0 % 256 == 1); 33948#L72-1 assume !(mp_add_~i~0 % 256 == 2); 33947#L73-1 assume !(mp_add_~i~0 % 256 == 3); 33946#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33945#L76-1 assume !(mp_add_~i~0 % 256 == 0); 33944#L80-1 assume !(mp_add_~i~0 % 256 == 1); 33943#L81-1 assume !(mp_add_~i~0 % 256 == 2); 33942#L82-1 assume !(mp_add_~i~0 % 256 == 3); 33941#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 33940#L61-3 assume true; 33939#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33938#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33936#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33933#L71 assume !(mp_add_~i~0 % 256 == 0); 33934#L71-2 assume !(mp_add_~i~0 % 256 == 1); 33929#L72-1 assume !(mp_add_~i~0 % 256 == 2); 33930#L73-1 assume !(mp_add_~i~0 % 256 == 3); 33924#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33925#L76-1 assume !(mp_add_~i~0 % 256 == 0); 33920#L80-1 assume !(mp_add_~i~0 % 256 == 1); 33921#L81-1 assume !(mp_add_~i~0 % 256 == 2); 33917#L82-1 assume !(mp_add_~i~0 % 256 == 3); 33906#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 33905#L61-3 assume true; 33863#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33864#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33937#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33935#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 33848#L71-2 [2018-11-10 03:39:24,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:24,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1691654962, now seen corresponding path program 1 times [2018-11-10 03:39:24,256 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:24,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:24,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:24,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:24,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:24,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:24,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1518686045, now seen corresponding path program 1 times [2018-11-10 03:39:24,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:24,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:24,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:24,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:24,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:24,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 123 proven. 36 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 03:39:24,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:24,809 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:24,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:24,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:25,207 WARN L854 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~nb~0 Int)) (< (mod c_ULTIMATE.start_mp_add_~i~0 256) (mod ULTIMATE.start_mp_add_~nb~0 256))) is different from true [2018-11-10 03:39:26,161 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-10 03:39:26,413 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-10 03:39:26,676 WARN L179 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 03:39:26,932 WARN L179 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 03:39:28,032 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 1 not checked. [2018-11-10 03:39:28,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:39:28,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2018-11-10 03:39:28,048 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 03:39:28,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:39:28,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=130, Unknown=8, NotChecked=24, Total=210 [2018-11-10 03:39:28,048 INFO L87 Difference]: Start difference. First operand 2320 states and 3025 transitions. cyclomatic complexity: 721 Second operand 15 states. [2018-11-10 03:39:28,519 WARN L179 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-10 03:39:29,084 WARN L179 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-11-10 03:39:30,557 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2018-11-10 03:39:31,353 WARN L179 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2018-11-10 03:39:32,602 WARN L179 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-11-10 03:39:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:35,013 INFO L93 Difference]: Finished difference Result 2474 states and 2743 transitions. [2018-11-10 03:39:35,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 03:39:35,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2474 states and 2743 transitions. [2018-11-10 03:39:35,019 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 502 [2018-11-10 03:39:35,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2474 states to 2340 states and 2515 transitions. [2018-11-10 03:39:35,025 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2340 [2018-11-10 03:39:35,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2340 [2018-11-10 03:39:35,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2340 states and 2515 transitions. [2018-11-10 03:39:35,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:35,028 INFO L705 BuchiCegarLoop]: Abstraction has 2340 states and 2515 transitions. [2018-11-10 03:39:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2340 states and 2515 transitions. [2018-11-10 03:39:35,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2340 to 657. [2018-11-10 03:39:35,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-11-10 03:39:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 743 transitions. [2018-11-10 03:39:35,042 INFO L728 BuchiCegarLoop]: Abstraction has 657 states and 743 transitions. [2018-11-10 03:39:35,042 INFO L608 BuchiCegarLoop]: Abstraction has 657 states and 743 transitions. [2018-11-10 03:39:35,042 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 03:39:35,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 657 states and 743 transitions. [2018-11-10 03:39:35,044 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 125 [2018-11-10 03:39:35,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:35,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:35,044 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:35,044 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:35,045 INFO L793 eck$LassoCheckResult]: Stem: 38384#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 38361#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 38356#L40 assume !(mp_add_~a3~0 % 256 == 0); 38357#L40-1 mp_add_~nb~0 := 4; 38812#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 38504#L52 assume !(mp_add_~b2~0 % 256 == 0); 38503#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 38498#L61-3 assume true; 38499#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38494#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38495#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 38490#L65-2 assume !(mp_add_~i~0 % 256 == 1); 38491#L66-1 assume !(mp_add_~i~0 % 256 == 2); 38486#L67-1 assume !(mp_add_~i~0 % 256 == 3); 38487#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38815#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38475#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 38476#L80-1 assume !(mp_add_~i~0 % 256 == 1); 38463#L81-1 assume !(mp_add_~i~0 % 256 == 2); 38464#L82-1 assume !(mp_add_~i~0 % 256 == 3); 38451#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 38452#L61-3 assume true; 38439#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38440#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38429#L65 assume !(mp_add_~i~0 % 256 == 0); 38430#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 38419#L66-1 assume !(mp_add_~i~0 % 256 == 2); 38420#L67-1 assume !(mp_add_~i~0 % 256 == 3); 38407#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38403#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38402#L76-1 assume !(mp_add_~i~0 % 256 == 0); 38401#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 38400#L81-1 assume !(mp_add_~i~0 % 256 == 2); 38399#L82-1 assume !(mp_add_~i~0 % 256 == 3); 38398#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 38396#L61-3 assume true; 38397#L61-1 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0); 38393#L88-2 assume true; 38392#L88 assume !!(mp_add_~i~0 % 256 < 4); 38391#L89 assume !(mp_add_~i~0 % 256 == 0); 38390#L89-2 assume !(mp_add_~i~0 % 256 == 1); 38389#L90-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := 0; 38388#L91-1 assume !(mp_add_~i~0 % 256 == 3); 38346#L92-1 [2018-11-10 03:39:35,045 INFO L795 eck$LassoCheckResult]: Loop: 38346#L92-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 38374#L88-2 assume true; 38385#L88 assume !!(mp_add_~i~0 % 256 < 4); 38370#L89 assume !(mp_add_~i~0 % 256 == 0); 38366#L89-2 assume !(mp_add_~i~0 % 256 == 1); 38367#L90-1 assume !(mp_add_~i~0 % 256 == 2); 38345#L91-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := 0; 38346#L92-1 [2018-11-10 03:39:35,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:35,045 INFO L82 PathProgramCache]: Analyzing trace with hash -169993808, now seen corresponding path program 1 times [2018-11-10 03:39:35,045 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:35,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:35,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:39:35,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:35,117 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:35,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:35,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:35,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:39:35,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:39:35,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-11-10 03:39:35,190 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:35,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:35,191 INFO L82 PathProgramCache]: Analyzing trace with hash 864362241, now seen corresponding path program 1 times [2018-11-10 03:39:35,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:35,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:35,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:35,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:35,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:35,219 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:35,220 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:35,220 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:35,220 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:35,220 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:35,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:35,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:35,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:35,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration15_Loop [2018-11-10 03:39:35,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:35,221 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:35,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:35,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:35,306 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:35,306 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:35,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:35,309 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:35,314 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:35,314 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r3~0=0} Honda state: {ULTIMATE.start_mp_add_~r3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:35,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:35,334 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:35,372 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:35,372 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:35,576 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:35,578 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:35,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:35,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:35,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:35,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:35,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:35,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:35,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:35,578 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration15_Loop [2018-11-10 03:39:35,578 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:35,578 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:35,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:35,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:35,632 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:35,635 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:35,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:35,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:35,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:35,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:35,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,643 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:39:35,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,644 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:35,645 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:35,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,646 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:35,647 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:35,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,651 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:39:35,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,652 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:35,652 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:35,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,654 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:35,655 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:35,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,659 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:39:35,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,660 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:35,661 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:35,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:35,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,663 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:35,664 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:35,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,669 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:39:35,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,670 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:35,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,670 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:35,671 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:35,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:35,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,673 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:35,675 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:35,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,681 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:39:35,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,682 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:35,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,683 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:35,684 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:35,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,688 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:35,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:35,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:35,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,700 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:39:35,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,701 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:35,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,701 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:35,704 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:35,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:35,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,706 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:35,711 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:35,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,721 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:39:35,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,722 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:35,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:35,724 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:35,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,726 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:35,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,726 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:35,727 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:35,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,732 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:39:35,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,733 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:35,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,734 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:35,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:35,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:35,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:35,738 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:35,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:35,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:35,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:35,738 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:35,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:35,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:35,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:35,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:39:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:39:35,749 INFO L87 Difference]: Start difference. First operand 657 states and 743 transitions. cyclomatic complexity: 93 Second operand 9 states. [2018-11-10 03:39:36,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:36,188 INFO L93 Difference]: Finished difference Result 731 states and 817 transitions. [2018-11-10 03:39:36,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:39:36,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 731 states and 817 transitions. [2018-11-10 03:39:36,190 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 168 [2018-11-10 03:39:36,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 731 states to 717 states and 799 transitions. [2018-11-10 03:39:36,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 717 [2018-11-10 03:39:36,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 717 [2018-11-10 03:39:36,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 717 states and 799 transitions. [2018-11-10 03:39:36,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:36,193 INFO L705 BuchiCegarLoop]: Abstraction has 717 states and 799 transitions. [2018-11-10 03:39:36,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states and 799 transitions. [2018-11-10 03:39:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 641. [2018-11-10 03:39:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-11-10 03:39:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 720 transitions. [2018-11-10 03:39:36,199 INFO L728 BuchiCegarLoop]: Abstraction has 641 states and 720 transitions. [2018-11-10 03:39:36,199 INFO L608 BuchiCegarLoop]: Abstraction has 641 states and 720 transitions. [2018-11-10 03:39:36,199 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 03:39:36,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 641 states and 720 transitions. [2018-11-10 03:39:36,201 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 125 [2018-11-10 03:39:36,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:36,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:36,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:36,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:36,206 INFO L793 eck$LassoCheckResult]: Stem: 39926#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 39893#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 39888#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 39890#L42 assume !(mp_add_~a2~0 % 256 == 0); 39924#L40-1 mp_add_~nb~0 := 4; 40133#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 40131#L52 assume !(mp_add_~b2~0 % 256 == 0); 40128#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 40126#L61-3 assume true; 40124#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40122#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 40120#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 40118#L65-2 assume !(mp_add_~i~0 % 256 == 1); 40116#L66-1 assume !(mp_add_~i~0 % 256 == 2); 40114#L67-1 assume !(mp_add_~i~0 % 256 == 3); 40111#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 40109#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 40107#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 40106#L80-1 assume !(mp_add_~i~0 % 256 == 1); 40105#L81-1 assume !(mp_add_~i~0 % 256 == 2); 40103#L82-1 assume !(mp_add_~i~0 % 256 == 3); 40101#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 40099#L61-3 assume true; 40097#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40095#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 40093#L65 assume !(mp_add_~i~0 % 256 == 0); 40091#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 40089#L66-1 assume !(mp_add_~i~0 % 256 == 2); 40087#L67-1 assume !(mp_add_~i~0 % 256 == 3); 40085#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 40081#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 40082#L76-1 assume !(mp_add_~i~0 % 256 == 0); 40146#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 40144#L81-1 assume !(mp_add_~i~0 % 256 == 2); 40142#L82-1 assume !(mp_add_~i~0 % 256 == 3); 40141#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 40140#L61-3 assume true; 40138#L61-1 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0); 39928#L88-2 assume true; 39929#L88 assume !!(mp_add_~i~0 % 256 < 4); 39935#L89 assume !(mp_add_~i~0 % 256 == 0); 39900#L89-2 assume !(mp_add_~i~0 % 256 == 1); 39901#L90-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := 0; 39934#L91-1 assume !(mp_add_~i~0 % 256 == 3); 39880#L92-1 [2018-11-10 03:39:36,206 INFO L795 eck$LassoCheckResult]: Loop: 39880#L92-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 39909#L88-2 assume true; 39932#L88 assume !!(mp_add_~i~0 % 256 < 4); 39904#L89 assume !(mp_add_~i~0 % 256 == 0); 39905#L89-2 assume !(mp_add_~i~0 % 256 == 1); 39933#L90-1 assume !(mp_add_~i~0 % 256 == 2); 39879#L91-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := 0; 39880#L92-1 [2018-11-10 03:39:36,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:36,206 INFO L82 PathProgramCache]: Analyzing trace with hash 140799662, now seen corresponding path program 1 times [2018-11-10 03:39:36,207 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:36,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:36,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:36,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:36,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:36,385 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 03:39:36,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:39:36,386 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:39:36,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:36,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:39:36,476 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 03:39:36,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:39:36,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2018-11-10 03:39:36,497 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:36,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:36,497 INFO L82 PathProgramCache]: Analyzing trace with hash 864362241, now seen corresponding path program 2 times [2018-11-10 03:39:36,497 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:36,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:36,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:36,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:36,518 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:36,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:36,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:36,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:36,519 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:36,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:36,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:36,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:36,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration16_Loop [2018-11-10 03:39:36,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:36,519 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:36,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:36,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:36,571 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:36,571 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:36,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:36,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:36,576 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:36,576 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r3~0=0} Honda state: {ULTIMATE.start_mp_add_~r3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:36,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:36,619 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:36,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:36,654 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:36,933 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:36,935 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:36,935 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:36,935 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:36,936 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:36,936 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:36,936 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:36,936 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:36,936 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:36,936 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration16_Loop [2018-11-10 03:39:36,936 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:36,936 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:36,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:36,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:37,001 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:37,001 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:37,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:37,003 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:37,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:37,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:37,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,007 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:39:37,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:37,009 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:37,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:37,013 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:37,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,014 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:39:37,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,015 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:37,016 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:37,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,024 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:37,024 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:37,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,025 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:39:37,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,026 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:37,027 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:37,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:37,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,040 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:37,041 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:37,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,041 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,041 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:39:37,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,042 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,042 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:37,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,043 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:37,043 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:37,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,048 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:37,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,049 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:37,049 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:37,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,050 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,050 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:39:37,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,051 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:37,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,051 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:37,053 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:37,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,061 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:37,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,061 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:37,062 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:37,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,063 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:39:37,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:37,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,065 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:37,067 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:37,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,079 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,080 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,080 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:37,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,080 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:37,082 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:37,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,082 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,083 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:39:37,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,083 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:37,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,084 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:37,085 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:37,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,091 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,091 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:37,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,091 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:37,092 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:37,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,094 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:39:37,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,094 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:37,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,095 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:37,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:37,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:37,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:37,107 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:37,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:37,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:37,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:37,108 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:37,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:37,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:37,111 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:37,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:39:37,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:39:37,112 INFO L87 Difference]: Start difference. First operand 641 states and 720 transitions. cyclomatic complexity: 86 Second operand 11 states. [2018-11-10 03:39:37,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:37,733 INFO L93 Difference]: Finished difference Result 1124 states and 1230 transitions. [2018-11-10 03:39:37,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:39:37,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1124 states and 1230 transitions. [2018-11-10 03:39:37,737 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 348 [2018-11-10 03:39:37,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1124 states to 1063 states and 1165 transitions. [2018-11-10 03:39:37,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1063 [2018-11-10 03:39:37,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1063 [2018-11-10 03:39:37,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1063 states and 1165 transitions. [2018-11-10 03:39:37,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:37,740 INFO L705 BuchiCegarLoop]: Abstraction has 1063 states and 1165 transitions. [2018-11-10 03:39:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states and 1165 transitions. [2018-11-10 03:39:37,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 726. [2018-11-10 03:39:37,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-10 03:39:37,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 807 transitions. [2018-11-10 03:39:37,748 INFO L728 BuchiCegarLoop]: Abstraction has 726 states and 807 transitions. [2018-11-10 03:39:37,749 INFO L608 BuchiCegarLoop]: Abstraction has 726 states and 807 transitions. [2018-11-10 03:39:37,749 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 03:39:37,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 726 states and 807 transitions. [2018-11-10 03:39:37,750 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 143 [2018-11-10 03:39:37,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:37,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:37,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:37,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:37,751 INFO L793 eck$LassoCheckResult]: Stem: 41835#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41811#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 41806#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 41808#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 41832#L44 assume !(mp_add_~a1~0 % 256 == 0); 41838#L40-1 mp_add_~nb~0 := 4; 41916#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 41915#L52 assume !(mp_add_~b2~0 % 256 == 0); 41913#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 41912#L61-3 assume true; 41911#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41910#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41909#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 41908#L65-2 assume !(mp_add_~i~0 % 256 == 1); 41906#L66-1 assume !(mp_add_~i~0 % 256 == 2); 41904#L67-1 assume !(mp_add_~i~0 % 256 == 3); 41901#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41899#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41897#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 41895#L80-1 assume !(mp_add_~i~0 % 256 == 1); 41893#L81-1 assume !(mp_add_~i~0 % 256 == 2); 41891#L82-1 assume !(mp_add_~i~0 % 256 == 3); 41889#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 41887#L61-3 assume true; 41885#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41881#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41878#L65 assume !(mp_add_~i~0 % 256 == 0); 41875#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 41872#L66-1 assume !(mp_add_~i~0 % 256 == 2); 41869#L67-1 assume !(mp_add_~i~0 % 256 == 3); 41862#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41863#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41856#L76-1 assume !(mp_add_~i~0 % 256 == 0); 41857#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 41852#L81-1 assume !(mp_add_~i~0 % 256 == 2); 41853#L82-1 assume !(mp_add_~i~0 % 256 == 3); 41848#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 41849#L61-3 assume true; 41845#L61-1 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0); 41844#L88-2 assume true; 41843#L88 assume !!(mp_add_~i~0 % 256 < 4); 41842#L89 assume !(mp_add_~i~0 % 256 == 0); 41841#L89-2 assume !(mp_add_~i~0 % 256 == 1); 41840#L90-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := 0; 41839#L91-1 assume !(mp_add_~i~0 % 256 == 3); 41796#L92-1 [2018-11-10 03:39:37,752 INFO L795 eck$LassoCheckResult]: Loop: 41796#L92-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 41824#L88-2 assume true; 41836#L88 assume !!(mp_add_~i~0 % 256 < 4); 41821#L89 assume !(mp_add_~i~0 % 256 == 0); 41817#L89-2 assume !(mp_add_~i~0 % 256 == 1); 41818#L90-1 assume !(mp_add_~i~0 % 256 == 2); 41795#L91-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := 0; 41796#L92-1 [2018-11-10 03:39:37,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:37,752 INFO L82 PathProgramCache]: Analyzing trace with hash -853051609, now seen corresponding path program 1 times [2018-11-10 03:39:37,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:37,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:37,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:37,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 03:39:37,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:37,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:39:37,810 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:37,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash 864362241, now seen corresponding path program 3 times [2018-11-10 03:39:37,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:37,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:37,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:37,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:37,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:37,844 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:37,844 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:37,844 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:37,844 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:37,844 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:37,844 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:37,844 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:37,845 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:37,845 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration17_Loop [2018-11-10 03:39:37,845 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:37,845 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:37,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:37,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:37,933 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:37,933 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:37,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:37,937 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:37,940 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:39:37,940 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r3~0=0} Honda state: {ULTIMATE.start_mp_add_~r3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:37,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:37,971 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:38,018 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:38,018 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:38,344 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:38,345 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:38,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:38,346 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:38,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:38,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:38,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:38,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:38,346 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:38,346 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration17_Loop [2018-11-10 03:39:38,346 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:38,346 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:38,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:38,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:38,404 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:38,405 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:38,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:38,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:38,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,406 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:38,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:38,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,409 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:39:38,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,410 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:38,410 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:38,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,411 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,412 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:38,412 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:38,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,414 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,414 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:39:38,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,415 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:38,415 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:38,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,416 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,417 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:38,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:38,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,420 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:39:38,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,421 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:38,421 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:38,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,421 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:38,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,423 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:38,423 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:38,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,426 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:39:38,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,427 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:38,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,427 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:38,427 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:38,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,429 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:38,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,429 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:38,430 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:38,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,433 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,433 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:39:38,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,434 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,434 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:38,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:38,435 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:38,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,437 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:38,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:38,438 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:38,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,443 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:39:38,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,444 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:38,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,444 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:38,445 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:38,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,446 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:38,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,447 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:38,448 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:38,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,455 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,456 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:39:38,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,456 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:38,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:38,457 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:38,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,459 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:38,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,460 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:38,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:38,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,464 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:39:38,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,465 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:38,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,465 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:38,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:38,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:38,468 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:38,469 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:38,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:38,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:38,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:38,469 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:38,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:38,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:38,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:39:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:39:38,481 INFO L87 Difference]: Start difference. First operand 726 states and 807 transitions. cyclomatic complexity: 89 Second operand 7 states. [2018-11-10 03:39:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:39,387 INFO L93 Difference]: Finished difference Result 1306 states and 1436 transitions. [2018-11-10 03:39:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:39:39,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1306 states and 1436 transitions. [2018-11-10 03:39:39,390 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 322 [2018-11-10 03:39:39,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1306 states to 1302 states and 1432 transitions. [2018-11-10 03:39:39,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1302 [2018-11-10 03:39:39,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1302 [2018-11-10 03:39:39,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1302 states and 1432 transitions. [2018-11-10 03:39:39,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:39,394 INFO L705 BuchiCegarLoop]: Abstraction has 1302 states and 1432 transitions. [2018-11-10 03:39:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states and 1432 transitions. [2018-11-10 03:39:39,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 981. [2018-11-10 03:39:39,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 981 states. [2018-11-10 03:39:39,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1086 transitions. [2018-11-10 03:39:39,401 INFO L728 BuchiCegarLoop]: Abstraction has 981 states and 1086 transitions. [2018-11-10 03:39:39,401 INFO L608 BuchiCegarLoop]: Abstraction has 981 states and 1086 transitions. [2018-11-10 03:39:39,401 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 03:39:39,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 981 states and 1086 transitions. [2018-11-10 03:39:39,404 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 169 [2018-11-10 03:39:39,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:39,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:39,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:39,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:39,405 INFO L793 eck$LassoCheckResult]: Stem: 43887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 43861#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 43856#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 43858#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 43884#L44 assume !(mp_add_~a1~0 % 256 == 0); 43890#L40-1 mp_add_~nb~0 := 4; 43989#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 43986#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 43984#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 43982#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 43980#L61-3 assume true; 43978#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43976#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43974#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 43972#L65-2 assume !(mp_add_~i~0 % 256 == 1); 43970#L66-1 assume !(mp_add_~i~0 % 256 == 2); 43967#L67-1 assume !(mp_add_~i~0 % 256 == 3); 43963#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 43960#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43957#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 43954#L80-1 assume !(mp_add_~i~0 % 256 == 1); 43951#L81-1 assume !(mp_add_~i~0 % 256 == 2); 43948#L82-1 assume !(mp_add_~i~0 % 256 == 3); 43945#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 43942#L61-3 assume true; 43939#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 43936#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43931#L65 assume !(mp_add_~i~0 % 256 == 0); 43928#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 43917#L66-1 assume !(mp_add_~i~0 % 256 == 2); 43918#L67-1 assume !(mp_add_~i~0 % 256 == 3); 43909#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 43910#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 44271#L76-1 assume !(mp_add_~i~0 % 256 == 0); 44270#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 44269#L81-1 assume !(mp_add_~i~0 % 256 == 2); 44268#L82-1 assume !(mp_add_~i~0 % 256 == 3); 44267#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 44266#L61-3 assume true; 43897#L61-1 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0); 43896#L88-2 assume true; 43895#L88 assume !!(mp_add_~i~0 % 256 < 4); 43894#L89 assume !(mp_add_~i~0 % 256 == 0); 43893#L89-2 assume !(mp_add_~i~0 % 256 == 1); 43892#L90-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := 0; 43891#L91-1 assume !(mp_add_~i~0 % 256 == 3); 43846#L92-1 [2018-11-10 03:39:39,405 INFO L795 eck$LassoCheckResult]: Loop: 43846#L92-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 43873#L88-2 assume true; 43888#L88 assume !!(mp_add_~i~0 % 256 < 4); 43870#L89 assume !(mp_add_~i~0 % 256 == 0); 43866#L89-2 assume !(mp_add_~i~0 % 256 == 1); 43867#L90-1 assume !(mp_add_~i~0 % 256 == 2); 43845#L91-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := 0; 43846#L92-1 [2018-11-10 03:39:39,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1162860525, now seen corresponding path program 1 times [2018-11-10 03:39:39,406 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:39,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:39,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:39,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:39,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:39:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 03:39:39,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:39:39,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 03:39:39,495 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 03:39:39,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:39,495 INFO L82 PathProgramCache]: Analyzing trace with hash 864362241, now seen corresponding path program 4 times [2018-11-10 03:39:39,495 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:39,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:39,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:39,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:39,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:39,519 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:39,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:39,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:39,519 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:39,519 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:39,519 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:39,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:39,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:39,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration18_Loop [2018-11-10 03:39:39,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:39,520 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:39,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:39,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:39,578 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:39,578 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:39,583 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:39,583 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:39,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:39,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:40,119 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:40,120 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:40,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:40,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:40,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:40,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:40,120 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:40,120 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:40,120 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:40,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration18_Loop [2018-11-10 03:39:40,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:40,121 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:40,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:40,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:40,208 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:40,209 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:40,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:40,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:40,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:40,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:40,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,215 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:39:40,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,216 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:40,216 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:40,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,219 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:40,219 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:40,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,220 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:39:40,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,221 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:40,221 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:40,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,224 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:40,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:40,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,226 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:39:40,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,227 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:40,227 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:40,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:40,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,231 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:40,232 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:40,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,232 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:39:40,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,233 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:40,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,234 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:40,234 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:40,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:40,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,240 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:40,240 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:40,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,241 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:39:40,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,241 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,242 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:40,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:40,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:40,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,249 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,249 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:40,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,250 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:40,251 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:40,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,252 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:39:40,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,252 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:40,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,253 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:40,254 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:40,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,262 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,263 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:40,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,263 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:40,264 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:40,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,265 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:39:40,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,265 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,266 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:40,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,266 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:40,267 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:40,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,272 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:40,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,272 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:40,273 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:40,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,274 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:39:40,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,275 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,275 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:40,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,276 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:40,277 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:40,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:40,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:40,285 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:40,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:40,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:40,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:40,285 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:40,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:40,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:40,288 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:40,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:39:40,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:39:40,288 INFO L87 Difference]: Start difference. First operand 981 states and 1086 transitions. cyclomatic complexity: 114 Second operand 9 states. [2018-11-10 03:39:42,484 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2018-11-10 03:39:42,805 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-11-10 03:39:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:39:42,997 INFO L93 Difference]: Finished difference Result 1282 states and 1389 transitions. [2018-11-10 03:39:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:39:42,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1282 states and 1389 transitions. [2018-11-10 03:39:43,000 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 283 [2018-11-10 03:39:43,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1282 states to 1207 states and 1308 transitions. [2018-11-10 03:39:43,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1207 [2018-11-10 03:39:43,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1207 [2018-11-10 03:39:43,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1207 states and 1308 transitions. [2018-11-10 03:39:43,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:39:43,004 INFO L705 BuchiCegarLoop]: Abstraction has 1207 states and 1308 transitions. [2018-11-10 03:39:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states and 1308 transitions. [2018-11-10 03:39:43,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 935. [2018-11-10 03:39:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 935 states. [2018-11-10 03:39:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1018 transitions. [2018-11-10 03:39:43,011 INFO L728 BuchiCegarLoop]: Abstraction has 935 states and 1018 transitions. [2018-11-10 03:39:43,011 INFO L608 BuchiCegarLoop]: Abstraction has 935 states and 1018 transitions. [2018-11-10 03:39:43,011 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 03:39:43,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 935 states and 1018 transitions. [2018-11-10 03:39:43,013 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 143 [2018-11-10 03:39:43,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:39:43,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:39:43,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:43,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:39:43,015 INFO L793 eck$LassoCheckResult]: Stem: 46175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 46151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 46146#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46148#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46173#L44 assume !(mp_add_~a1~0 % 256 == 0); 46179#L40-1 mp_add_~nb~0 := 4; 46231#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46229#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46227#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46226#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 46225#L61-3 assume true; 46224#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46223#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46222#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 46221#L65-2 assume !(mp_add_~i~0 % 256 == 1); 46220#L66-1 assume !(mp_add_~i~0 % 256 == 2); 46219#L67-1 assume !(mp_add_~i~0 % 256 == 3); 46218#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 46217#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 46216#L71-2 assume !(mp_add_~i~0 % 256 == 1); 46215#L72-1 assume !(mp_add_~i~0 % 256 == 2); 46214#L73-1 assume !(mp_add_~i~0 % 256 == 3); 46213#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 46212#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 46211#L80-1 assume !(mp_add_~i~0 % 256 == 1); 46210#L81-1 assume !(mp_add_~i~0 % 256 == 2); 46209#L82-1 assume !(mp_add_~i~0 % 256 == 3); 46208#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 46207#L61-3 assume true; 46206#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46205#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46204#L65 assume !(mp_add_~i~0 % 256 == 0); 46203#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 46202#L66-1 assume !(mp_add_~i~0 % 256 == 2); 46201#L67-1 assume !(mp_add_~i~0 % 256 == 3); 46200#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46197#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 46196#L76-1 assume !(mp_add_~i~0 % 256 == 0); 46195#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 46194#L81-1 assume !(mp_add_~i~0 % 256 == 2); 46193#L82-1 assume !(mp_add_~i~0 % 256 == 3); 46192#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 46191#L61-3 assume true; 46190#L61-1 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0); 46189#L88-2 assume true; 46188#L88 assume !!(mp_add_~i~0 % 256 < 4); 46187#L89 assume !(mp_add_~i~0 % 256 == 0); 46186#L89-2 assume !(mp_add_~i~0 % 256 == 1); 46185#L90-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := 0; 46184#L91-1 assume !(mp_add_~i~0 % 256 == 3); 46135#L92-1 [2018-11-10 03:39:43,015 INFO L795 eck$LassoCheckResult]: Loop: 46135#L92-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 46164#L88-2 assume true; 46176#L88 assume !!(mp_add_~i~0 % 256 < 4); 46161#L89 assume !(mp_add_~i~0 % 256 == 0); 46157#L89-2 assume !(mp_add_~i~0 % 256 == 1); 46158#L90-1 assume !(mp_add_~i~0 % 256 == 2); 46134#L91-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := 0; 46135#L92-1 [2018-11-10 03:39:43,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:43,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1733826873, now seen corresponding path program 1 times [2018-11-10 03:39:43,015 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:43,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:43,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:43,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:43,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:43,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash 864362241, now seen corresponding path program 5 times [2018-11-10 03:39:43,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:39:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:43,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:39:43,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2022232709, now seen corresponding path program 1 times [2018-11-10 03:39:43,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:39:43,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:39:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:43,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:39:43,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:39:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:39:43,100 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:43,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:43,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:43,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:43,101 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:43,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:43,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:43,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:43,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-11-10 03:39:43,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:43,101 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:43,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:43,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:43,171 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:43,171 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:43,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:39:43,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:43,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:39:43,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:39:43,715 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:39:43,716 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:43,716 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:43,716 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:43,716 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:43,716 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:39:43,716 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:43,716 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:43,716 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:43,716 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-11-10 03:39:43,716 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:43,716 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:43,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:43,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:43,758 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:39:43,759 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:39:43,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:43,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:43,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:39:43,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:39:43,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,762 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:39:43,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,763 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:43,763 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:43,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:43,766 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:43,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,766 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:39:43,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,767 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:43,768 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:43,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:43,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:43,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,771 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:39:43,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,772 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:43,773 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:43,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:39:43,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,776 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:43,776 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:43,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,777 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:39:43,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,777 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,778 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:43,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:43,779 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:43,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,782 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:43,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,782 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:39:43,783 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:39:43,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,783 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:39:43,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,784 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:43,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:43,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:43,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,789 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,790 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:39:43,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,790 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:43,790 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:43,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,791 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:39:43,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,792 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,792 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:43,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,792 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:43,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:43,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,802 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:43,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,803 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:39:43,804 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:39:43,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,804 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:39:43,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,805 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:43,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:43,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:43,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,810 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:39:43,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:39:43,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:39:43,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,812 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:39:43,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,813 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:43,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,813 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:43,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:43,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:43,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:39:43,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:39:43,820 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:39:43,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:39:43,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:39:43,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:39:43,820 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:39:43,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:39:43,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:39:43,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:39:44,659 WARN L179 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 124 [2018-11-10 03:39:45,359 WARN L179 SmtUtils]: Spent 698.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-10 03:39:45,361 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:39:45,361 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:39:45,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:39:45,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:39:45,361 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:39:45,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:39:45,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:39:45,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:39:45,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration19_Lasso [2018-11-10 03:39:45,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:39:45,361 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:39:45,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:39:45,715 WARN L179 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-10 03:40:03,501 WARN L179 SmtUtils]: Spent 17.73 s on a formula simplification. DAG size of input: 177 DAG size of output: 168 [2018-11-10 03:40:35,082 WARN L179 SmtUtils]: Spent 31.56 s on a formula simplification that was a NOOP. DAG size: 168 [2018-11-10 03:40:35,084 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:40:35,084 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:40:35,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:40:35,088 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:40:35,090 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:40:35,090 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:40:35,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:40:35,106 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:40:35,108 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:40:35,108 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:40:35,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:40:35,123 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:40:35,145 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:40:35,145 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:40:35,321 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:40:35,322 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:40:35,322 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:40:35,322 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:40:35,322 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:40:35,322 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:40:35,323 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:40:35,323 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:40:35,323 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:40:35,323 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration19_Lasso [2018-11-10 03:40:35,323 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:40:35,323 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:40:35,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:35,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:37,031 WARN L179 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-10 03:40:37,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:40:52,911 WARN L179 SmtUtils]: Spent 15.84 s on a formula simplification. DAG size of input: 177 DAG size of output: 168 [2018-11-10 03:41:10,738 WARN L179 SmtUtils]: Spent 17.80 s on a formula simplification that was a NOOP. DAG size: 168 [2018-11-10 03:41:10,740 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:10,740 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:41:10,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:10,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:41:10,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,745 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:10,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:41:10,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:10,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:41:10,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:10,760 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:41:10,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:10,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:41:10,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:10,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 03:41:10,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:10,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:10,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,776 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:41:10,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,777 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,779 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,780 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:10,780 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:10,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,782 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,782 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,784 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:10,784 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:10,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,790 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,791 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,792 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,792 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,795 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,795 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:10,795 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:10,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,797 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,797 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,799 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,799 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,799 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,800 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,802 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,802 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:10,802 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:10,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,804 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,805 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:10,805 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:10,807 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,808 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,812 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:10,812 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:10,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,824 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:10,824 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:10,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,825 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:41:10,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,826 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,826 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,828 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:10,828 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:10,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,834 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:10,835 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:10,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,853 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,853 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,853 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,855 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,856 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,857 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:10,857 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:10,859 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,868 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,868 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,870 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,871 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,872 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:10,872 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:10,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,876 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,876 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:10,877 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:10,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,885 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:10,886 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:10,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,905 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:10,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:10,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,906 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:41:10,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,907 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,907 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,908 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,910 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:10,910 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:10,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,913 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,914 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,914 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,915 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,917 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:10,917 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:10,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,934 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,935 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,936 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,937 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,937 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,938 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,939 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,940 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:10,940 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:10,942 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,943 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,944 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,946 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,947 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,947 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,949 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,949 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,952 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:10,952 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:10,957 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,959 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:10,959 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:10,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,970 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:10,970 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:10,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:10,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,997 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:10,997 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:10,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:10,998 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:10,998 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:41:10,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:10,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:10,999 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:10,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:10,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:10,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:10,999 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,000 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,001 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,001 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,001 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,002 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:11,002 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:11,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,005 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,005 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,006 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,006 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,007 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,008 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,009 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:11,009 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:11,017 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,018 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,018 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,019 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,020 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,021 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,021 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,022 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,023 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,023 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,024 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:11,024 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:11,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,027 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,027 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,027 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,028 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,028 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,030 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,030 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,030 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,032 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,032 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,032 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,033 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,034 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,035 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,035 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,036 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:11,036 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:11,038 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,039 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,039 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,039 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,040 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:11,040 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:11,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,044 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,048 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 03:41:11,049 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 03:41:11,064 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,065 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,065 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:11,066 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:11,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,066 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:41:11,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,067 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,067 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,068 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,068 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,069 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,070 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,070 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,070 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,071 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,071 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,074 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,075 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,077 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,077 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,079 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,079 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,089 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,089 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,090 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,148 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,149 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,149 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,152 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,152 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,153 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,153 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,156 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,157 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,159 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,161 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,162 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,162 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,164 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,164 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,164 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,165 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,166 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,166 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,167 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,168 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,168 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,172 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,172 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,173 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,173 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,177 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,177 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,178 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,184 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,184 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,203 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,204 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:11,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,204 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,204 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,206 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:41:11,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,206 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,207 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,207 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,208 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,209 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,213 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:11,213 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:11,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,217 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,217 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,217 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,218 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,219 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,219 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,222 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:11,222 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:11,231 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,232 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,232 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,234 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,234 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,234 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,236 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,236 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,236 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,237 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:11,237 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:11,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,240 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,241 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,241 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,242 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,244 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,244 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,246 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,246 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,246 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,247 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,248 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,248 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,249 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:11,249 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:11,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,253 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,254 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,255 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:11,255 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:11,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,271 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,272 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,279 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 03:41:11,279 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 03:41:11,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,303 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,304 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:11,304 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:11,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,305 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:41:11,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,306 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,307 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,307 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,307 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,309 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,309 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,316 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,316 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,319 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,319 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,319 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,321 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,323 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,323 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,337 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,337 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,339 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,341 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,341 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,341 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,342 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,343 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,343 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,344 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,344 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,346 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,346 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,347 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,374 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,375 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,375 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,378 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,379 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,379 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,405 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,406 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,406 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,406 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,409 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,410 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,414 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 03:41:11,414 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 03:41:11,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,429 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:11,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:11,430 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:11,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,431 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:41:11,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,438 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,438 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,441 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,441 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 03:41:11,442 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 03:41:11,444 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,445 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,445 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,445 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,475 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,475 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,475 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,477 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 03:41:11,477 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 03:41:11,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,508 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,508 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,508 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,511 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,513 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,514 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,514 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 03:41:11,515 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 03:41:11,517 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,518 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,518 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,518 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,519 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,520 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,520 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,520 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,547 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,547 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,549 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,549 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,549 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,550 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 03:41:11,550 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 03:41:11,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,553 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,554 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,554 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 03:41:11,555 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 03:41:11,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,558 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,582 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,583 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,589 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 03:41:11,589 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 03:41:11,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:11,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:11,611 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:11,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:11,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:11,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:11,611 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:11,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:11,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:11,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:11,613 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-10 03:41:11,613 INFO L793 eck$LassoCheckResult]: Stem: 46175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 46151#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 46146#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46148#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46173#L44 assume !(mp_add_~a1~0 % 256 == 0); 46179#L40-1 mp_add_~nb~0 := 4; 46231#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46229#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46227#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46226#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 46225#L61-3 assume true; 46224#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46223#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46222#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 46221#L65-2 assume !(mp_add_~i~0 % 256 == 1); 46220#L66-1 assume !(mp_add_~i~0 % 256 == 2); 46219#L67-1 assume !(mp_add_~i~0 % 256 == 3); 46218#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 46217#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 46216#L71-2 assume !(mp_add_~i~0 % 256 == 1); 46215#L72-1 assume !(mp_add_~i~0 % 256 == 2); 46214#L73-1 assume !(mp_add_~i~0 % 256 == 3); 46213#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 46212#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 46211#L80-1 assume !(mp_add_~i~0 % 256 == 1); 46210#L81-1 assume !(mp_add_~i~0 % 256 == 2); 46209#L82-1 assume !(mp_add_~i~0 % 256 == 3); 46208#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 46207#L61-3 assume true; 46206#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 46205#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46204#L65 assume !(mp_add_~i~0 % 256 == 0); 46203#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 46202#L66-1 assume !(mp_add_~i~0 % 256 == 2); 46201#L67-1 assume !(mp_add_~i~0 % 256 == 3); 46200#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46197#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 46196#L76-1 assume !(mp_add_~i~0 % 256 == 0); 46195#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 46194#L81-1 assume !(mp_add_~i~0 % 256 == 2); 46193#L82-1 assume !(mp_add_~i~0 % 256 == 3); 46192#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 46191#L61-3 assume true; 46190#L61-1 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0); 46189#L88-2 assume true; 46188#L88 assume !!(mp_add_~i~0 % 256 < 4); 46187#L89 assume !(mp_add_~i~0 % 256 == 0); 46186#L89-2 assume !(mp_add_~i~0 % 256 == 1); 46185#L90-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := 0; 46184#L91-1 assume !(mp_add_~i~0 % 256 == 3); 46135#L92-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 46164#L88-2 assume true; 46176#L88 assume !!(mp_add_~i~0 % 256 < 4); 46161#L89 assume !(mp_add_~i~0 % 256 == 0); 46157#L89-2 assume !(mp_add_~i~0 % 256 == 1); 46158#L90-1 assume !(mp_add_~i~0 % 256 == 2); 46134#L91-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := 0; 46135#L92-1 [2018-11-10 03:41:11,617 INFO L795 eck$LassoCheckResult]: Loop: 46135#L92-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 46164#L88-2 assume true; 46176#L88 assume !!(mp_add_~i~0 % 256 < 4); 46161#L89 assume !(mp_add_~i~0 % 256 == 0); 46157#L89-2 assume !(mp_add_~i~0 % 256 == 1); 46158#L90-1 assume !(mp_add_~i~0 % 256 == 2); 46134#L91-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := 0; 46135#L92-1 [2018-11-10 03:41:11,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2022232709, now seen corresponding path program 2 times [2018-11-10 03:41:11,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:11,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:11,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:11,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:11,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:11,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash 864362241, now seen corresponding path program 6 times [2018-11-10 03:41:11,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:11,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:11,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:11,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:41:11,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:11,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:11,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1100958649, now seen corresponding path program 3 times [2018-11-10 03:41:11,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:11,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:11,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:11,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:41:11,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:41:12,030 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-11-10 03:41:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-10 03:41:12,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:41:12,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 03:41:12,115 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:12,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:12,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:12,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:12,115 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:41:12,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:12,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:12,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:12,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-11-10 03:41:12,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:12,116 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:12,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:12,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:12,193 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:12,193 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:12,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:41:12,195 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:12,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:41:12,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:41:12,447 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:41:12,448 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:12,448 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:12,448 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:12,448 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:12,448 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:41:12,449 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:12,449 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:12,449 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:12,449 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration19_Loop [2018-11-10 03:41:12,449 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:12,449 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:12,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:12,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:12,512 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:12,512 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:41:12,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:12,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:12,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:12,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:12,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,515 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:41:12,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,515 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:12,516 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:12,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,517 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:12,517 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:12,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,518 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:41:12,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,519 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:12,519 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:12,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,520 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,520 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:12,520 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:12,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,522 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:41:12,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,523 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:12,523 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:12,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,524 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:12,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,524 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:12,525 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:12,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,527 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,527 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:41:12,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,528 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,528 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:12,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:12,528 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:12,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,529 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:12,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,530 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:12,530 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:12,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,532 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,533 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:41:12,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,533 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,533 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:12,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:12,534 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:12,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,535 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,535 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:12,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,536 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:12,537 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:12,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,542 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:41:12,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,542 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:12,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,543 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:12,543 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:12,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,544 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:12,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,545 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:12,546 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:12,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,553 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:41:12,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,553 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:12,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,554 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:12,554 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:12,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,555 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:12,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,556 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:12,556 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:12,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,560 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:41:12,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:12,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,561 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:12,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:12,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:12,563 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:12,563 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:12,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:12,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:12,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:12,564 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:12,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:12,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:12,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:12,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:41:12,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:41:12,571 INFO L87 Difference]: Start difference. First operand 935 states and 1018 transitions. cyclomatic complexity: 91 Second operand 7 states. [2018-11-10 03:41:12,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:12,911 INFO L93 Difference]: Finished difference Result 1020 states and 1107 transitions. [2018-11-10 03:41:12,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:41:12,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1020 states and 1107 transitions. [2018-11-10 03:41:12,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2018-11-10 03:41:12,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1020 states to 907 states and 979 transitions. [2018-11-10 03:41:12,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 907 [2018-11-10 03:41:12,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 907 [2018-11-10 03:41:12,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 907 states and 979 transitions. [2018-11-10 03:41:12,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:41:12,917 INFO L705 BuchiCegarLoop]: Abstraction has 907 states and 979 transitions. [2018-11-10 03:41:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states and 979 transitions. [2018-11-10 03:41:12,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 727. [2018-11-10 03:41:12,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 727 states. [2018-11-10 03:41:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 790 transitions. [2018-11-10 03:41:12,923 INFO L728 BuchiCegarLoop]: Abstraction has 727 states and 790 transitions. [2018-11-10 03:41:12,923 INFO L608 BuchiCegarLoop]: Abstraction has 727 states and 790 transitions. [2018-11-10 03:41:12,923 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 03:41:12,924 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 727 states and 790 transitions. [2018-11-10 03:41:12,925 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 65 [2018-11-10 03:41:12,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:41:12,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:41:12,926 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:12,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:12,926 INFO L793 eck$LassoCheckResult]: Stem: 48148#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 48122#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 48117#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 48119#L42 assume !(mp_add_~a2~0 % 256 == 0); 48145#L40-1 mp_add_~nb~0 := 4; 48156#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 48151#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 48153#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 48508#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 48509#L61-3 assume true; 48504#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 48505#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 48500#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 48501#L65-2 assume !(mp_add_~i~0 % 256 == 1); 48496#L66-1 assume !(mp_add_~i~0 % 256 == 2); 48497#L67-1 assume !(mp_add_~i~0 % 256 == 3); 48492#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48493#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 48488#L71-2 assume !(mp_add_~i~0 % 256 == 1); 48489#L72-1 assume !(mp_add_~i~0 % 256 == 2); 48484#L73-1 assume !(mp_add_~i~0 % 256 == 3); 48485#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 48480#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 48481#L80-1 assume !(mp_add_~i~0 % 256 == 1); 48476#L81-1 assume !(mp_add_~i~0 % 256 == 2); 48477#L82-1 assume !(mp_add_~i~0 % 256 == 3); 48472#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 48473#L61-3 assume true; 48468#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 48469#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 48464#L65 assume !(mp_add_~i~0 % 256 == 0); 48465#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 48759#L66-1 assume !(mp_add_~i~0 % 256 == 2); 48760#L67-1 assume !(mp_add_~i~0 % 256 == 3); 48756#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 48116#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 48752#L76-1 assume !(mp_add_~i~0 % 256 == 0); 48753#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 48748#L81-1 assume !(mp_add_~i~0 % 256 == 2); 48749#L82-1 assume !(mp_add_~i~0 % 256 == 3); 48744#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 48745#L61-3 assume true; 48740#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 48741#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 48736#L65 assume !(mp_add_~i~0 % 256 == 0); 48737#L65-2 assume !(mp_add_~i~0 % 256 == 1); 48732#L66-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 48733#L67-1 assume !(mp_add_~i~0 % 256 == 3); 48819#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 48817#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 48818#L76-1 assume !(mp_add_~i~0 % 256 == 0); 48832#L80-1 assume !(mp_add_~i~0 % 256 == 1); 48831#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 48133#L82-1 [2018-11-10 03:41:12,926 INFO L795 eck$LassoCheckResult]: Loop: 48133#L82-1 assume !(mp_add_~i~0 % 256 == 3); 48804#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 48803#L61-3 assume true; 48802#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 48165#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 48127#L65 assume !(mp_add_~i~0 % 256 == 0); 48128#L65-2 assume !(mp_add_~i~0 % 256 == 1); 48149#L66-1 assume !(mp_add_~i~0 % 256 == 2); 48129#L67-1 assume !(mp_add_~i~0 % 256 == 3); 48130#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 48134#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 48123#L76-1 assume !(mp_add_~i~0 % 256 == 0); 48106#L80-1 assume !(mp_add_~i~0 % 256 == 1); 48107#L81-1 assume !(mp_add_~i~0 % 256 == 2); 48133#L82-1 [2018-11-10 03:41:12,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash -833826558, now seen corresponding path program 1 times [2018-11-10 03:41:12,926 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:12,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:12,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:41:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:12,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:12,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:12,950 INFO L82 PathProgramCache]: Analyzing trace with hash -461293119, now seen corresponding path program 1 times [2018-11-10 03:41:12,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:12,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:12,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:12,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:12,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:12,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:12,959 INFO L82 PathProgramCache]: Analyzing trace with hash 963097858, now seen corresponding path program 2 times [2018-11-10 03:41:12,959 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:12,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:12,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:12,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:41:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 03:41:13,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:41:13,223 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:41:13,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:41:13,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 03:41:13,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:41:13,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:41:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 03:41:13,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:41:13,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2018-11-10 03:41:13,380 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:13,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:13,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:13,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:13,380 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:41:13,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:13,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:13,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:13,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration20_Loop [2018-11-10 03:41:13,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:13,380 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:13,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:13,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:13,542 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:13,542 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:13,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:41:13,545 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:13,588 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:41:13,588 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:41:14,663 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:41:14,665 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:14,665 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:14,665 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:14,665 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:14,665 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:41:14,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:14,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:14,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:14,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration20_Loop [2018-11-10 03:41:14,665 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:14,665 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:14,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:14,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:14,789 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:14,789 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:41:14,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:14,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:14,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,792 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,792 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:14,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:14,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,793 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:41:14,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,794 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:14,794 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:14,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,796 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,799 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:14,799 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:14,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,800 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:41:14,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:14,801 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:14,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,804 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:14,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:14,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,806 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:41:14,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,807 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:14,807 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:14,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:14,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,811 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:14,812 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:14,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,812 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:41:14,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:14,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,814 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:14,815 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:14,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,822 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:14,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,822 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:14,823 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:14,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,824 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:41:14,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,824 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:14,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:14,826 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:14,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,832 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:14,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:14,833 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:14,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,834 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:41:14,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,835 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:14,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,835 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:14,837 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:14,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,845 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:14,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,845 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:14,846 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:14,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,847 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:41:14,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,847 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:14,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:14,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:14,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,854 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:14,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:14,855 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:14,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,857 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:41:14,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,859 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:14,859 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,860 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:14,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:14,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:14,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:14,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:14,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:14,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:14,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:14,875 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:14,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:14,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:14,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:14,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:41:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:41:14,879 INFO L87 Difference]: Start difference. First operand 727 states and 790 transitions. cyclomatic complexity: 67 Second operand 12 states. [2018-11-10 03:41:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:15,660 INFO L93 Difference]: Finished difference Result 768 states and 814 transitions. [2018-11-10 03:41:15,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-10 03:41:15,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 768 states and 814 transitions. [2018-11-10 03:41:15,661 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2018-11-10 03:41:15,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 768 states to 519 states and 551 transitions. [2018-11-10 03:41:15,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 519 [2018-11-10 03:41:15,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 519 [2018-11-10 03:41:15,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 519 states and 551 transitions. [2018-11-10 03:41:15,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:41:15,663 INFO L705 BuchiCegarLoop]: Abstraction has 519 states and 551 transitions. [2018-11-10 03:41:15,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states and 551 transitions. [2018-11-10 03:41:15,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 428. [2018-11-10 03:41:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-10 03:41:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 457 transitions. [2018-11-10 03:41:15,666 INFO L728 BuchiCegarLoop]: Abstraction has 428 states and 457 transitions. [2018-11-10 03:41:15,666 INFO L608 BuchiCegarLoop]: Abstraction has 428 states and 457 transitions. [2018-11-10 03:41:15,666 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 03:41:15,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 428 states and 457 transitions. [2018-11-10 03:41:15,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2018-11-10 03:41:15,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:41:15,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:41:15,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:15,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:15,667 INFO L793 eck$LassoCheckResult]: Stem: 49908#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 49880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 49875#L40 assume !(mp_add_~a3~0 % 256 == 0); 49876#L40-1 mp_add_~nb~0 := 4; 49911#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 49901#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 49882#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 49884#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 50024#L61-3 assume true; 50023#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 50022#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 49912#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 49913#L65-2 assume !(mp_add_~i~0 % 256 == 1); 50124#L66-1 assume !(mp_add_~i~0 % 256 == 2); 50123#L67-1 assume !(mp_add_~i~0 % 256 == 3); 50122#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 50121#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 49865#L71-2 assume !(mp_add_~i~0 % 256 == 1); 49866#L72-1 assume !(mp_add_~i~0 % 256 == 2); 50263#L73-1 assume !(mp_add_~i~0 % 256 == 3); 50262#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 50261#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 50260#L80-1 assume !(mp_add_~i~0 % 256 == 1); 50259#L81-1 assume !(mp_add_~i~0 % 256 == 2); 50258#L82-1 assume !(mp_add_~i~0 % 256 == 3); 50257#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 50256#L61-3 assume true; 50255#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 50254#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 50253#L65 assume !(mp_add_~i~0 % 256 == 0); 49878#L65-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 49879#L66-1 assume !(mp_add_~i~0 % 256 == 2); 50279#L67-1 assume !(mp_add_~i~0 % 256 == 3); 50278#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 50277#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 50276#L76-1 assume !(mp_add_~i~0 % 256 == 0); 50275#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 50274#L81-1 assume !(mp_add_~i~0 % 256 == 2); 50273#L82-1 assume !(mp_add_~i~0 % 256 == 3); 50268#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 50269#L61-3 assume true; 50264#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 50265#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 49885#L65 assume !(mp_add_~i~0 % 256 == 0); 49886#L65-2 assume !(mp_add_~i~0 % 256 == 1); 50270#L66-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 50271#L67-1 assume !(mp_add_~i~0 % 256 == 3); 49903#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 49874#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 49881#L76-1 assume !(mp_add_~i~0 % 256 == 0); 49863#L80-1 assume !(mp_add_~i~0 % 256 == 1); 49864#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 49867#L82-1 assume !(mp_add_~i~0 % 256 == 3); 49868#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 49924#L61-3 assume true; 49922#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 49923#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 50251#L65 assume !(mp_add_~i~0 % 256 == 0); 50250#L65-2 assume !(mp_add_~i~0 % 256 == 1); 50249#L66-1 assume !(mp_add_~i~0 % 256 == 2); 50237#L67-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 50238#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 50247#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 50248#L76-1 assume !(mp_add_~i~0 % 256 == 0); 50284#L80-1 assume !(mp_add_~i~0 % 256 == 1); 50282#L81-1 assume !(mp_add_~i~0 % 256 == 2); 50280#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 50272#L83-1 [2018-11-10 03:41:15,667 INFO L795 eck$LassoCheckResult]: Loop: 50272#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 50266#L61-3 assume true; 50267#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 49920#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 49921#L65 assume !(mp_add_~i~0 % 256 == 0); 50252#L65-2 assume !(mp_add_~i~0 % 256 == 1); 49909#L66-1 assume !(mp_add_~i~0 % 256 == 2); 49887#L67-1 assume !(mp_add_~i~0 % 256 == 3); 49888#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 50287#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 50286#L76-1 assume !(mp_add_~i~0 % 256 == 0); 50285#L80-1 assume !(mp_add_~i~0 % 256 == 1); 50283#L81-1 assume !(mp_add_~i~0 % 256 == 2); 50281#L82-1 assume !(mp_add_~i~0 % 256 == 3); 50272#L83-1 [2018-11-10 03:41:15,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:15,668 INFO L82 PathProgramCache]: Analyzing trace with hash 671857223, now seen corresponding path program 1 times [2018-11-10 03:41:15,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:15,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:15,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:15,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:41:15,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:15,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1506597377, now seen corresponding path program 2 times [2018-11-10 03:41:15,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:15,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:15,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:15,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:15,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:15,702 INFO L82 PathProgramCache]: Analyzing trace with hash 264905159, now seen corresponding path program 2 times [2018-11-10 03:41:15,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:15,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:15,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:15,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:41:15,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:41:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 64 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 03:41:15,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:41:15,955 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:41:15,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:41:15,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 03:41:15,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:41:15,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:41:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-11-10 03:41:16,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:41:16,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2018-11-10 03:41:16,147 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:16,147 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:16,147 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:16,147 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:16,147 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:41:16,147 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:16,147 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:16,147 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:16,147 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration21_Loop [2018-11-10 03:41:16,147 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:16,147 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:16,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:16,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:16,258 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:16,258 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:16,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:41:16,263 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:16,304 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:41:16,304 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:41:17,075 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:41:17,076 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:17,076 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:17,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:17,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:17,076 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:41:17,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:17,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:17,077 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:17,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration21_Loop [2018-11-10 03:41:17,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:17,077 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:17,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:17,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:17,202 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:17,202 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:41:17,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:17,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:17,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,204 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:17,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:17,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,206 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:41:17,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,206 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:17,207 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:17,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,210 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:17,210 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:17,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,211 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:41:17,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,211 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:17,212 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:17,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,215 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:17,216 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:17,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,216 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,216 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:41:17,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,217 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:17,218 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:17,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:17,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,221 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,221 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:17,222 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:17,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,222 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:41:17,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,223 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,223 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:17,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,223 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:17,224 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:17,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,229 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:17,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,230 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:17,230 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:17,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,231 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,231 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:41:17,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,231 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:17,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,232 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:17,233 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:17,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,240 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:17,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,240 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:17,241 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:17,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,242 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:41:17,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:17,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,243 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:17,245 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:17,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,255 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:17,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,256 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:17,257 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:17,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,258 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:41:17,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,258 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:17,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,259 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:17,259 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:17,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,264 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:17,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,264 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:17,265 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:17,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,267 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:41:17,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,267 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,267 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:17,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,268 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:17,269 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:17,269 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:17,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:17,277 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:17,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:17,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:17,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:17,278 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:17,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:17,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:17,282 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 03:41:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 03:41:17,282 INFO L87 Difference]: Start difference. First operand 428 states and 457 transitions. cyclomatic complexity: 32 Second operand 15 states. [2018-11-10 03:41:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:18,158 INFO L93 Difference]: Finished difference Result 476 states and 502 transitions. [2018-11-10 03:41:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-10 03:41:18,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 476 states and 502 transitions. [2018-11-10 03:41:18,159 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 42 [2018-11-10 03:41:18,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 476 states to 312 states and 329 transitions. [2018-11-10 03:41:18,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2018-11-10 03:41:18,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2018-11-10 03:41:18,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 329 transitions. [2018-11-10 03:41:18,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:41:18,160 INFO L705 BuchiCegarLoop]: Abstraction has 312 states and 329 transitions. [2018-11-10 03:41:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 329 transitions. [2018-11-10 03:41:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 227. [2018-11-10 03:41:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-10 03:41:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 241 transitions. [2018-11-10 03:41:18,161 INFO L728 BuchiCegarLoop]: Abstraction has 227 states and 241 transitions. [2018-11-10 03:41:18,161 INFO L608 BuchiCegarLoop]: Abstraction has 227 states and 241 transitions. [2018-11-10 03:41:18,161 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 03:41:18,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 241 transitions. [2018-11-10 03:41:18,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 03:41:18,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 03:41:18,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 03:41:18,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:18,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:41:18,162 INFO L793 eck$LassoCheckResult]: Stem: 51097#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 51077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 51073#L40 assume mp_add_~a3~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 51074#L42 assume mp_add_~a2~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 51096#L44 assume mp_add_~a1~0 % 256 == 0;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 51099#L40-1 mp_add_~nb~0 := 4; 51148#L50 assume !(mp_add_~b3~0 % 256 == 0); 51087#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 51088#L61-3 assume true; 51153#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 51152#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 51151#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 51101#L65-2 assume !(mp_add_~i~0 % 256 == 1); 51102#L66-1 assume !(mp_add_~i~0 % 256 == 2); 51259#L67-1 assume !(mp_add_~i~0 % 256 == 3); 51258#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 51257#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 51256#L71-2 assume !(mp_add_~i~0 % 256 == 1); 51255#L72-1 assume !(mp_add_~i~0 % 256 == 2); 51254#L73-1 assume !(mp_add_~i~0 % 256 == 3); 51253#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 51252#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 51251#L80-1 assume !(mp_add_~i~0 % 256 == 1); 51250#L81-1 assume !(mp_add_~i~0 % 256 == 2); 51249#L82-1 assume !(mp_add_~i~0 % 256 == 3); 51248#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 51247#L61-3 assume true; 51246#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 51245#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 51243#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 51242#L71 assume !(mp_add_~i~0 % 256 == 0); 51240#L71-2 assume mp_add_~i~0 % 256 == 1;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 51241#L72-1 assume !(mp_add_~i~0 % 256 == 2); 51274#L73-1 assume !(mp_add_~i~0 % 256 == 3); 51273#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 51272#L76-1 assume !(mp_add_~i~0 % 256 == 0); 51271#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 51270#L81-1 assume !(mp_add_~i~0 % 256 == 2); 51269#L82-1 assume !(mp_add_~i~0 % 256 == 3); 51268#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 51267#L61-3 assume true; 51266#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 51265#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 51264#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 51263#L71 assume !(mp_add_~i~0 % 256 == 0); 51262#L71-2 assume !(mp_add_~i~0 % 256 == 1); 51260#L72-1 assume mp_add_~i~0 % 256 == 2;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 51261#L73-1 assume !(mp_add_~i~0 % 256 == 3); 51285#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 51284#L76-1 assume !(mp_add_~i~0 % 256 == 0); 51283#L80-1 assume !(mp_add_~i~0 % 256 == 1); 51282#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 51281#L82-1 assume !(mp_add_~i~0 % 256 == 3); 51280#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 51279#L61-3 assume true; 51089#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 51090#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 51082#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 51094#L71 assume !(mp_add_~i~0 % 256 == 0); 51063#L71-2 assume !(mp_add_~i~0 % 256 == 1); 51064#L72-1 assume !(mp_add_~i~0 % 256 == 2); 51275#L73-1 assume mp_add_~i~0 % 256 == 3;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 51276#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 51078#L76-1 assume !(mp_add_~i~0 % 256 == 0); 51061#L80-1 assume !(mp_add_~i~0 % 256 == 1); 51062#L81-1 assume !(mp_add_~i~0 % 256 == 2); 51085#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 51066#L83-1 [2018-11-10 03:41:18,162 INFO L795 eck$LassoCheckResult]: Loop: 51066#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 51083#L61-3 assume true; 51084#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || mp_add_~carry~0 % 65536 != 0);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 51278#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 51277#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 51067#L71 assume !(mp_add_~i~0 % 256 == 0); 51068#L71-2 assume !(mp_add_~i~0 % 256 == 1); 51091#L72-1 assume !(mp_add_~i~0 % 256 == 2); 51071#L73-1 assume !(mp_add_~i~0 % 256 == 3); 51072#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 51086#L76-1 assume !(mp_add_~i~0 % 256 == 0); 51287#L80-1 assume !(mp_add_~i~0 % 256 == 1); 51286#L81-1 assume !(mp_add_~i~0 % 256 == 2); 51065#L82-1 assume !(mp_add_~i~0 % 256 == 3); 51066#L83-1 [2018-11-10 03:41:18,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:18,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1199200319, now seen corresponding path program 1 times [2018-11-10 03:41:18,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:18,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:18,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:18,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 03:41:18,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:18,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:18,184 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 1 times [2018-11-10 03:41:18,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:18,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:18,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:18,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:18,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 03:41:18,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:41:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1043021157, now seen corresponding path program 2 times [2018-11-10 03:41:18,191 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:41:18,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:41:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:18,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:41:18,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:41:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:41:18,451 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 57 proven. 37 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 03:41:18,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:41:18,451 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 03:41:18,458 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 03:41:18,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 03:41:18,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 03:41:18,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:41:18,536 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-10 03:41:18,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:41:18,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-10 03:41:18,591 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:18,591 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:18,591 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:18,591 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:18,591 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 03:41:18,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:18,592 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:18,592 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:18,592 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2018-11-10 03:41:18,592 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:18,592 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:18,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:18,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:18,723 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:18,723 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:18,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:41:18,726 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:41:18,730 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 03:41:18,730 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:18,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 03:41:18,746 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb10ffe2-6b80-4e70-946f-ee6b2c10eb24/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:18,790 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 03:41:18,790 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 03:41:19,825 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 03:41:19,827 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 03:41:19,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 03:41:19,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 03:41:19,827 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 03:41:19,827 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 03:41:19,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 03:41:19,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 03:41:19,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 03:41:19,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2018-11-10 03:41:19,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 03:41:19,827 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 03:41:19,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:19,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 03:41:19,962 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 03:41:19,963 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 03:41:19,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,963 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:19,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:19,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,964 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,964 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 03:41:19,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 03:41:19,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,965 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 03:41:19,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:19,966 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:19,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,966 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,967 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:19,967 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:19,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,968 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,968 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 03:41:19,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,969 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:19,969 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:19,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:19,970 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:19,970 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,972 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,972 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 03:41:19,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,972 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:19,973 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:19,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 03:41:19,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,973 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:19,974 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:19,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,976 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 03:41:19,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:19,976 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:19,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,977 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:19,977 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:19,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:19,978 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:19,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,979 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 03:41:19,979 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 03:41:19,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,981 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,982 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 03:41:19,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,982 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:19,982 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:19,982 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,982 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:19,983 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:19,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:19,984 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 03:41:19,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,984 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:19,985 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:19,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,988 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,988 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 03:41:19,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:19,989 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:19,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,989 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:19,990 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:19,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,990 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:19,991 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:19,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,991 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 03:41:19,992 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 03:41:19,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:19,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:19,997 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 03:41:19,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:19,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:19,998 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:19,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:19,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:19,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:19,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:19,998 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:19,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:20,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:20,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:20,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:20,000 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 03:41:20,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:20,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:20,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:20,001 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 03:41:20,001 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 03:41:20,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:20,005 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:20,005 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 03:41:20,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:20,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:20,005 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:20,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:20,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:20,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:20,006 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:20,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:20,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:20,008 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:20,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 03:41:20,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 03:41:20,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 03:41:20,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 03:41:20,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 03:41:20,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 03:41:20,009 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 03:41:20,009 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 03:41:20,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 03:41:20,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 03:41:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 03:41:20,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-10 03:41:20,014 INFO L87 Difference]: Start difference. First operand 227 states and 241 transitions. cyclomatic complexity: 15 Second operand 16 states. [2018-11-10 03:41:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:41:20,380 INFO L93 Difference]: Finished difference Result 221 states and 234 transitions. [2018-11-10 03:41:20,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:41:20,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 221 states and 234 transitions. [2018-11-10 03:41:20,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:41:20,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 221 states to 0 states and 0 transitions. [2018-11-10 03:41:20,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 03:41:20,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 03:41:20,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 03:41:20,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 03:41:20,381 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:41:20,381 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:41:20,381 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:41:20,381 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 03:41:20,381 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:41:20,381 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 03:41:20,381 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 03:41:20,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 03:41:20 BoogieIcfgContainer [2018-11-10 03:41:20,385 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 03:41:20,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:41:20,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:41:20,386 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:41:20,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:37:56" (3/4) ... [2018-11-10 03:41:20,389 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 03:41:20,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:41:20,389 INFO L168 Benchmark]: Toolchain (without parser) took 204663.69 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 310.4 MB). Free memory was 960.7 MB in the beginning and 996.7 MB in the end (delta: -36.0 MB). Peak memory consumption was 274.4 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:20,390 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:41:20,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 946.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:20,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.67 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:41:20,390 INFO L168 Benchmark]: Boogie Preprocessor took 52.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -227.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:20,390 INFO L168 Benchmark]: RCFGBuilder took 252.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:20,391 INFO L168 Benchmark]: BuchiAutomizer took 204163.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.7 MB). Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 152.9 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. [2018-11-10 03:41:20,391 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.3 GB. Free memory is still 996.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:41:20,393 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.7 MB in the beginning and 946.2 MB in the end (delta: 14.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.67 ms. Allocated memory is still 1.0 GB. Free memory is still 946.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 946.2 MB in the beginning and 1.2 GB in the end (delta: -227.5 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 204163.21 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 134.7 MB). Free memory was 1.1 GB in the beginning and 996.7 MB in the end (delta: 152.9 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.3 GB. Free memory is still 996.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 22 terminating modules (22 trivial, 0 deterministic, 0 nondeterministic). 22 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 204.1s and 23 iterations. TraceHistogramMax:6. Analysis of lassos took 105.8s. Construction of modules took 63.8s. Büchi inclusion checks took 33.6s. Highest rank in rank-based complementation 0. Minimization of det autom 22. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 10333 StatesRemovedByMinimization, 21 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 2720 states and ocurred in iteration 12. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1236 SDtfs, 5995 SDslu, 3456 SDs, 0 SdLazy, 9941 SolverSat, 933 SolverUnsat, 71 SolverUnknown, 0 SolverNotchecked, 63.8s Time LassoAnalysisResults: nont0 unkn0 SFLI10 SFLT0 conc4 concLT0 SILN0 SILU4 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf98 lsp84 ukn100 mio100 lsp100 div476 bol100 ite100 ukn100 eq145 hnf46 smp75 dnf100 smp100 tf103 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...