./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1_true-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_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 6e973c5cecb5d30af2cf4ea74d1b0b1563334ffe ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:34:28,478 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:34:28,479 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:34:28,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:34:28,487 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:34:28,488 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:34:28,489 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:34:28,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:34:28,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:34:28,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:34:28,492 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:34:28,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:34:28,493 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:34:28,494 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:34:28,495 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:34:28,496 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:34:28,496 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:34:28,497 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:34:28,499 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:34:28,500 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:34:28,501 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:34:28,502 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:34:28,503 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:34:28,503 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:34:28,504 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:34:28,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:34:28,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:34:28,506 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:34:28,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:34:28,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:34:28,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:34:28,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:34:28,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:34:28,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:34:28,509 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:34:28,509 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:34:28,510 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 11:34:28,521 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:34:28,521 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:34:28,522 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 11:34:28,522 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 11:34:28,522 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 11:34:28,522 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 11:34:28,523 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 11:34:28,523 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 11:34:28,523 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 11:34:28,523 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 11:34:28,523 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 11:34:28,523 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 11:34:28,524 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 11:34:28,525 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:34:28,525 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:34:28,525 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 11:34:28,525 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 11:34:28,525 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:34:28,525 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:34:28,525 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 11:34:28,525 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:34:28,526 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 11:34:28,526 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 11:34:28,526 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 11:34:28,526 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_f6c7578e-0c91-4671-b3e6-c694af260379/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 -> 6e973c5cecb5d30af2cf4ea74d1b0b1563334ffe [2018-11-10 11:34:28,548 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:34:28,558 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:34:28,560 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:34:28,561 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:34:28,561 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:34:28,562 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 11:34:28,601 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/data/797ba698b/35b05a5c44e2437f99c45e814d69c464/FLAGb6942332a [2018-11-10 11:34:28,919 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:34:28,920 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/sv-benchmarks/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 11:34:28,925 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/data/797ba698b/35b05a5c44e2437f99c45e814d69c464/FLAGb6942332a [2018-11-10 11:34:28,935 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/data/797ba698b/35b05a5c44e2437f99c45e814d69c464 [2018-11-10 11:34:28,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:34:28,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:34:28,939 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:34:28,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:34:28,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:34:28,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:34:28" (1/1) ... [2018-11-10 11:34:28,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d3e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:28, skipping insertion in model container [2018-11-10 11:34:28,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:34:28" (1/1) ... [2018-11-10 11:34:28,950 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:34:28,969 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:34:29,106 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:34:29,109 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:34:29,129 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:34:29,138 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:34:29,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29 WrapperNode [2018-11-10 11:34:29,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:34:29,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:34:29,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:34:29,140 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:34:29,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,151 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:34:29,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:34:29,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:34:29,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:34:29,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... [2018-11-10 11:34:29,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:34:29,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:34:29,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:34:29,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:34:29,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:29,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:34:29,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:34:29,488 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:34:29,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:34:29 BoogieIcfgContainer [2018-11-10 11:34:29,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:34:29,489 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 11:34:29,489 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 11:34:29,493 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 11:34:29,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:34:29,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:34:28" (1/3) ... [2018-11-10 11:34:29,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c37fb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:34:29, skipping insertion in model container [2018-11-10 11:34:29,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:34:29,495 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:34:29" (2/3) ... [2018-11-10 11:34:29,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c37fb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:34:29, skipping insertion in model container [2018-11-10 11:34:29,495 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 11:34:29,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:34:29" (3/3) ... [2018-11-10 11:34:29,497 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2018-11-10 11:34:29,550 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 11:34:29,551 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 11:34:29,551 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 11:34:29,551 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 11:34:29,551 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:34:29,551 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:34:29,552 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 11:34:29,552 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:34:29,552 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 11:34:29,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 11:34:29,584 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 11:34:29,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:29,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:29,590 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 11:34:29,590 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:29,590 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 11:34:29,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-10 11:34:29,593 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-10 11:34:29,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:29,593 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:29,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-10 11:34:29,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:29,599 INFO L793 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 32#L50true assume !(mp_add_~b3~0 % 256 == 0); 29#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 24#L61-3true [2018-11-10 11:34:29,600 INFO L795 eck$LassoCheckResult]: Loop: 24#L61-3true assume true; 30#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); 27#L70true assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15#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; 25#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; 24#L61-3true [2018-11-10 11:34:29,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:29,604 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2018-11-10 11:34:29,605 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:29,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:29,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:29,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:29,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:29,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash -486457291, now seen corresponding path program 1 times [2018-11-10 11:34:29,713 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:29,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:29,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:29,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:29,762 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 11:34:29,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:29,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:34:29,767 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:34:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:34:29,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:34:29,780 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-10 11:34:29,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:29,934 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-11-10 11:34:29,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:34:29,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2018-11-10 11:34:29,938 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-10 11:34:29,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 90 transitions. [2018-11-10 11:34:29,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 11:34:29,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-10 11:34:29,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 90 transitions. [2018-11-10 11:34:29,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:29,944 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-10 11:34:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 90 transitions. [2018-11-10 11:34:29,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-10 11:34:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 11:34:29,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-11-10 11:34:29,971 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-10 11:34:29,971 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-10 11:34:29,971 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 11:34:29,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 88 transitions. [2018-11-10 11:34:29,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:34:29,972 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:29,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:29,973 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:29,973 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:29,974 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~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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 11:34:29,974 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 > 255;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 11:34:29,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:29,974 INFO L82 PathProgramCache]: Analyzing trace with hash -685617854, now seen corresponding path program 1 times [2018-11-10 11:34:29,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:29,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:29,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:30,068 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 11:34:30,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:30,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:34:30,069 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:34:30,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:30,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 1 times [2018-11-10 11:34:30,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:30,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:30,147 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 11:34:30,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:30,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:34:30,148 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:34:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:34:30,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:34:30,149 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-10 11:34:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:30,412 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2018-11-10 11:34:30,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:34:30,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 226 transitions. [2018-11-10 11:34:30,416 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-10 11:34:30,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 226 transitions. [2018-11-10 11:34:30,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-11-10 11:34:30,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-11-10 11:34:30,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 226 transitions. [2018-11-10 11:34:30,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:30,419 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 226 transitions. [2018-11-10 11:34:30,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 226 transitions. [2018-11-10 11:34:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2018-11-10 11:34:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 11:34:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2018-11-10 11:34:30,426 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-10 11:34:30,426 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-10 11:34:30,426 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 11:34:30,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2018-11-10 11:34:30,427 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:34:30,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:30,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:30,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:30,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:30,428 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~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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 11:34:30,429 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 > 255;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 11:34:30,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash 959922624, now seen corresponding path program 1 times [2018-11-10 11:34:30,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:30,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:30,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:30,458 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 11:34:30,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:30,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:34:30,458 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:34:30,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 2 times [2018-11-10 11:34:30,459 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:30,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:30,532 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 11:34:30,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:30,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:34:30,533 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:34:30,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:34:30,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:34:30,534 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. cyclomatic complexity: 37 Second operand 3 states. [2018-11-10 11:34:30,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:30,539 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-10 11:34:30,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:34:30,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 97 transitions. [2018-11-10 11:34:30,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:34:30,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 97 transitions. [2018-11-10 11:34:30,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2018-11-10 11:34:30,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2018-11-10 11:34:30,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 97 transitions. [2018-11-10 11:34:30,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:30,542 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 97 transitions. [2018-11-10 11:34:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 97 transitions. [2018-11-10 11:34:30,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-10 11:34:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-10 11:34:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2018-11-10 11:34:30,546 INFO L728 BuchiCegarLoop]: Abstraction has 70 states and 97 transitions. [2018-11-10 11:34:30,546 INFO L608 BuchiCegarLoop]: Abstraction has 70 states and 97 transitions. [2018-11-10 11:34:30,546 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 11:34:30,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 97 transitions. [2018-11-10 11:34:30,547 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 11:34:30,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:30,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:30,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:30,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:30,548 INFO L793 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 521#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 518#L40 assume !(mp_add_~a3~0 % 256 == 0); 515#L40-1 mp_add_~nb~0 := 4; 516#L50 assume !(mp_add_~b3~0 % 256 == 0); 526#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 539#L61-3 assume true; 576#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; 575#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 574#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 573#L65-2 assume !(mp_add_~i~0 % 256 == 1); 572#L66-1 assume !(mp_add_~i~0 % 256 == 2); 569#L67-1 assume !(mp_add_~i~0 % 256 == 3); 563#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 558#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 524#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 507#L80-1 assume !(mp_add_~i~0 % 256 == 1); 508#L81-1 assume !(mp_add_~i~0 % 256 == 2); 513#L82-1 assume !(mp_add_~i~0 % 256 == 3); 514#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 535#L61-3 assume true; 536#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; 540#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 527#L65 [2018-11-10 11:34:30,548 INFO L795 eck$LassoCheckResult]: Loop: 527#L65 assume !(mp_add_~i~0 % 256 == 0); 528#L65-2 assume !(mp_add_~i~0 % 256 == 1); 571#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; 566#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; 560#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 557#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 556#L76-1 assume !(mp_add_~i~0 % 256 == 0); 554#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 552#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 550#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 549#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 548#L61-3 assume true; 546#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; 547#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 527#L65 [2018-11-10 11:34:30,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:30,548 INFO L82 PathProgramCache]: Analyzing trace with hash 627082604, now seen corresponding path program 1 times [2018-11-10 11:34:30,548 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:30,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:34:30,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:30,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:34:30,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:30,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:34:30,646 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:34:30,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:30,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2033069955, now seen corresponding path program 1 times [2018-11-10 11:34:30,647 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:30,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:30,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:30,672 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 11:34:30,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:30,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:34:30,673 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:34:30,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:34:30,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:34:30,673 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. cyclomatic complexity: 29 Second operand 3 states. [2018-11-10 11:34:30,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:30,756 INFO L93 Difference]: Finished difference Result 86 states and 123 transitions. [2018-11-10 11:34:30,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:34:30,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 123 transitions. [2018-11-10 11:34:30,758 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2018-11-10 11:34:30,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 123 transitions. [2018-11-10 11:34:30,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-10 11:34:30,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2018-11-10 11:34:30,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 123 transitions. [2018-11-10 11:34:30,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:30,760 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 123 transitions. [2018-11-10 11:34:30,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 123 transitions. [2018-11-10 11:34:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2018-11-10 11:34:30,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 11:34:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2018-11-10 11:34:30,767 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 119 transitions. [2018-11-10 11:34:30,767 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 119 transitions. [2018-11-10 11:34:30,767 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 11:34:30,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 119 transitions. [2018-11-10 11:34:30,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-10 11:34:30,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:30,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:30,769 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:30,769 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:30,769 INFO L793 eck$LassoCheckResult]: Stem: 710#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 686#L40 assume !(mp_add_~a3~0 % 256 == 0); 681#L40-1 mp_add_~nb~0 := 4; 682#L50 assume !(mp_add_~b3~0 % 256 == 0); 692#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 701#L61-3 assume true; 702#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; 709#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 693#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 694#L65-2 assume !(mp_add_~i~0 % 256 == 1); 748#L66-1 assume !(mp_add_~i~0 % 256 == 2); 746#L67-1 assume !(mp_add_~i~0 % 256 == 3); 743#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 741#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 740#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 739#L80-1 assume !(mp_add_~i~0 % 256 == 1); 738#L81-1 assume !(mp_add_~i~0 % 256 == 2); 679#L82-1 assume !(mp_add_~i~0 % 256 == 3); 680#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 707#L61-3 assume true; 705#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; 706#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 731#L65 [2018-11-10 11:34:30,769 INFO L795 eck$LassoCheckResult]: Loop: 731#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 688#L65-2 assume !(mp_add_~i~0 % 256 == 1); 689#L66-1 assume !(mp_add_~i~0 % 256 == 2); 697#L67-1 assume !(mp_add_~i~0 % 256 == 3); 698#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 685#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 690#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 673#L80-1 assume !(mp_add_~i~0 % 256 == 1); 674#L81-1 assume !(mp_add_~i~0 % 256 == 2); 703#L82-1 assume !(mp_add_~i~0 % 256 == 3); 715#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 714#L61-3 assume true; 712#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; 713#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 731#L65 [2018-11-10 11:34:30,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:30,769 INFO L82 PathProgramCache]: Analyzing trace with hash 627082604, now seen corresponding path program 2 times [2018-11-10 11:34:30,770 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:30,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:30,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:34:30,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:30,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:34:30,871 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:34:30,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1714230653, now seen corresponding path program 3 times [2018-11-10 11:34:30,871 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:34:30,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:30,954 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:30,955 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:30,955 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:30,956 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:30,956 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:34:30,956 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:30,956 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:30,956 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:30,956 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Loop [2018-11-10 11:34:30,956 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:30,957 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:30,974 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 11:34:30,978 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 11:34:30,986 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 11:34:30,993 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 11:34:31,154 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:31,154 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:31,159 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:31,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:31,165 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:31,165 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r0~0=0} Honda state: {ULTIMATE.start_mp_add_~r0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:31,195 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:31,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:31,201 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:31,201 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:31,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:31,223 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:31,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:34:31,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:33,406 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:34:33,408 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:33,408 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:33,408 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:33,408 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:33,408 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:34:33,408 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:33,409 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:33,409 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:33,409 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration5_Loop [2018-11-10 11:34:33,409 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:33,409 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:33,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:33,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:33,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:33,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:33,572 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:33,575 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:34:33,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:33,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:33,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:33,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:33,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:33,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:33,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:33,592 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:33,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,610 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:34:33,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 11:34:33,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,614 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,616 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,616 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,622 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,624 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,629 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,630 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,637 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:34:33,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,641 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,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 11:34:33,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,646 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,656 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,663 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:34:33,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,664 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,664 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,666 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,666 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,672 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,673 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:33,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,681 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,682 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,687 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:34:33,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,688 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,689 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,689 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,691 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,691 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,692 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,694 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,694 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,696 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,706 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,707 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,707 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:33,709 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:33,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,716 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,716 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:34:33,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,717 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,717 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:33,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,718 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,719 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,721 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:33,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,721 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,722 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,728 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:33,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,729 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,743 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:33,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,746 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,757 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:34:33,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 11:34:33,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,757 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,758 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,762 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,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 11:34:33,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,764 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,764 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,765 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,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 11:34:33,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,771 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,775 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,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 11:34:33,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,793 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,793 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:33,796 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:33,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,806 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:34:33,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 11:34:33,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,807 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,808 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,808 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,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 11:34:33,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,810 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,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 11:34:33,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,814 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,815 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,822 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:33,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,823 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:33,824 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:33,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,830 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:34:33,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 11:34:33,831 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,831 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,832 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:33,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:33,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,837 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,837 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:33,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:33,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,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 11:34:33,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,845 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,845 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:33,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:33,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:33,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:33,864 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:33,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:33,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:33,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:33,864 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:33,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:33,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:33,881 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:33,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:34:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:34:33,882 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. cyclomatic complexity: 39 Second operand 6 states. [2018-11-10 11:34:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:34,111 INFO L93 Difference]: Finished difference Result 196 states and 288 transitions. [2018-11-10 11:34:34,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:34:34,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 288 transitions. [2018-11-10 11:34:34,113 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 106 [2018-11-10 11:34:34,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 196 states and 288 transitions. [2018-11-10 11:34:34,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2018-11-10 11:34:34,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2018-11-10 11:34:34,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 288 transitions. [2018-11-10 11:34:34,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:34,116 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 288 transitions. [2018-11-10 11:34:34,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 288 transitions. [2018-11-10 11:34:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 116. [2018-11-10 11:34:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-10 11:34:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 159 transitions. [2018-11-10 11:34:34,124 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 159 transitions. [2018-11-10 11:34:34,124 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 159 transitions. [2018-11-10 11:34:34,124 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 11:34:34,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 159 transitions. [2018-11-10 11:34:34,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-10 11:34:34,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:34,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:34,126 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:34,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:34,128 INFO L793 eck$LassoCheckResult]: Stem: 1005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 978#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 975#L40 assume !(mp_add_~a3~0 % 256 == 0); 972#L40-1 mp_add_~nb~0 := 4; 973#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1004#L52 assume !(mp_add_~b2~0 % 256 == 0); 985#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1033#L61-3 assume true; 1032#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; 1031#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1030#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1029#L65-2 assume !(mp_add_~i~0 % 256 == 1); 1028#L66-1 assume !(mp_add_~i~0 % 256 == 2); 1027#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1024#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1026#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1063#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 1062#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1061#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1060#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1059#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1058#L61-3 assume true; 1057#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; 1006#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1007#L65 [2018-11-10 11:34:34,128 INFO L795 eck$LassoCheckResult]: Loop: 1007#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1056#L65-2 assume !(mp_add_~i~0 % 256 == 1); 1070#L66-1 assume !(mp_add_~i~0 % 256 == 2); 1069#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1068#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 999#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 982#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 983#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1019#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1017#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1015#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1014#L61-3 assume true; 1012#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; 1013#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1007#L65 [2018-11-10 11:34:34,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:34,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1746132101, now seen corresponding path program 1 times [2018-11-10 11:34:34,129 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:34,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:34,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:34:34,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:34,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:34:34,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:34,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 11:34:34,203 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:34:34,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:34,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1714230653, now seen corresponding path program 4 times [2018-11-10 11:34:34,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:34,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:34,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:34,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:34,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:34,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:34,258 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:34,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:34,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:34,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:34,258 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:34:34,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:34,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:34,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:34,259 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-10 11:34:34,259 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:34,259 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:34,260 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 11:34:34,268 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 11:34:34,272 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 11:34:34,274 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 11:34:34,421 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:34,422 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:34,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:34,431 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:34,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:34:34,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:46,511 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 11:34:46,514 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:46,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:46,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:46,514 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:46,514 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:34:46,514 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:46,514 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:46,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:46,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-10 11:34:46,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:46,514 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:46,515 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 11:34:46,525 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 11:34:46,527 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 11:34:46,531 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 11:34:46,673 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:46,674 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:34:46,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:46,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:46,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:46,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:46,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:46,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:46,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:46,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:46,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,689 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:34:46,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,692 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,692 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,697 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,697 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,699 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,700 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,704 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,704 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,705 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:34:46,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 11:34:46,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,706 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,708 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,713 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,716 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,717 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,722 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,723 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:34:46,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,724 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,725 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,732 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,732 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,733 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,734 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:46,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,740 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,740 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,741 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:34:46,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 11:34:46,741 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,742 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,742 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,743 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,750 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,750 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,751 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,752 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,752 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,752 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,753 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,759 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,759 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:46,760 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:46,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,760 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:34:46,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 11:34:46,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,761 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:46,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,762 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,763 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,776 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:46,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,778 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:46,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,780 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,788 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:46,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,788 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,789 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,790 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:34:46,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 11:34:46,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,791 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,804 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,805 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,805 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,807 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,808 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,810 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,819 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,819 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:46,820 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:46,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,821 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:34:46,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 11:34:46,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,821 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,834 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,834 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,835 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,837 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,837 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,846 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:46,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:46,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:46,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,848 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:34:46,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,849 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,849 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:46,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:46,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,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 11:34:46,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,861 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,862 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:46,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:46,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,865 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,866 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:46,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:46,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:46,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:46,876 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:46,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:46,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:46,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:46,877 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:46,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:46,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:46,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:46,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:34:46,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:34:46,880 INFO L87 Difference]: Start difference. First operand 116 states and 159 transitions. cyclomatic complexity: 45 Second operand 7 states. [2018-11-10 11:34:47,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:47,924 INFO L93 Difference]: Finished difference Result 323 states and 456 transitions. [2018-11-10 11:34:47,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 11:34:47,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 456 transitions. [2018-11-10 11:34:47,926 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 229 [2018-11-10 11:34:47,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 323 states and 456 transitions. [2018-11-10 11:34:47,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 323 [2018-11-10 11:34:47,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 323 [2018-11-10 11:34:47,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 323 states and 456 transitions. [2018-11-10 11:34:47,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:47,929 INFO L705 BuchiCegarLoop]: Abstraction has 323 states and 456 transitions. [2018-11-10 11:34:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states and 456 transitions. [2018-11-10 11:34:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 260. [2018-11-10 11:34:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-10 11:34:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 364 transitions. [2018-11-10 11:34:47,941 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 364 transitions. [2018-11-10 11:34:47,941 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 364 transitions. [2018-11-10 11:34:47,941 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 11:34:47,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 364 transitions. [2018-11-10 11:34:47,942 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 187 [2018-11-10 11:34:47,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:47,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:47,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:47,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:47,944 INFO L793 eck$LassoCheckResult]: Stem: 1462#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1435#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 1432#L40 assume !(mp_add_~a3~0 % 256 == 0); 1429#L40-1 mp_add_~nb~0 := 4; 1430#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1458#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1439#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1440#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1453#L61-3 assume true; 1454#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; 1455#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1441#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1436#L65-2 assume !(mp_add_~i~0 % 256 == 1); 1437#L66-1 assume !(mp_add_~i~0 % 256 == 2); 1673#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1672#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1669#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1438#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 1421#L80-1 assume !(mp_add_~i~0 % 256 == 1); 1422#L81-1 assume !(mp_add_~i~0 % 256 == 2); 1427#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1428#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1449#L61-3 assume true; 1450#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; 1668#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1659#L65 [2018-11-10 11:34:47,944 INFO L795 eck$LassoCheckResult]: Loop: 1659#L65 assume !(mp_add_~i~0 % 256 == 0); 1665#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; 1666#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; 1663#L67-1 assume !(mp_add_~i~0 % 256 == 3); 1674#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1670#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1650#L76-1 assume !(mp_add_~i~0 % 256 == 0); 1648#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 1621#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 1618#L82-1 assume !(mp_add_~i~0 % 256 == 3); 1567#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 1469#L61-3 assume true; 1470#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; 1564#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1659#L65 [2018-11-10 11:34:47,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:47,944 INFO L82 PathProgramCache]: Analyzing trace with hash -531929919, now seen corresponding path program 1 times [2018-11-10 11:34:47,944 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:47,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:47,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:34:47,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:34:48,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:48,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 11:34:48,855 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:34:48,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:48,855 INFO L82 PathProgramCache]: Analyzing trace with hash -743352321, now seen corresponding path program 1 times [2018-11-10 11:34:48,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:48,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:48,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:48,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:48,867 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 11:34:48,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:48,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:34:48,867 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:34:48,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:34:48,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:34:48,868 INFO L87 Difference]: Start difference. First operand 260 states and 364 transitions. cyclomatic complexity: 110 Second operand 3 states. [2018-11-10 11:34:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:48,942 INFO L93 Difference]: Finished difference Result 294 states and 407 transitions. [2018-11-10 11:34:48,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:34:48,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 407 transitions. [2018-11-10 11:34:48,944 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 221 [2018-11-10 11:34:48,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 407 transitions. [2018-11-10 11:34:48,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2018-11-10 11:34:48,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2018-11-10 11:34:48,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 407 transitions. [2018-11-10 11:34:48,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:48,947 INFO L705 BuchiCegarLoop]: Abstraction has 294 states and 407 transitions. [2018-11-10 11:34:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 407 transitions. [2018-11-10 11:34:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 270. [2018-11-10 11:34:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-10 11:34:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2018-11-10 11:34:48,953 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 379 transitions. [2018-11-10 11:34:48,953 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 379 transitions. [2018-11-10 11:34:48,953 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 11:34:48,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 379 transitions. [2018-11-10 11:34:48,955 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 197 [2018-11-10 11:34:48,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:48,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:48,955 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:48,955 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:48,956 INFO L793 eck$LassoCheckResult]: Stem: 2028#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2002#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 1999#L40 assume !(mp_add_~a3~0 % 256 == 0); 1996#L40-1 mp_add_~nb~0 := 4; 1997#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 2025#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 2006#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 2007#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2148#L61-3 assume true; 2147#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; 2146#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2145#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2144#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2143#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2141#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2138#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2135#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2133#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 2132#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2131#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2129#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2127#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2125#L61-3 assume true; 2123#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; 2121#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2111#L65 [2018-11-10 11:34:48,956 INFO L795 eck$LassoCheckResult]: Loop: 2111#L65 assume !(mp_add_~i~0 % 256 == 0); 2116#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2113#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; 2114#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2203#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2201#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2199#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2197#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2195#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 2186#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2036#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2035#L61-3 assume true; 2033#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; 2034#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2111#L65 [2018-11-10 11:34:48,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:48,956 INFO L82 PathProgramCache]: Analyzing trace with hash -531929919, now seen corresponding path program 2 times [2018-11-10 11:34:48,956 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:48,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:48,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:48,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:48,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:34:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:34:49,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:34:49,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 11:34:49,040 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:34:49,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash 444849027, now seen corresponding path program 1 times [2018-11-10 11:34:49,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:49,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:49,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:49,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:34:49,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:49,096 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:49,096 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:49,096 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:49,096 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:49,096 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:34:49,096 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:49,096 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:49,097 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:49,097 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-10 11:34:49,097 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:49,097 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:49,098 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 11:34:49,107 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 11:34:49,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 11:34:49,114 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 11:34:49,280 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:49,280 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:49,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:49,287 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:49,329 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:34:49,329 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:50,096 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:34:50,097 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:50,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:50,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:50,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:50,098 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:34:50,098 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:50,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:50,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:50,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-10 11:34:50,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:50,098 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:50,099 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 11:34:50,105 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 11:34:50,108 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 11:34:50,110 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 11:34:50,228 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:50,228 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:34:50,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 11:34:50,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:50,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:50,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,232 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:50,233 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:50,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:50,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:50,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:50,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:50,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,246 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:34:50,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,247 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,247 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,250 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,251 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,252 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,255 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,255 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,257 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,257 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,258 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:34:50,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 11:34:50,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,259 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,259 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,264 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,265 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,269 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,269 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,270 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,271 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,271 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,272 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:34:50,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,273 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,274 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,279 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,280 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,285 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,285 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:50,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,287 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,287 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,288 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:34:50,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,288 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,289 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,290 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,298 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,298 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,299 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,299 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,306 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,306 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,307 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,307 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,308 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,308 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,309 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:50,309 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:50,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,310 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:34:50,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,310 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,311 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:50,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,311 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,313 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,324 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,324 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:50,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,325 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,326 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,333 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:50,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,334 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,334 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,336 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:50,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,337 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,337 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,338 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,338 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:34:50,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,339 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,339 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,340 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,342 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,353 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,354 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,354 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,354 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,356 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,369 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,370 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,371 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,372 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,373 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:50,373 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:50,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,374 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:34:50,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,375 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,375 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,383 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,383 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,384 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,385 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,390 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,390 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,391 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,393 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:50,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:50,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:50,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,395 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:34:50,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,396 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:50,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:50,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,413 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,414 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:50,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:50,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:50,425 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,425 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,426 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:50,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:50,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,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 11:34:50,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:50,429 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:50,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:50,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:50,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:50,430 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:50,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:50,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:50,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:50,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 11:34:50,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:34:50,433 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. cyclomatic complexity: 114 Second operand 9 states. [2018-11-10 11:34:50,923 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-11-10 11:34:51,827 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-11-10 11:34:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:34:53,297 INFO L93 Difference]: Finished difference Result 401 states and 536 transitions. [2018-11-10 11:34:53,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 11:34:53,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 401 states and 536 transitions. [2018-11-10 11:34:53,300 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 306 [2018-11-10 11:34:53,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 401 states to 401 states and 536 transitions. [2018-11-10 11:34:53,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2018-11-10 11:34:53,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2018-11-10 11:34:53,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 401 states and 536 transitions. [2018-11-10 11:34:53,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:34:53,304 INFO L705 BuchiCegarLoop]: Abstraction has 401 states and 536 transitions. [2018-11-10 11:34:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states and 536 transitions. [2018-11-10 11:34:53,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 344. [2018-11-10 11:34:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-11-10 11:34:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 465 transitions. [2018-11-10 11:34:53,312 INFO L728 BuchiCegarLoop]: Abstraction has 344 states and 465 transitions. [2018-11-10 11:34:53,312 INFO L608 BuchiCegarLoop]: Abstraction has 344 states and 465 transitions. [2018-11-10 11:34:53,312 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 11:34:53,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 465 transitions. [2018-11-10 11:34:53,314 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 249 [2018-11-10 11:34:53,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:34:53,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:34:53,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:53,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:34:53,315 INFO L793 eck$LassoCheckResult]: Stem: 2729#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2700#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 2697#L40 assume !(mp_add_~a3~0 % 256 == 0); 2693#L40-1 mp_add_~nb~0 := 4; 2694#L50 assume !(mp_add_~b3~0 % 256 == 0); 2724#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2942#L61-3 assume true; 2941#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; 2940#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2939#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2938#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2937#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2936#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2935#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2934#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 2933#L71-2 assume !(mp_add_~i~0 % 256 == 1); 2932#L72-1 assume !(mp_add_~i~0 % 256 == 2); 2931#L73-1 assume !(mp_add_~i~0 % 256 == 3); 2930#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2929#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 2928#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2927#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2925#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2923#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2717#L61-3 assume true; 2718#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; 2912#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2911#L65 [2018-11-10 11:34:53,315 INFO L795 eck$LassoCheckResult]: Loop: 2911#L65 assume !(mp_add_~i~0 % 256 == 0); 2909#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; 2896#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2908#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2907#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2906#L71 assume !(mp_add_~i~0 % 256 == 0); 2905#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; 2901#L72-1 assume !(mp_add_~i~0 % 256 == 2); 2902#L73-1 assume !(mp_add_~i~0 % 256 == 3); 2959#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2881#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2849#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 2850#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2926#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2924#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2922#L61-3 assume true; 2916#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; 2917#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2911#L65 [2018-11-10 11:34:53,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:53,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 1 times [2018-11-10 11:34:53,316 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:53,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:53,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash -782991477, now seen corresponding path program 1 times [2018-11-10 11:34:53,340 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:53,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:34:53,354 INFO L82 PathProgramCache]: Analyzing trace with hash -178527998, now seen corresponding path program 1 times [2018-11-10 11:34:53,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:34:53,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:34:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:34:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:34:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:34:53,495 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2018-11-10 11:34:53,514 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:53,514 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:53,514 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:53,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:53,515 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:34:53,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:53,515 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:53,515 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:53,515 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Loop [2018-11-10 11:34:53,515 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:53,515 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:53,516 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 11:34:53,522 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 11:34:53,530 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 11:34:53,533 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 11:34:53,689 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-10 11:34:53,803 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:53,803 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:53,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:53,807 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:53,810 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:53,810 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r1~0=0} Honda state: {ULTIMATE.start_mp_add_~r1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:53,828 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:53,828 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:53,885 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:53,885 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~b1~0=33023, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=51200} Honda state: {ULTIMATE.start_mp_add_~b1~0=33023, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=51200} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:53,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:53,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:53,905 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:53,906 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:53,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:53,924 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:53,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:34:53,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:55,118 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:34:55,120 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:55,120 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:55,120 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:55,120 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:55,120 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:34:55,121 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:55,121 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:55,121 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:55,121 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Loop [2018-11-10 11:34:55,121 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:55,121 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:55,122 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 11:34:55,127 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 11:34:55,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 11:34:55,130 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 11:34:55,315 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:55,315 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:34:55,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:55,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:55,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,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 11:34:55,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:55,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:55,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:55,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:55,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:34:55,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:34:55,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,326 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,327 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:34:55,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,328 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,328 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,333 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,333 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,335 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,335 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,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 11:34:55,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,336 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,337 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,340 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,340 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:34:55,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,341 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,342 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,346 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,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 11:34:55,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,347 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,347 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,348 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,351 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,351 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,355 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:34:55,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,356 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,357 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,364 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,364 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,366 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,366 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:34:55,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,367 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,368 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,373 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:34:55,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 11:34:55,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,374 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,375 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,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 11:34:55,383 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,383 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,383 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,384 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,385 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,385 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,386 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,387 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,387 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:34:55,388 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:34:55,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,395 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:34:55,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,396 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:55,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,410 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,411 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:55,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,411 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,413 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:55,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,413 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,414 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,416 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:34:55,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,416 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,418 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,430 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:34:55,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,431 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,431 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,434 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,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 11:34:55,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,448 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,449 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,449 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,451 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,451 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,452 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,453 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,454 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,454 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:34:55,456 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:34:55,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,467 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:34:55,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,468 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,468 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,468 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,469 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,476 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,476 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,476 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,477 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,479 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,479 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,479 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:34:55,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,482 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:34:55,483 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:34:55,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,489 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:34:55,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,490 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,490 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:55,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:55,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:34:55,508 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,508 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,508 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:55,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:55,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,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 11:34:55,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,512 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,512 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:55,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:55,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,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 11:34:55,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:34:55,515 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:34:55,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:34:55,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:34:55,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:34:55,516 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:34:55,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:34:55,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:34:55,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:34:55,811 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 80 [2018-11-10 11:34:55,855 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:34:55,855 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:34:55,855 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:34:55,855 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:34:55,855 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:34:55,855 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:34:55,855 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:34:55,855 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:34:55,855 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Lasso [2018-11-10 11:34:55,855 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:34:55,855 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:34:55,856 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 11:34:55,863 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 11:34:55,865 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 11:34:55,866 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 11:34:55,867 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 11:34:55,868 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 11:34:55,869 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 11:34:55,870 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 11:34:55,904 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 11:34:55,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:34:55,906 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 11:34:55,915 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 11:34:56,396 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 119 [2018-11-10 11:34:56,506 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-10 11:34:56,710 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-10 11:34:56,772 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:34:56,772 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:56,781 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:56,781 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:56,804 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:56,805 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_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:56,824 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:56,824 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret1=0} Honda state: {ULTIMATE.start_main_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,843 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:56,845 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:56,845 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:56,867 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:56,868 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~r~1=0} Honda state: {ULTIMATE.start_main_~r~1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:56,896 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:56,896 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r1~0=0} Honda state: {ULTIMATE.start_mp_add_~r1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,915 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:34:56,917 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:34:56,917 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_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:34:56,937 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:34:56,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:34:56,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:35:09,086 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 11:35:09,098 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:35:09,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:35:09,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:35:09,098 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:35:09,098 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:35:09,098 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:35:09,098 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:35:09,098 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:35:09,098 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Lasso [2018-11-10 11:35:09,098 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:35:09,098 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:35:09,100 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 11:35:09,107 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 11:35:09,109 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 11:35:09,111 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 11:35:09,113 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 11:35:09,126 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 11:35:09,171 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 11:35:09,172 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 11:35:09,174 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 11:35:09,176 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 11:35:09,179 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 11:35:09,181 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 11:35:09,556 WARN L179 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 119 [2018-11-10 11:35:09,804 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-10 11:35:09,845 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:35:09,845 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:35:09,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:09,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:35:09,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:09,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:35:09,886 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,887 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,888 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,890 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,891 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,892 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:09,892 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 11:35:09,893 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,895 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:09,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:09,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,897 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,897 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:35:09,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,898 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,900 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,901 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,901 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,903 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,903 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,903 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,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 11:35:09,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,904 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,906 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:35:09,906 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 11:35:09,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,920 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,923 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:35:09,924 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 11:35:09,956 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,958 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,958 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,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 11:35:09,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,959 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,959 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,960 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,961 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,962 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,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 11:35:09,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,963 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,964 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:35:09,964 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 11:35:09,965 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,967 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,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 11:35:09,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,968 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:09,969 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:09,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,969 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:35:09,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 11:35:09,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:09,971 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:09,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,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 11:35:09,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,973 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:09,973 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:09,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:09,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:09,975 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:09,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,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 11:35:09,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:09,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:09,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:09,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:09,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:09,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 11:35:09,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:09,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:09,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:09,979 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:09,981 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:09,981 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,042 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,044 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,050 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,051 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,089 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,090 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,091 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,091 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,092 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,092 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,093 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,094 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,094 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,096 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,096 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,099 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,100 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,101 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,101 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,102 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,102 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:35:10,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,103 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,103 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,105 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,106 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,107 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,107 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,108 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,109 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,109 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,110 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,111 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,113 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:35:10,114 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 11:35:10,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,143 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,149 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:35:10,149 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 11:35:10,190 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,191 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,192 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,193 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,193 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,195 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,195 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,197 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,197 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:35:10,197 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 11:35:10,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,200 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,201 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:10,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,202 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,202 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,203 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:35:10,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 11:35:10,204 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,204 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,204 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,205 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,206 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,206 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,207 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,208 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,209 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,209 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,210 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,210 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,211 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,211 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,213 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,214 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:35:10,215 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 11:35:10,228 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,229 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,229 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,234 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:35:10,234 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 11:35:10,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,299 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,299 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,300 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,300 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,301 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,301 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,302 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,302 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,303 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,303 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,304 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,304 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,305 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,305 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,306 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,306 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 11:35:10,306 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 11:35:10,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,309 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,310 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,310 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,311 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,312 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:10,312 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:10,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,312 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,312 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:35:10,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,313 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,314 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,316 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,316 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,316 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,318 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,318 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,318 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,319 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,320 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,321 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,321 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,323 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,324 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,326 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,326 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,345 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,346 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,352 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,352 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,412 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,413 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,413 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,413 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,414 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,415 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,416 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,416 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,417 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,418 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,418 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,419 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,419 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,421 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,421 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,422 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,422 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,426 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,426 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,426 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,428 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:10,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,429 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,430 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:35:10,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,431 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,431 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,432 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,433 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,433 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,434 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,435 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,436 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,436 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,436 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,438 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,438 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,439 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,441 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,444 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:35:10,444 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 11:35:10,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,468 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,468 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,469 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,478 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:35:10,478 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 11:35:10,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,531 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,532 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,533 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,534 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,534 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,535 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,535 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,537 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,537 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,538 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,539 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,540 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,540 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,540 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,541 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 11:35:10,542 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-10 11:35:10,547 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,548 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,548 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,549 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,551 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:10,552 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:10,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,553 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:35:10,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 11:35:10,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,554 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,554 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,554 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,556 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,556 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,557 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,557 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,559 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,559 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,559 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,560 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,562 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,563 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,564 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,564 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,567 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,567 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,602 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,603 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,608 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,608 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,666 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,667 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,667 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,669 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,672 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,672 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,674 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,675 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,676 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 11:35:10,676 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 11:35:10,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,680 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,680 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,680 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,682 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,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 11:35:10,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,682 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:10,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,683 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,683 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,683 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:10,683 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:10,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,684 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:35:10,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,685 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,685 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,688 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,689 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,691 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,692 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,694 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,695 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,697 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,697 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,698 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,701 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 11:35:10,701 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 11:35:10,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,772 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,780 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 11:35:10,780 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 11:35:10,910 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,911 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,911 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,912 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,914 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,914 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,917 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,917 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,918 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,920 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,920 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,921 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,922 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 11:35:10,922 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-10 11:35:10,927 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,927 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,927 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,928 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:10,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:10,931 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:10,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:10,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:10,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:10,931 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:10,931 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:10,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:10,933 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:10,933 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-10 11:35:10,934 INFO L793 eck$LassoCheckResult]: Stem: 2729#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2700#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 2697#L40 assume !(mp_add_~a3~0 % 256 == 0); 2693#L40-1 mp_add_~nb~0 := 4; 2694#L50 assume !(mp_add_~b3~0 % 256 == 0); 2724#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2942#L61-3 assume true; 2941#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; 2940#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2939#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2938#L65-2 assume !(mp_add_~i~0 % 256 == 1); 2937#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2936#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2935#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2934#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 2933#L71-2 assume !(mp_add_~i~0 % 256 == 1); 2932#L72-1 assume !(mp_add_~i~0 % 256 == 2); 2931#L73-1 assume !(mp_add_~i~0 % 256 == 3); 2930#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2929#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 2928#L80-1 assume !(mp_add_~i~0 % 256 == 1); 2927#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2925#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2923#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2717#L61-3 assume true; 2718#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; 2912#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2911#L65 assume !(mp_add_~i~0 % 256 == 0); 2909#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; 2896#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2908#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2907#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2906#L71 assume !(mp_add_~i~0 % 256 == 0); 2905#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; 2901#L72-1 assume !(mp_add_~i~0 % 256 == 2); 2902#L73-1 assume !(mp_add_~i~0 % 256 == 3); 2959#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2881#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2849#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 2850#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2926#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2924#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2922#L61-3 assume true; 2916#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; 2917#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2911#L65 [2018-11-10 11:35:10,934 INFO L795 eck$LassoCheckResult]: Loop: 2911#L65 assume !(mp_add_~i~0 % 256 == 0); 2909#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; 2896#L66-1 assume !(mp_add_~i~0 % 256 == 2); 2908#L67-1 assume !(mp_add_~i~0 % 256 == 3); 2907#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2906#L71 assume !(mp_add_~i~0 % 256 == 0); 2905#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; 2901#L72-1 assume !(mp_add_~i~0 % 256 == 2); 2902#L73-1 assume !(mp_add_~i~0 % 256 == 3); 2959#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2881#L76-1 assume !(mp_add_~i~0 % 256 == 0); 2849#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 2850#L81-1 assume !(mp_add_~i~0 % 256 == 2); 2926#L82-1 assume !(mp_add_~i~0 % 256 == 3); 2924#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 2922#L61-3 assume true; 2916#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; 2917#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2911#L65 [2018-11-10 11:35:10,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:10,934 INFO L82 PathProgramCache]: Analyzing trace with hash -178527998, now seen corresponding path program 2 times [2018-11-10 11:35:10,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:10,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:10,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:10,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:10,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:10,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -782991477, now seen corresponding path program 2 times [2018-11-10 11:35:10,962 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:10,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:10,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:10,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash -746290612, now seen corresponding path program 3 times [2018-11-10 11:35:10,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:10,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:10,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:10,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:10,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:11,183 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 11:35:11,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:35:11,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:35:11,298 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:35:11,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:35:11,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:35:11,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:35:11,298 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:35:11,298 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:35:11,298 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:35:11,298 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:35:11,298 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Loop [2018-11-10 11:35:11,298 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:35:11,298 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:35:11,299 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 11:35:11,311 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 11:35:11,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 11:35:11,352 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 11:35:11,474 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-11-10 11:35:11,720 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-10 11:35:11,746 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:35:11,746 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:35:11,748 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:35:11,748 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:35:11,751 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:35:11,751 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r1~0=0} Honda state: {ULTIMATE.start_mp_add_~r1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:35:11,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:35:11,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:35:11,824 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:35:11,824 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~b1~0=1024, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=33023} Honda state: {ULTIMATE.start_mp_add_~b1~0=1024, ULTIMATE.start_mp_add_~partial_sum~0=1, ULTIMATE.start_mp_add_~a1~0=33023} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:35:11,842 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:35:11,843 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:35:11,845 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:35:11,845 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:35:11,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:35:11,863 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:35:11,907 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:35:11,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:35:12,793 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:35:12,794 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:35:12,794 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:35:12,794 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:35:12,795 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:35:12,795 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:35:12,795 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:35:12,795 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:35:12,795 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:35:12,795 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Loop [2018-11-10 11:35:12,795 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:35:12,795 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:35:12,795 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 11:35:12,798 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 11:35:12,803 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 11:35:12,804 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 11:35:12,998 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:35:12,998 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:35:12,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:12,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:12,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:12,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:12,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:12,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:12,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:12,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,000 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:13,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:13,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,003 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:13,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:13,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:35:13,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:35:13,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,011 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:35:13,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 11:35:13,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,013 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,013 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,013 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,014 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,015 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,018 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,019 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,019 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,020 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,021 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,023 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,023 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:35:13,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,024 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,025 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,026 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,027 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,031 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,032 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,033 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,034 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,034 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,037 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:35:13,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,038 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,038 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,040 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,040 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,045 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,046 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,046 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,047 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:35:13,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,048 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,048 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,052 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,053 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:35:13,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,053 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,054 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,054 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,055 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,056 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,057 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,064 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,064 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,065 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,065 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,066 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,066 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,066 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:35:13,067 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:35:13,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,071 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,072 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:35:13,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,072 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:13,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,073 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,075 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:13,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,077 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,086 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:13,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,088 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,088 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,089 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:35:13,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,089 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,090 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,099 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,099 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:35:13,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,100 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,100 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,101 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,101 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,102 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,102 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,102 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,105 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,115 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,116 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,116 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,117 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,117 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,119 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,119 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,119 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:35:13,121 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:35:13,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,135 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:35:13,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,135 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,136 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,136 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,138 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,138 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,139 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,145 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,146 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,146 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,146 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,148 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:35:13,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,149 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:35:13,149 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:35:13,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,155 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,156 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:35:13,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 11:35:13,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,157 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:13,157 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:13,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,160 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,160 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:13,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:13,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,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 11:35:13,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,171 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,172 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:13,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:13,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:35:13,175 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:35:13,175 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:35:13,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:35:13,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:35:13,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:35:13,175 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:35:13,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:35:13,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:35:13,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:35:13,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:35:13,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:35:13,193 INFO L87 Difference]: Start difference. First operand 344 states and 465 transitions. cyclomatic complexity: 127 Second operand 6 states. [2018-11-10 11:35:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:13,584 INFO L93 Difference]: Finished difference Result 580 states and 752 transitions. [2018-11-10 11:35:13,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:35:13,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 752 transitions. [2018-11-10 11:35:13,589 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 472 [2018-11-10 11:35:13,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 572 states and 741 transitions. [2018-11-10 11:35:13,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 572 [2018-11-10 11:35:13,592 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 572 [2018-11-10 11:35:13,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 572 states and 741 transitions. [2018-11-10 11:35:13,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:35:13,593 INFO L705 BuchiCegarLoop]: Abstraction has 572 states and 741 transitions. [2018-11-10 11:35:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states and 741 transitions. [2018-11-10 11:35:13,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 518. [2018-11-10 11:35:13,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-11-10 11:35:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 677 transitions. [2018-11-10 11:35:13,604 INFO L728 BuchiCegarLoop]: Abstraction has 518 states and 677 transitions. [2018-11-10 11:35:13,604 INFO L608 BuchiCegarLoop]: Abstraction has 518 states and 677 transitions. [2018-11-10 11:35:13,605 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 11:35:13,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 518 states and 677 transitions. [2018-11-10 11:35:13,607 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 418 [2018-11-10 11:35:13,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:35:13,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:35:13,610 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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 11:35:13,611 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:13,611 INFO L793 eck$LassoCheckResult]: Stem: 3673#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3644#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 3641#L40 assume !(mp_add_~a3~0 % 256 == 0); 3637#L40-1 mp_add_~nb~0 := 4; 3638#L50 assume !(mp_add_~b3~0 % 256 == 0); 3669#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3977#L61-3 assume true; 3976#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; 3975#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3974#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3973#L65-2 assume !(mp_add_~i~0 % 256 == 1); 3972#L66-1 assume !(mp_add_~i~0 % 256 == 2); 3971#L67-1 assume !(mp_add_~i~0 % 256 == 3); 3970#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3969#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 3968#L71-2 assume !(mp_add_~i~0 % 256 == 1); 3967#L72-1 assume !(mp_add_~i~0 % 256 == 2); 3966#L73-1 assume !(mp_add_~i~0 % 256 == 3); 3965#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3964#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 3963#L80-1 assume !(mp_add_~i~0 % 256 == 1); 3962#L81-1 assume !(mp_add_~i~0 % 256 == 2); 3961#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3960#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3959#L61-3 assume true; 3958#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; 3957#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3956#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3939#L65-2 [2018-11-10 11:35:13,611 INFO L795 eck$LassoCheckResult]: Loop: 3939#L65-2 assume !(mp_add_~i~0 % 256 == 1); 4036#L66-1 assume !(mp_add_~i~0 % 256 == 2); 4035#L67-1 assume !(mp_add_~i~0 % 256 == 3); 4033#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4031#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4028#L71-2 assume !(mp_add_~i~0 % 256 == 1); 4026#L72-1 assume !(mp_add_~i~0 % 256 == 2); 4025#L73-1 assume !(mp_add_~i~0 % 256 == 3); 4023#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4020#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 4018#L80-1 assume !(mp_add_~i~0 % 256 == 1); 4016#L81-1 assume !(mp_add_~i~0 % 256 == 2); 3950#L82-1 assume !(mp_add_~i~0 % 256 == 3); 3940#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 3938#L61-3 assume true; 3935#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; 3930#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3931#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3939#L65-2 [2018-11-10 11:35:13,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:13,611 INFO L82 PathProgramCache]: Analyzing trace with hash 685868544, now seen corresponding path program 2 times [2018-11-10 11:35:13,611 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:13,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:13,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:13,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:13,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:35:13,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:35:13,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:35:13,752 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:35:13,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash -263089805, now seen corresponding path program 1 times [2018-11-10 11:35:13,752 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:13,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:13,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:13,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:13,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:13,792 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 11:35:13,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:35:13,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:35:13,793 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:35:13,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:35:13,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:35:13,793 INFO L87 Difference]: Start difference. First operand 518 states and 677 transitions. cyclomatic complexity: 165 Second operand 5 states. [2018-11-10 11:35:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:14,017 INFO L93 Difference]: Finished difference Result 690 states and 866 transitions. [2018-11-10 11:35:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:35:14,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 866 transitions. [2018-11-10 11:35:14,021 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 592 [2018-11-10 11:35:14,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 689 states and 865 transitions. [2018-11-10 11:35:14,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 689 [2018-11-10 11:35:14,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 689 [2018-11-10 11:35:14,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 689 states and 865 transitions. [2018-11-10 11:35:14,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:35:14,026 INFO L705 BuchiCegarLoop]: Abstraction has 689 states and 865 transitions. [2018-11-10 11:35:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states and 865 transitions. [2018-11-10 11:35:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 506. [2018-11-10 11:35:14,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-11-10 11:35:14,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 658 transitions. [2018-11-10 11:35:14,036 INFO L728 BuchiCegarLoop]: Abstraction has 506 states and 658 transitions. [2018-11-10 11:35:14,036 INFO L608 BuchiCegarLoop]: Abstraction has 506 states and 658 transitions. [2018-11-10 11:35:14,037 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 11:35:14,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 506 states and 658 transitions. [2018-11-10 11:35:14,039 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 411 [2018-11-10 11:35:14,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:35:14,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:35:14,040 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:14,040 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:14,040 INFO L793 eck$LassoCheckResult]: Stem: 4886#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 4857#L40 assume !(mp_add_~a3~0 % 256 == 0); 4854#L40-1 mp_add_~nb~0 := 4; 4855#L50 assume !(mp_add_~b3~0 % 256 == 0); 4882#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5269#L61-3 assume true; 5268#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; 5267#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5266#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5265#L65-2 assume !(mp_add_~i~0 % 256 == 1); 5264#L66-1 assume !(mp_add_~i~0 % 256 == 2); 5263#L67-1 assume !(mp_add_~i~0 % 256 == 3); 5262#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5261#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5260#L71-2 assume !(mp_add_~i~0 % 256 == 1); 5259#L72-1 assume !(mp_add_~i~0 % 256 == 2); 5258#L73-1 assume !(mp_add_~i~0 % 256 == 3); 5257#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5256#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 5255#L80-1 assume !(mp_add_~i~0 % 256 == 1); 5254#L81-1 assume !(mp_add_~i~0 % 256 == 2); 5253#L82-1 assume !(mp_add_~i~0 % 256 == 3); 5252#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 5251#L61-3 assume true; 5250#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; 5249#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5226#L65 [2018-11-10 11:35:14,041 INFO L795 eck$LassoCheckResult]: Loop: 5226#L65 assume !(mp_add_~i~0 % 256 == 0); 5248#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; 5118#L66-1 assume !(mp_add_~i~0 % 256 == 2); 5247#L67-1 assume !(mp_add_~i~0 % 256 == 3); 5246#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5224#L71 assume !(mp_add_~i~0 % 256 == 0); 5241#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; 5134#L72-1 assume !(mp_add_~i~0 % 256 == 2); 5222#L73-1 assume !(mp_add_~i~0 % 256 == 3); 5174#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5172#L76-1 assume !(mp_add_~i~0 % 256 == 0); 5106#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 5105#L81-1 assume !(mp_add_~i~0 % 256 == 2); 5104#L82-1 assume !(mp_add_~i~0 % 256 == 3); 5103#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 5102#L61-3 assume true; 5100#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; 5097#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5096#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5093#L71 assume !(mp_add_~i~0 % 256 == 0); 5090#L71-2 assume !(mp_add_~i~0 % 256 == 1); 5086#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; 5055#L73-1 assume !(mp_add_~i~0 % 256 == 3); 5081#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5079#L76-1 assume !(mp_add_~i~0 % 256 == 0); 5078#L80-1 assume !(mp_add_~i~0 % 256 == 1); 5073#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 5069#L82-1 assume !(mp_add_~i~0 % 256 == 3); 5068#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 5067#L61-3 assume true; 5065#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; 5061#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5058#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5051#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5075#L76-1 assume !(mp_add_~i~0 % 256 == 0); 5074#L80-1 assume !(mp_add_~i~0 % 256 == 1); 5071#L81-1 assume !(mp_add_~i~0 % 256 == 2); 5072#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 4941#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 5119#L61-3 assume true; 5116#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; 5111#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5113#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5130#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5126#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 5127#L80-1 assume !(mp_add_~i~0 % 256 == 1); 5231#L81-1 assume !(mp_add_~i~0 % 256 == 2); 5230#L82-1 assume !(mp_add_~i~0 % 256 == 3); 5229#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 5228#L61-3 assume true; 5227#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; 5225#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5226#L65 [2018-11-10 11:35:14,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 3 times [2018-11-10 11:35:14,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:14,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:14,063 INFO L82 PathProgramCache]: Analyzing trace with hash -166549891, now seen corresponding path program 1 times [2018-11-10 11:35:14,063 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:14,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:14,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:14,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:14,137 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 11:35:14,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:35:14,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:35:14,137 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:35:14,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:35:14,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:35:14,138 INFO L87 Difference]: Start difference. First operand 506 states and 658 transitions. cyclomatic complexity: 157 Second operand 4 states. [2018-11-10 11:35:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:14,256 INFO L93 Difference]: Finished difference Result 992 states and 1278 transitions. [2018-11-10 11:35:14,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:35:14,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 992 states and 1278 transitions. [2018-11-10 11:35:14,262 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 865 [2018-11-10 11:35:14,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 992 states to 992 states and 1278 transitions. [2018-11-10 11:35:14,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 992 [2018-11-10 11:35:14,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 992 [2018-11-10 11:35:14,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 992 states and 1278 transitions. [2018-11-10 11:35:14,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:35:14,269 INFO L705 BuchiCegarLoop]: Abstraction has 992 states and 1278 transitions. [2018-11-10 11:35:14,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states and 1278 transitions. [2018-11-10 11:35:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 748. [2018-11-10 11:35:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-11-10 11:35:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 989 transitions. [2018-11-10 11:35:14,283 INFO L728 BuchiCegarLoop]: Abstraction has 748 states and 989 transitions. [2018-11-10 11:35:14,283 INFO L608 BuchiCegarLoop]: Abstraction has 748 states and 989 transitions. [2018-11-10 11:35:14,283 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 11:35:14,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 748 states and 989 transitions. [2018-11-10 11:35:14,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 653 [2018-11-10 11:35:14,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:35:14,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:35:14,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:14,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:14,288 INFO L793 eck$LassoCheckResult]: Stem: 6397#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6366#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 6365#L40 assume !(mp_add_~a3~0 % 256 == 0); 6361#L40-1 mp_add_~nb~0 := 4; 6362#L50 assume !(mp_add_~b3~0 % 256 == 0); 6391#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6650#L61-3 assume true; 6649#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; 6648#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6647#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6646#L65-2 assume !(mp_add_~i~0 % 256 == 1); 6645#L66-1 assume !(mp_add_~i~0 % 256 == 2); 6644#L67-1 assume !(mp_add_~i~0 % 256 == 3); 6643#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6642#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6641#L71-2 assume !(mp_add_~i~0 % 256 == 1); 6640#L72-1 assume !(mp_add_~i~0 % 256 == 2); 6639#L73-1 assume !(mp_add_~i~0 % 256 == 3); 6638#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6637#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 6636#L80-1 assume !(mp_add_~i~0 % 256 == 1); 6635#L81-1 assume !(mp_add_~i~0 % 256 == 2); 6634#L82-1 assume !(mp_add_~i~0 % 256 == 3); 6633#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 6632#L61-3 assume true; 6631#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; 6629#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6603#L65 [2018-11-10 11:35:14,288 INFO L795 eck$LassoCheckResult]: Loop: 6603#L65 assume !(mp_add_~i~0 % 256 == 0); 6626#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; 6529#L66-1 assume !(mp_add_~i~0 % 256 == 2); 6625#L67-1 assume !(mp_add_~i~0 % 256 == 3); 6624#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6600#L71 assume !(mp_add_~i~0 % 256 == 0); 6605#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; 6518#L72-1 assume !(mp_add_~i~0 % 256 == 2); 6598#L73-1 assume !(mp_add_~i~0 % 256 == 3); 6596#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6595#L76-1 assume !(mp_add_~i~0 % 256 == 0); 6594#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 6508#L81-1 assume !(mp_add_~i~0 % 256 == 2); 6593#L82-1 assume !(mp_add_~i~0 % 256 == 3); 6592#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 6591#L61-3 assume true; 6589#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; 6584#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6583#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6581#L71 assume !(mp_add_~i~0 % 256 == 0); 6579#L71-2 assume !(mp_add_~i~0 % 256 == 1); 6537#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; 6536#L73-1 assume !(mp_add_~i~0 % 256 == 3); 6534#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6533#L76-1 assume !(mp_add_~i~0 % 256 == 0); 6532#L80-1 assume !(mp_add_~i~0 % 256 == 1); 6524#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 6506#L82-1 assume !(mp_add_~i~0 % 256 == 3); 6492#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 6493#L61-3 assume true; 6487#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; 6477#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6479#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6567#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6557#L76-1 assume !(mp_add_~i~0 % 256 == 0); 6555#L80-1 assume !(mp_add_~i~0 % 256 == 1); 6500#L81-1 assume !(mp_add_~i~0 % 256 == 2); 6494#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 6450#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 6489#L61-3 assume true; 6485#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; 6486#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6574#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6571#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6565#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 6566#L80-1 assume !(mp_add_~i~0 % 256 == 1); 6630#L81-1 assume !(mp_add_~i~0 % 256 == 2); 6628#L82-1 assume !(mp_add_~i~0 % 256 == 3); 6627#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 6623#L61-3 assume true; 6606#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; 6602#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6603#L65 [2018-11-10 11:35:14,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 4 times [2018-11-10 11:35:14,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:14,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:14,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:14,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:14,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:14,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1175435263, now seen corresponding path program 1 times [2018-11-10 11:35:14,304 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:14,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:14,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 11:35:14,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:35:14,367 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:35:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:14,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:35:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 11:35:14,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:35:14,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-11-10 11:35:14,534 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:35:14,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:35:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:35:14,535 INFO L87 Difference]: Start difference. First operand 748 states and 989 transitions. cyclomatic complexity: 246 Second operand 7 states. [2018-11-10 11:35:20,898 WARN L179 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2018-11-10 11:35:21,290 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-10 11:35:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:21,311 INFO L93 Difference]: Finished difference Result 1242 states and 1561 transitions. [2018-11-10 11:35:21,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 11:35:21,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1242 states and 1561 transitions. [2018-11-10 11:35:21,315 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1055 [2018-11-10 11:35:21,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1242 states to 1221 states and 1540 transitions. [2018-11-10 11:35:21,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1221 [2018-11-10 11:35:21,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1221 [2018-11-10 11:35:21,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1221 states and 1540 transitions. [2018-11-10 11:35:21,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:35:21,323 INFO L705 BuchiCegarLoop]: Abstraction has 1221 states and 1540 transitions. [2018-11-10 11:35:21,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states and 1540 transitions. [2018-11-10 11:35:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 955. [2018-11-10 11:35:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-10 11:35:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1243 transitions. [2018-11-10 11:35:21,338 INFO L728 BuchiCegarLoop]: Abstraction has 955 states and 1243 transitions. [2018-11-10 11:35:21,338 INFO L608 BuchiCegarLoop]: Abstraction has 955 states and 1243 transitions. [2018-11-10 11:35:21,338 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 11:35:21,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 955 states and 1243 transitions. [2018-11-10 11:35:21,341 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 849 [2018-11-10 11:35:21,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:35:21,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:35:21,342 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:21,342 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:21,343 INFO L793 eck$LassoCheckResult]: Stem: 8584#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8557#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 8554#L40 assume !(mp_add_~a3~0 % 256 == 0); 8550#L40-1 mp_add_~nb~0 := 4; 8551#L50 assume !(mp_add_~b3~0 % 256 == 0); 8574#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8575#L61-3 assume true; 9434#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; 9433#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9432#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9431#L65-2 assume !(mp_add_~i~0 % 256 == 1); 9430#L66-1 assume !(mp_add_~i~0 % 256 == 2); 9429#L67-1 assume !(mp_add_~i~0 % 256 == 3); 9428#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9427#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9426#L71-2 assume !(mp_add_~i~0 % 256 == 1); 9425#L72-1 assume !(mp_add_~i~0 % 256 == 2); 9424#L73-1 assume !(mp_add_~i~0 % 256 == 3); 9423#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 9413#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 9411#L80-1 assume !(mp_add_~i~0 % 256 == 1); 9409#L81-1 assume !(mp_add_~i~0 % 256 == 2); 9407#L82-1 assume !(mp_add_~i~0 % 256 == 3); 9405#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 9403#L61-3 assume true; 9401#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; 9399#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9397#L65 [2018-11-10 11:35:21,343 INFO L795 eck$LassoCheckResult]: Loop: 9397#L65 assume !(mp_add_~i~0 % 256 == 0); 9398#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; 9250#L66-1 assume !(mp_add_~i~0 % 256 == 2); 9395#L67-1 assume !(mp_add_~i~0 % 256 == 3); 9379#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9378#L71 assume !(mp_add_~i~0 % 256 == 0); 9377#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; 9238#L72-1 assume !(mp_add_~i~0 % 256 == 2); 9376#L73-1 assume !(mp_add_~i~0 % 256 == 3); 9375#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9374#L76-1 assume !(mp_add_~i~0 % 256 == 0); 9369#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 9229#L81-1 assume !(mp_add_~i~0 % 256 == 2); 9358#L82-1 assume !(mp_add_~i~0 % 256 == 3); 9356#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 9354#L61-3 assume true; 9345#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; 9335#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 9333#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9331#L71 assume !(mp_add_~i~0 % 256 == 0); 9329#L71-2 assume !(mp_add_~i~0 % 256 == 1); 9323#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; 9288#L73-1 assume !(mp_add_~i~0 % 256 == 3); 9321#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9350#L76-1 assume !(mp_add_~i~0 % 256 == 0); 9352#L80-1 assume !(mp_add_~i~0 % 256 == 1); 9351#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 9276#L82-1 assume !(mp_add_~i~0 % 256 == 3); 9349#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 9348#L61-3 assume true; 9343#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; 9339#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 9341#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 9357#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 9355#L76-1 assume !(mp_add_~i~0 % 256 == 0); 9353#L80-1 assume !(mp_add_~i~0 % 256 == 1); 9344#L81-1 assume !(mp_add_~i~0 % 256 == 2); 9226#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 9268#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 9266#L61-3 assume true; 9263#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; 9264#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 9301#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9302#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9417#L71-2 assume !(mp_add_~i~0 % 256 == 1); 9416#L72-1 assume !(mp_add_~i~0 % 256 == 2); 9415#L73-1 assume !(mp_add_~i~0 % 256 == 3); 9414#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9412#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 9410#L80-1 assume !(mp_add_~i~0 % 256 == 1); 9408#L81-1 assume !(mp_add_~i~0 % 256 == 2); 9406#L82-1 assume !(mp_add_~i~0 % 256 == 3); 9404#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 9402#L61-3 assume true; 9400#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; 9396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9397#L65 [2018-11-10 11:35:21,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:21,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 5 times [2018-11-10 11:35:21,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:21,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:21,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:21,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:21,357 INFO L82 PathProgramCache]: Analyzing trace with hash -939773109, now seen corresponding path program 1 times [2018-11-10 11:35:21,357 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:21,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 11:35:21,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:35:21,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 11:35:21,413 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:35:21,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 11:35:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 11:35:21,413 INFO L87 Difference]: Start difference. First operand 955 states and 1243 transitions. cyclomatic complexity: 294 Second operand 5 states. [2018-11-10 11:35:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:21,581 INFO L93 Difference]: Finished difference Result 1986 states and 2678 transitions. [2018-11-10 11:35:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:35:21,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1986 states and 2678 transitions. [2018-11-10 11:35:21,589 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1843 [2018-11-10 11:35:21,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1986 states to 1982 states and 2672 transitions. [2018-11-10 11:35:21,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1982 [2018-11-10 11:35:21,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1982 [2018-11-10 11:35:21,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1982 states and 2672 transitions. [2018-11-10 11:35:21,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:35:21,602 INFO L705 BuchiCegarLoop]: Abstraction has 1982 states and 2672 transitions. [2018-11-10 11:35:21,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states and 2672 transitions. [2018-11-10 11:35:21,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1330. [2018-11-10 11:35:21,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-11-10 11:35:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1806 transitions. [2018-11-10 11:35:21,673 INFO L728 BuchiCegarLoop]: Abstraction has 1330 states and 1806 transitions. [2018-11-10 11:35:21,673 INFO L608 BuchiCegarLoop]: Abstraction has 1330 states and 1806 transitions. [2018-11-10 11:35:21,673 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 11:35:21,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1806 transitions. [2018-11-10 11:35:21,677 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1213 [2018-11-10 11:35:21,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:35:21,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:35:21,678 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:21,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:21,679 INFO L793 eck$LassoCheckResult]: Stem: 11534#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11508#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 11505#L40 assume !(mp_add_~a3~0 % 256 == 0); 11501#L40-1 mp_add_~nb~0 := 4; 11502#L50 assume !(mp_add_~b3~0 % 256 == 0); 11528#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11529#L61-3 assume true; 12485#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; 12484#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12483#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12482#L65-2 assume !(mp_add_~i~0 % 256 == 1); 12481#L66-1 assume !(mp_add_~i~0 % 256 == 2); 12480#L67-1 assume !(mp_add_~i~0 % 256 == 3); 12479#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12478#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12477#L71-2 assume !(mp_add_~i~0 % 256 == 1); 12476#L72-1 assume !(mp_add_~i~0 % 256 == 2); 12475#L73-1 assume !(mp_add_~i~0 % 256 == 3); 12474#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12473#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 12472#L80-1 assume !(mp_add_~i~0 % 256 == 1); 12471#L81-1 assume !(mp_add_~i~0 % 256 == 2); 12470#L82-1 assume !(mp_add_~i~0 % 256 == 3); 12469#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 12468#L61-3 assume true; 12467#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; 12466#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12442#L65 [2018-11-10 11:35:21,679 INFO L795 eck$LassoCheckResult]: Loop: 12442#L65 assume !(mp_add_~i~0 % 256 == 0); 12465#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; 12399#L66-1 assume !(mp_add_~i~0 % 256 == 2); 12440#L67-1 assume !(mp_add_~i~0 % 256 == 3); 12439#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12438#L71 assume !(mp_add_~i~0 % 256 == 0); 12437#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; 12376#L72-1 assume !(mp_add_~i~0 % 256 == 2); 12436#L73-1 assume !(mp_add_~i~0 % 256 == 3); 12435#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12434#L76-1 assume !(mp_add_~i~0 % 256 == 0); 12374#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 12298#L81-1 assume !(mp_add_~i~0 % 256 == 2); 12370#L82-1 assume !(mp_add_~i~0 % 256 == 3); 12368#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 12367#L61-3 assume true; 12365#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; 12362#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12359#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12358#L71 assume !(mp_add_~i~0 % 256 == 0); 12355#L71-2 assume !(mp_add_~i~0 % 256 == 1); 12350#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; 12314#L73-1 assume !(mp_add_~i~0 % 256 == 3); 12347#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12345#L76-1 assume !(mp_add_~i~0 % 256 == 0); 12343#L80-1 assume !(mp_add_~i~0 % 256 == 1); 12341#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 12339#L82-1 assume !(mp_add_~i~0 % 256 == 3); 12337#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 12335#L61-3 assume true; 12332#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; 12333#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12320#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12321#L71 assume !(mp_add_~i~0 % 256 == 0); 12316#L71-2 assume !(mp_add_~i~0 % 256 == 1); 12317#L72-1 assume !(mp_add_~i~0 % 256 == 2); 12353#L73-1 assume !(mp_add_~i~0 % 256 == 3); 12354#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12371#L76-1 assume !(mp_add_~i~0 % 256 == 0); 12360#L80-1 assume !(mp_add_~i~0 % 256 == 1); 12361#L81-1 assume !(mp_add_~i~0 % 256 == 2); 12418#L82-1 assume !(mp_add_~i~0 % 256 == 3); 12411#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 12412#L61-3 assume true; 12404#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; 12405#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12542#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12522#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12514#L76-1 assume !(mp_add_~i~0 % 256 == 0); 12512#L80-1 assume !(mp_add_~i~0 % 256 == 1); 12505#L81-1 assume !(mp_add_~i~0 % 256 == 2); 12502#L82-1 assume !(mp_add_~i~0 % 256 == 3); 12492#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 12490#L61-3 assume true; 12487#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; 12488#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12461#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12462#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12453#L71-2 assume !(mp_add_~i~0 % 256 == 1); 12452#L72-1 assume !(mp_add_~i~0 % 256 == 2); 12451#L73-1 assume !(mp_add_~i~0 % 256 == 3); 12450#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12449#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 12448#L80-1 assume !(mp_add_~i~0 % 256 == 1); 12447#L81-1 assume !(mp_add_~i~0 % 256 == 2); 12446#L82-1 assume !(mp_add_~i~0 % 256 == 3); 12445#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 12444#L61-3 assume true; 12443#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; 12441#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12442#L65 [2018-11-10 11:35:21,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 6 times [2018-11-10 11:35:21,679 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:21,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:21,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash -437287767, now seen corresponding path program 1 times [2018-11-10 11:35:21,697 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:21,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:21,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:35:21,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 91 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 11:35:21,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:35:21,947 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:35:21,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:21,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:35:22,030 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-10 11:35:22,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:35:22,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2018-11-10 11:35:22,057 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:35:22,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:35:22,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-10 11:35:22,057 INFO L87 Difference]: Start difference. First operand 1330 states and 1806 transitions. cyclomatic complexity: 482 Second operand 10 states. [2018-11-10 11:35:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:35:22,927 INFO L93 Difference]: Finished difference Result 2624 states and 3219 transitions. [2018-11-10 11:35:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-10 11:35:22,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2624 states and 3219 transitions. [2018-11-10 11:35:22,936 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 2118 [2018-11-10 11:35:22,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2624 states to 2549 states and 3136 transitions. [2018-11-10 11:35:22,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2549 [2018-11-10 11:35:22,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2549 [2018-11-10 11:35:22,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2549 states and 3136 transitions. [2018-11-10 11:35:22,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:35:22,953 INFO L705 BuchiCegarLoop]: Abstraction has 2549 states and 3136 transitions. [2018-11-10 11:35:22,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states and 3136 transitions. [2018-11-10 11:35:22,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 1714. [2018-11-10 11:35:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-11-10 11:35:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2219 transitions. [2018-11-10 11:35:22,979 INFO L728 BuchiCegarLoop]: Abstraction has 1714 states and 2219 transitions. [2018-11-10 11:35:22,979 INFO L608 BuchiCegarLoop]: Abstraction has 1714 states and 2219 transitions. [2018-11-10 11:35:22,979 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 11:35:22,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1714 states and 2219 transitions. [2018-11-10 11:35:22,984 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1466 [2018-11-10 11:35:22,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:35:22,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:35:22,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:22,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:35:22,985 INFO L793 eck$LassoCheckResult]: Stem: 15758#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15732#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 15729#L40 assume !(mp_add_~a3~0 % 256 == 0); 15726#L40-1 mp_add_~nb~0 := 4; 15727#L50 assume !(mp_add_~b3~0 % 256 == 0); 15751#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 15752#L61-3 assume true; 16914#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; 16913#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16912#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16911#L65-2 assume !(mp_add_~i~0 % 256 == 1); 16910#L66-1 assume !(mp_add_~i~0 % 256 == 2); 16909#L67-1 assume !(mp_add_~i~0 % 256 == 3); 16908#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16907#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16906#L71-2 assume !(mp_add_~i~0 % 256 == 1); 16905#L72-1 assume !(mp_add_~i~0 % 256 == 2); 16904#L73-1 assume !(mp_add_~i~0 % 256 == 3); 16903#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16902#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 16901#L80-1 assume !(mp_add_~i~0 % 256 == 1); 16900#L81-1 assume !(mp_add_~i~0 % 256 == 2); 16899#L82-1 assume !(mp_add_~i~0 % 256 == 3); 16898#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 16897#L61-3 assume true; 16896#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; 16895#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16873#L65 [2018-11-10 11:35:22,985 INFO L795 eck$LassoCheckResult]: Loop: 16873#L65 assume !(mp_add_~i~0 % 256 == 0); 16894#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; 16388#L66-1 assume !(mp_add_~i~0 % 256 == 2); 16893#L67-1 assume !(mp_add_~i~0 % 256 == 3); 16892#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16891#L71 assume !(mp_add_~i~0 % 256 == 0); 16890#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; 16380#L72-1 assume !(mp_add_~i~0 % 256 == 2); 16868#L73-1 assume !(mp_add_~i~0 % 256 == 3); 16866#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16864#L76-1 assume !(mp_add_~i~0 % 256 == 0); 16862#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 16367#L81-1 assume !(mp_add_~i~0 % 256 == 2); 16860#L82-1 assume !(mp_add_~i~0 % 256 == 3); 16858#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 16856#L61-3 assume true; 16854#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; 16852#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16807#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16805#L71 assume !(mp_add_~i~0 % 256 == 0); 16803#L71-2 assume !(mp_add_~i~0 % 256 == 1); 16802#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; 16800#L73-1 assume !(mp_add_~i~0 % 256 == 3); 16798#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16797#L76-1 assume !(mp_add_~i~0 % 256 == 0); 16796#L80-1 assume !(mp_add_~i~0 % 256 == 1); 16786#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 16783#L82-1 assume !(mp_add_~i~0 % 256 == 3); 16781#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 16779#L61-3 assume true; 16778#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; 16565#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16563#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16562#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16546#L76-1 assume !(mp_add_~i~0 % 256 == 0); 16561#L80-1 assume !(mp_add_~i~0 % 256 == 1); 16560#L81-1 assume !(mp_add_~i~0 % 256 == 2); 16559#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 16558#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 16557#L61-3 assume true; 16556#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; 16554#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16555#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16744#L71 assume !(mp_add_~i~0 % 256 == 0); 16793#L71-2 assume !(mp_add_~i~0 % 256 == 1); 16792#L72-1 assume !(mp_add_~i~0 % 256 == 2); 16791#L73-1 assume !(mp_add_~i~0 % 256 == 3); 16737#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16738#L76-1 assume !(mp_add_~i~0 % 256 == 0); 16733#L80-1 assume !(mp_add_~i~0 % 256 == 1); 16734#L81-1 assume !(mp_add_~i~0 % 256 == 2); 16405#L82-1 assume !(mp_add_~i~0 % 256 == 3); 16400#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 16401#L61-3 assume true; 16394#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; 16395#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16429#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16431#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16425#L76-1 assume !(mp_add_~i~0 % 256 == 0); 16426#L80-1 assume !(mp_add_~i~0 % 256 == 1); 16422#L81-1 assume !(mp_add_~i~0 % 256 == 2); 16421#L82-1 assume !(mp_add_~i~0 % 256 == 3); 16718#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 16714#L61-3 assume true; 16710#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; 16705#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16706#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16889#L65-2 assume !(mp_add_~i~0 % 256 == 1); 16888#L66-1 assume !(mp_add_~i~0 % 256 == 2); 16887#L67-1 assume !(mp_add_~i~0 % 256 == 3); 16886#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16885#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16884#L71-2 assume !(mp_add_~i~0 % 256 == 1); 16883#L72-1 assume !(mp_add_~i~0 % 256 == 2); 16882#L73-1 assume !(mp_add_~i~0 % 256 == 3); 16881#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16880#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 16879#L80-1 assume !(mp_add_~i~0 % 256 == 1); 16878#L81-1 assume !(mp_add_~i~0 % 256 == 2); 16877#L82-1 assume !(mp_add_~i~0 % 256 == 3); 16876#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 16875#L61-3 assume true; 16874#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; 16872#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16873#L65 [2018-11-10 11:35:22,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:22,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 7 times [2018-11-10 11:35:22,986 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:22,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:22,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:22,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:22,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:22,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:35:22,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:35:22,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1555152743, now seen corresponding path program 1 times [2018-11-10 11:35:22,998 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:35:22,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:35:22,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:22,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:22,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:35:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 136 proven. 3 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 11:35:23,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:35:23,043 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:35:23,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:35:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:35:23,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:35:23,450 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 11:35:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 134 proven. 19 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-10 11:35:23,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:35:23,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8] total 10 [2018-11-10 11:35:23,852 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:35:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 11:35:23,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2018-11-10 11:35:23,852 INFO L87 Difference]: Start difference. First operand 1714 states and 2219 transitions. cyclomatic complexity: 512 Second operand 10 states. [2018-11-10 11:35:26,550 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-10 11:35:26,996 WARN L179 SmtUtils]: Spent 424.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-10 11:35:28,040 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-11-10 11:35:28,514 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-10 11:35:30,145 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-10 11:35:31,183 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-11-10 11:35:42,676 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2018-11-10 11:35:49,992 WARN L179 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2018-11-10 11:35:58,570 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 27 DAG size of output: 27 [2018-11-10 11:36:05,339 WARN L179 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-10 11:36:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:08,833 INFO L93 Difference]: Finished difference Result 3164 states and 3802 transitions. [2018-11-10 11:36:08,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-10 11:36:08,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3164 states and 3802 transitions. [2018-11-10 11:36:08,841 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 2259 [2018-11-10 11:36:08,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3164 states to 3116 states and 3734 transitions. [2018-11-10 11:36:08,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3116 [2018-11-10 11:36:08,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3116 [2018-11-10 11:36:08,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3116 states and 3734 transitions. [2018-11-10 11:36:08,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:36:08,854 INFO L705 BuchiCegarLoop]: Abstraction has 3116 states and 3734 transitions. [2018-11-10 11:36:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3116 states and 3734 transitions. [2018-11-10 11:36:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3116 to 1581. [2018-11-10 11:36:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1581 states. [2018-11-10 11:36:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1966 transitions. [2018-11-10 11:36:08,874 INFO L728 BuchiCegarLoop]: Abstraction has 1581 states and 1966 transitions. [2018-11-10 11:36:08,874 INFO L608 BuchiCegarLoop]: Abstraction has 1581 states and 1966 transitions. [2018-11-10 11:36:08,874 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 11:36:08,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1581 states and 1966 transitions. [2018-11-10 11:36:08,879 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1269 [2018-11-10 11:36:08,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:36:08,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:36:08,880 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:08,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:08,880 INFO L793 eck$LassoCheckResult]: Stem: 20980#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20953#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 20950#L40 assume !(mp_add_~a3~0 % 256 == 0); 20946#L40-1 mp_add_~nb~0 := 4; 20947#L50 assume !(mp_add_~b3~0 % 256 == 0); 20972#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 20973#L61-3 assume true; 21942#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; 21941#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 21940#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 21939#L65-2 assume !(mp_add_~i~0 % 256 == 1); 21938#L66-1 assume !(mp_add_~i~0 % 256 == 2); 21937#L67-1 assume !(mp_add_~i~0 % 256 == 3); 21936#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21935#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 21934#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21933#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21932#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21931#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 21889#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 21887#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21885#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21883#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21881#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21879#L61-3 assume true; 21877#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; 21811#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 21810#L65 [2018-11-10 11:36:08,880 INFO L795 eck$LassoCheckResult]: Loop: 21810#L65 assume !(mp_add_~i~0 % 256 == 0); 21809#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; 21674#L66-1 assume !(mp_add_~i~0 % 256 == 2); 21808#L67-1 assume !(mp_add_~i~0 % 256 == 3); 21807#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21806#L71 assume !(mp_add_~i~0 % 256 == 0); 21801#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; 21758#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21800#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21799#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 21798#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21797#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 21720#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21796#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21795#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21794#L61-3 assume true; 21792#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; 21788#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21789#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21852#L71 assume !(mp_add_~i~0 % 256 == 0); 21851#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21850#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; 21849#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21845#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 21843#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21841#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21838#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 21836#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21837#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21832#L61-3 assume true; 21833#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; 21706#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21707#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21702#L71 assume !(mp_add_~i~0 % 256 == 0); 21703#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21697#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21696#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; 21598#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 21599#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21594#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21595#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21590#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 21591#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21586#L61-3 assume true; 21587#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; 21583#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21581#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 21580#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 21578#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21579#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21574#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21575#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21713#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21943#L61-3 assume true; 21929#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; 21927#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21928#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21922#L71 assume !(mp_add_~i~0 % 256 == 0); 21920#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21918#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21916#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21914#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 21912#L76-1 assume !(mp_add_~i~0 % 256 == 0); 21910#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21908#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21906#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21905#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21904#L61-3 assume true; 21903#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; 21901#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 21899#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 21898#L65-2 assume !(mp_add_~i~0 % 256 == 1); 21897#L66-1 assume !(mp_add_~i~0 % 256 == 2); 21896#L67-1 assume !(mp_add_~i~0 % 256 == 3); 21895#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21894#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 21893#L71-2 assume !(mp_add_~i~0 % 256 == 1); 21892#L72-1 assume !(mp_add_~i~0 % 256 == 2); 21891#L73-1 assume !(mp_add_~i~0 % 256 == 3); 21890#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 21888#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 21886#L80-1 assume !(mp_add_~i~0 % 256 == 1); 21884#L81-1 assume !(mp_add_~i~0 % 256 == 2); 21882#L82-1 assume !(mp_add_~i~0 % 256 == 3); 21880#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 21878#L61-3 assume true; 21821#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; 21822#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 21810#L65 [2018-11-10 11:36:08,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:08,880 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 8 times [2018-11-10 11:36:08,880 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:36:08,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:36:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:08,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:08,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:36:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:36:08,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash 777282423, now seen corresponding path program 1 times [2018-11-10 11:36:08,893 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:36:08,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:36:08,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:08,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:36:08,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:08,980 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-10 11:36:08,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:36:08,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:36:08,980 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:36:08,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:36:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:36:08,981 INFO L87 Difference]: Start difference. First operand 1581 states and 1966 transitions. cyclomatic complexity: 395 Second operand 6 states. [2018-11-10 11:36:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:09,151 INFO L93 Difference]: Finished difference Result 1307 states and 1576 transitions. [2018-11-10 11:36:09,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:36:09,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1307 states and 1576 transitions. [2018-11-10 11:36:09,154 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 844 [2018-11-10 11:36:09,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1307 states to 1267 states and 1522 transitions. [2018-11-10 11:36:09,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1267 [2018-11-10 11:36:09,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1267 [2018-11-10 11:36:09,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1267 states and 1522 transitions. [2018-11-10 11:36:09,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:36:09,161 INFO L705 BuchiCegarLoop]: Abstraction has 1267 states and 1522 transitions. [2018-11-10 11:36:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states and 1522 transitions. [2018-11-10 11:36:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1063. [2018-11-10 11:36:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2018-11-10 11:36:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1300 transitions. [2018-11-10 11:36:09,175 INFO L728 BuchiCegarLoop]: Abstraction has 1063 states and 1300 transitions. [2018-11-10 11:36:09,175 INFO L608 BuchiCegarLoop]: Abstraction has 1063 states and 1300 transitions. [2018-11-10 11:36:09,175 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 11:36:09,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1063 states and 1300 transitions. [2018-11-10 11:36:09,178 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 764 [2018-11-10 11:36:09,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:36:09,178 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:36:09,182 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,182 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:09,183 INFO L793 eck$LassoCheckResult]: Stem: 23885#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 23858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 23855#L40 assume !(mp_add_~a3~0 % 256 == 0); 23851#L40-1 mp_add_~nb~0 := 4; 23852#L50 assume !(mp_add_~b3~0 % 256 == 0); 23877#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23878#L61-3 assume true; 24602#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; 24599#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24596#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24594#L65-2 assume !(mp_add_~i~0 % 256 == 1); 24595#L66-1 assume !(mp_add_~i~0 % 256 == 2); 24590#L67-1 assume !(mp_add_~i~0 % 256 == 3); 24591#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24586#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 24587#L71-2 assume !(mp_add_~i~0 % 256 == 1); 24582#L72-1 assume !(mp_add_~i~0 % 256 == 2); 24583#L73-1 assume !(mp_add_~i~0 % 256 == 3); 24578#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24579#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 24574#L80-1 assume !(mp_add_~i~0 % 256 == 1); 24575#L81-1 assume !(mp_add_~i~0 % 256 == 2); 24570#L82-1 assume !(mp_add_~i~0 % 256 == 3); 24571#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 24564#L61-3 assume true; 24565#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; 24553#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24552#L65 [2018-11-10 11:36:09,183 INFO L795 eck$LassoCheckResult]: Loop: 24552#L65 assume !(mp_add_~i~0 % 256 == 0); 24551#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; 24422#L66-1 assume !(mp_add_~i~0 % 256 == 2); 24550#L67-1 assume !(mp_add_~i~0 % 256 == 3); 24549#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24548#L71 assume !(mp_add_~i~0 % 256 == 0); 24545#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; 24414#L72-1 assume !(mp_add_~i~0 % 256 == 2); 24544#L73-1 assume !(mp_add_~i~0 % 256 == 3); 24543#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 24542#L76-1 assume !(mp_add_~i~0 % 256 == 0); 24528#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 24501#L81-1 assume !(mp_add_~i~0 % 256 == 2); 24525#L82-1 assume !(mp_add_~i~0 % 256 == 3); 24524#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 24523#L61-3 assume true; 24522#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; 24519#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24520#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24665#L71 assume !(mp_add_~i~0 % 256 == 0); 24664#L71-2 assume !(mp_add_~i~0 % 256 == 1); 24663#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; 24662#L73-1 assume !(mp_add_~i~0 % 256 == 3); 24660#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24658#L76-1 assume !(mp_add_~i~0 % 256 == 0); 24657#L80-1 assume !(mp_add_~i~0 % 256 == 1); 24655#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 24651#L82-1 assume !(mp_add_~i~0 % 256 == 3); 24652#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 24644#L61-3 assume true; 24641#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; 24642#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24666#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24634#L71 assume !(mp_add_~i~0 % 256 == 0); 24635#L71-2 assume !(mp_add_~i~0 % 256 == 1); 24631#L72-1 assume !(mp_add_~i~0 % 256 == 2); 24630#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; 24629#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 24627#L76-1 assume !(mp_add_~i~0 % 256 == 0); 24625#L80-1 assume !(mp_add_~i~0 % 256 == 1); 24623#L81-1 assume !(mp_add_~i~0 % 256 == 2); 24621#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 24619#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 24617#L61-3 assume true; 24614#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; 24613#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24427#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24538#L71 assume !(mp_add_~i~0 % 256 == 0); 24539#L71-2 assume !(mp_add_~i~0 % 256 == 1); 24471#L72-1 assume !(mp_add_~i~0 % 256 == 2); 24473#L73-1 assume !(mp_add_~i~0 % 256 == 3); 24556#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24557#L76-1 assume !(mp_add_~i~0 % 256 == 0); 24450#L80-1 assume !(mp_add_~i~0 % 256 == 1); 24451#L81-1 assume !(mp_add_~i~0 % 256 == 2); 24443#L82-1 assume !(mp_add_~i~0 % 256 == 3); 24444#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 24610#L61-3 assume true; 24609#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; 24607#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24608#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24606#L71 assume !(mp_add_~i~0 % 256 == 0); 24535#L71-2 assume !(mp_add_~i~0 % 256 == 1); 24537#L72-1 assume !(mp_add_~i~0 % 256 == 2); 24456#L73-1 assume !(mp_add_~i~0 % 256 == 3); 24457#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24452#L76-1 assume !(mp_add_~i~0 % 256 == 0); 24453#L80-1 assume !(mp_add_~i~0 % 256 == 1); 24447#L81-1 assume !(mp_add_~i~0 % 256 == 2); 24449#L82-1 assume !(mp_add_~i~0 % 256 == 3); 24605#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 24604#L61-3 assume true; 24603#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; 24600#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24597#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24598#L65-2 assume !(mp_add_~i~0 % 256 == 1); 24592#L66-1 assume !(mp_add_~i~0 % 256 == 2); 24593#L67-1 assume !(mp_add_~i~0 % 256 == 3); 24588#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24589#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 24584#L71-2 assume !(mp_add_~i~0 % 256 == 1); 24585#L72-1 assume !(mp_add_~i~0 % 256 == 2); 24580#L73-1 assume !(mp_add_~i~0 % 256 == 3); 24581#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 24576#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 24577#L80-1 assume !(mp_add_~i~0 % 256 == 1); 24572#L81-1 assume !(mp_add_~i~0 % 256 == 2); 24573#L82-1 assume !(mp_add_~i~0 % 256 == 3); 24568#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 24569#L61-3 assume true; 24558#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; 24559#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24552#L65 [2018-11-10 11:36:09,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 9 times [2018-11-10 11:36:09,183 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:36:09,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:36:09,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:36:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:36:09,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:09,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1743890887, now seen corresponding path program 1 times [2018-11-10 11:36:09,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:36:09,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:36:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:36:09,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,277 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 158 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 11:36:09,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:09,277 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:36:09,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:09,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:36:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 141 proven. 7 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 11:36:09,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:36:09,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2018-11-10 11:36:09,345 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:36:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 11:36:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-10 11:36:09,346 INFO L87 Difference]: Start difference. First operand 1063 states and 1300 transitions. cyclomatic complexity: 244 Second operand 12 states. [2018-11-10 11:36:35,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:36:35,651 INFO L93 Difference]: Finished difference Result 2179 states and 2540 transitions. [2018-11-10 11:36:35,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-10 11:36:35,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2179 states and 2540 transitions. [2018-11-10 11:36:35,657 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1669 [2018-11-10 11:36:35,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2179 states to 2148 states and 2509 transitions. [2018-11-10 11:36:35,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2148 [2018-11-10 11:36:35,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2148 [2018-11-10 11:36:35,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2148 states and 2509 transitions. [2018-11-10 11:36:35,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:36:35,664 INFO L705 BuchiCegarLoop]: Abstraction has 2148 states and 2509 transitions. [2018-11-10 11:36:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states and 2509 transitions. [2018-11-10 11:36:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1362. [2018-11-10 11:36:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2018-11-10 11:36:35,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1632 transitions. [2018-11-10 11:36:35,684 INFO L728 BuchiCegarLoop]: Abstraction has 1362 states and 1632 transitions. [2018-11-10 11:36:35,684 INFO L608 BuchiCegarLoop]: Abstraction has 1362 states and 1632 transitions. [2018-11-10 11:36:35,684 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 11:36:35,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1362 states and 1632 transitions. [2018-11-10 11:36:35,687 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1061 [2018-11-10 11:36:35,687 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:36:35,687 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:36:35,688 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:35,688 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:36:35,688 INFO L793 eck$LassoCheckResult]: Stem: 27511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 27482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 27479#L40 assume !(mp_add_~a3~0 % 256 == 0); 27476#L40-1 mp_add_~nb~0 := 4; 27477#L50 assume !(mp_add_~b3~0 % 256 == 0); 27502#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 27503#L61-3 assume true; 28646#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; 28644#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28641#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28642#L65-2 assume !(mp_add_~i~0 % 256 == 1); 27514#L66-1 assume !(mp_add_~i~0 % 256 == 2); 27515#L67-1 assume !(mp_add_~i~0 % 256 == 3); 28709#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28708#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28707#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28706#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28705#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28704#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28703#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 28702#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28701#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28687#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28686#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28684#L61-3 assume true; 28661#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; 28659#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27489#L65 [2018-11-10 11:36:35,689 INFO L795 eck$LassoCheckResult]: Loop: 27489#L65 assume !(mp_add_~i~0 % 256 == 0); 27490#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; 28148#L66-1 assume !(mp_add_~i~0 % 256 == 2); 28640#L67-1 assume !(mp_add_~i~0 % 256 == 3); 28639#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28605#L71 assume !(mp_add_~i~0 % 256 == 0); 28603#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; 28602#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28601#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28599#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28598#L76-1 assume !(mp_add_~i~0 % 256 == 0); 28597#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 28596#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28595#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28593#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28591#L61-3 assume true; 28588#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; 28589#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28575#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28572#L71 assume !(mp_add_~i~0 % 256 == 0); 28560#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28553#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; 28551#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28552#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28562#L76-1 assume !(mp_add_~i~0 % 256 == 0); 28816#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28815#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 28814#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28813#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28812#L61-3 assume true; 28811#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; 28511#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28512#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28507#L71 assume !(mp_add_~i~0 % 256 == 0); 28508#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28504#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28503#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; 28502#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28449#L76-1 assume !(mp_add_~i~0 % 256 == 0); 28501#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28500#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28499#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 28498#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28470#L61-3 assume true; 28442#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; 28379#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28374#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28375#L71 assume !(mp_add_~i~0 % 256 == 0); 28368#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28369#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28300#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28299#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28298#L76-1 assume !(mp_add_~i~0 % 256 == 0); 28296#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28297#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28208#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28207#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28206#L61-3 assume true; 28204#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; 28201#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28198#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28197#L71 assume !(mp_add_~i~0 % 256 == 0); 28196#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28195#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28194#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28193#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28192#L76-1 assume !(mp_add_~i~0 % 256 == 0); 28190#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28191#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28188#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28187#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28186#L61-3 assume true; 28184#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; 28181#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28177#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28178#L71 assume !(mp_add_~i~0 % 256 == 0); 28173#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28174#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28169#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28170#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28165#L76-1 assume !(mp_add_~i~0 % 256 == 0); 28166#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28798#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28160#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28159#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28157#L61-3 assume true; 28154#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; 28155#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28141#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28142#L71 assume !(mp_add_~i~0 % 256 == 0); 28132#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28134#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28123#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28125#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 28119#L76-1 assume !(mp_add_~i~0 % 256 == 0); 28120#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28799#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28163#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28158#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28156#L61-3 assume true; 28153#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; 28150#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28151#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28638#L65-2 assume !(mp_add_~i~0 % 256 == 1); 28637#L66-1 assume !(mp_add_~i~0 % 256 == 2); 28636#L67-1 assume !(mp_add_~i~0 % 256 == 3); 28635#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28634#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28633#L71-2 assume !(mp_add_~i~0 % 256 == 1); 28632#L72-1 assume !(mp_add_~i~0 % 256 == 2); 28631#L73-1 assume !(mp_add_~i~0 % 256 == 3); 28629#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28628#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 28627#L80-1 assume !(mp_add_~i~0 % 256 == 1); 28626#L81-1 assume !(mp_add_~i~0 % 256 == 2); 28625#L82-1 assume !(mp_add_~i~0 % 256 == 3); 28624#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 28623#L61-3 assume true; 28622#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; 28621#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27489#L65 [2018-11-10 11:36:35,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash -2056085192, now seen corresponding path program 10 times [2018-11-10 11:36:35,689 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:36:35,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:36:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:35,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:36:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:35,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:36:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:36:35,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:36:35,701 INFO L82 PathProgramCache]: Analyzing trace with hash 254894849, now seen corresponding path program 2 times [2018-11-10 11:36:35,702 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:36:35,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:36:35,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:35,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:36:35,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:36:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:36:47,924 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 252 proven. 120 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 11:36:47,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:36:47,924 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:36:47,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:36:47,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 11:36:47,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:36:47,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:36:48,511 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-10 11:36:48,777 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-10 11:36:49,054 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 11:36:49,339 WARN L179 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 11:36:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-11-10 11:36:49,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:36:49,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2018-11-10 11:36:49,785 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:36:49,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 11:36:49,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=215, Unknown=3, NotChecked=0, Total=272 [2018-11-10 11:36:49,785 INFO L87 Difference]: Start difference. First operand 1362 states and 1632 transitions. cyclomatic complexity: 278 Second operand 17 states. [2018-11-10 11:36:51,628 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 24 [2018-11-10 11:36:51,926 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-10 11:36:55,718 WARN L179 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-11-10 11:36:56,053 WARN L179 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 11:36:56,602 WARN L179 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 11:36:57,804 WARN L179 SmtUtils]: Spent 613.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-10 11:37:00,968 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-10 11:37:03,038 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 11:37:05,202 WARN L179 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 11:37:06,294 WARN L179 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 11:37:07,230 WARN L179 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2018-11-10 11:37:21,189 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-10 11:37:22,188 WARN L179 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-10 11:37:22,945 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-10 11:37:23,275 WARN L179 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 11:37:24,492 WARN L179 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-10 11:37:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:37:25,186 INFO L93 Difference]: Finished difference Result 1959 states and 2182 transitions. [2018-11-10 11:37:25,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-10 11:37:25,187 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1959 states and 2182 transitions. [2018-11-10 11:37:25,193 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1290 [2018-11-10 11:37:25,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1959 states to 1669 states and 1808 transitions. [2018-11-10 11:37:25,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1669 [2018-11-10 11:37:25,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1669 [2018-11-10 11:37:25,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1669 states and 1808 transitions. [2018-11-10 11:37:25,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:37:25,199 INFO L705 BuchiCegarLoop]: Abstraction has 1669 states and 1808 transitions. [2018-11-10 11:37:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states and 1808 transitions. [2018-11-10 11:37:25,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1020. [2018-11-10 11:37:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2018-11-10 11:37:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1116 transitions. [2018-11-10 11:37:25,212 INFO L728 BuchiCegarLoop]: Abstraction has 1020 states and 1116 transitions. [2018-11-10 11:37:25,212 INFO L608 BuchiCegarLoop]: Abstraction has 1020 states and 1116 transitions. [2018-11-10 11:37:25,212 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 11:37:25,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1020 states and 1116 transitions. [2018-11-10 11:37:25,214 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 844 [2018-11-10 11:37:25,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:37:25,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:37:25,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:37:25,215 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:37:25,216 INFO L793 eck$LassoCheckResult]: Stem: 31322#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 31301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 31298#L40 assume !(mp_add_~a3~0 % 256 == 0); 31295#L40-1 mp_add_~nb~0 := 4; 31296#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31318#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31305#L54 assume !(mp_add_~b1~0 % 256 == 0); 31306#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 31645#L61-3 assume true; 31637#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; 31638#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31631#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 31630#L65-2 [2018-11-10 11:37:25,216 INFO L795 eck$LassoCheckResult]: Loop: 31630#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31629#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31628#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31627#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31626#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 31625#L71-2 assume !(mp_add_~i~0 % 256 == 1); 31624#L72-1 assume !(mp_add_~i~0 % 256 == 2); 31623#L73-1 assume !(mp_add_~i~0 % 256 == 3); 31622#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31621#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 31620#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31619#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31618#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31617#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31616#L61-3 assume true; 31615#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; 31614#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31613#L65 assume !(mp_add_~i~0 % 256 == 0); 31611#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; 31612#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31870#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31869#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31868#L71 assume !(mp_add_~i~0 % 256 == 0); 31867#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; 31866#L72-1 assume !(mp_add_~i~0 % 256 == 2); 31865#L73-1 assume !(mp_add_~i~0 % 256 == 3); 31863#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31862#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31861#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 31860#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31859#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31858#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31857#L61-3 assume true; 31856#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; 31855#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31854#L65 assume !(mp_add_~i~0 % 256 == 0); 31853#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31852#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; 31851#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31850#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31848#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31847#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31846#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31845#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 31844#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31843#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31842#L61-3 assume true; 31841#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; 31840#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31839#L65 assume !(mp_add_~i~0 % 256 == 0); 31838#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31837#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31836#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; 31835#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31833#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31831#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31829#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31827#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31825#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 31649#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31823#L61-3 assume true; 31821#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; 31819#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31817#L65 assume !(mp_add_~i~0 % 256 == 0); 31815#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31813#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31744#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31743#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31742#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 31741#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31740#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31739#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31738#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31737#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31736#L61-3 assume true; 31735#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; 31734#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31733#L65 assume !(mp_add_~i~0 % 256 == 0); 31732#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31731#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31730#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31729#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31728#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 31727#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31726#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31725#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31724#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31723#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31722#L61-3 assume true; 31721#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; 31720#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31719#L65 assume !(mp_add_~i~0 % 256 == 0); 31718#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31717#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31716#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31715#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31714#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 31713#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31712#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31711#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31710#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31709#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31708#L61-3 assume true; 31707#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; 31706#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31705#L65 assume !(mp_add_~i~0 % 256 == 0); 31704#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31703#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31702#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31701#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31700#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 31699#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31698#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31697#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31696#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31695#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31694#L61-3 assume true; 31693#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; 31692#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31691#L65 assume !(mp_add_~i~0 % 256 == 0); 31690#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31689#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31688#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31687#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31686#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 31685#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31684#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31683#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31682#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31681#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31680#L61-3 assume true; 31679#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; 31678#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31677#L65 assume !(mp_add_~i~0 % 256 == 0); 31674#L65-2 assume !(mp_add_~i~0 % 256 == 1); 31670#L66-1 assume !(mp_add_~i~0 % 256 == 2); 31666#L67-1 assume !(mp_add_~i~0 % 256 == 3); 31664#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31662#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 31660#L76-1 assume !(mp_add_~i~0 % 256 == 0); 31656#L80-1 assume !(mp_add_~i~0 % 256 == 1); 31652#L81-1 assume !(mp_add_~i~0 % 256 == 2); 31648#L82-1 assume !(mp_add_~i~0 % 256 == 3); 31646#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 31641#L61-3 assume true; 31642#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; 31633#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31634#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 31630#L65-2 [2018-11-10 11:37:25,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:37:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -307960871, now seen corresponding path program 1 times [2018-11-10 11:37:25,216 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:37:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:37:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:25,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:37:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:37:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:37:25,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:37:25,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1563854419, now seen corresponding path program 1 times [2018-11-10 11:37:25,228 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:37:25,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:37:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:25,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:37:25,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:37:25,421 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 303 proven. 276 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-10 11:37:25,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:37:25,422 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:37:25,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:37:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:37:25,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:37:25,961 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-10 11:37:26,320 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-10 11:37:26,727 WARN L179 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-10 11:37:27,771 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 11:37:27,906 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 172 proven. 104 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2018-11-10 11:37:27,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:37:27,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2018-11-10 11:37:27,922 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 11:37:27,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 11:37:27,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2018-11-10 11:37:27,922 INFO L87 Difference]: Start difference. First operand 1020 states and 1116 transitions. cyclomatic complexity: 102 Second operand 19 states. [2018-11-10 11:37:28,446 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-10 11:37:34,410 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 35 [2018-11-10 11:37:34,813 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-11-10 11:37:35,787 WARN L179 SmtUtils]: Spent 950.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-11-10 11:37:37,179 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-10 11:37:38,900 WARN L179 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 60 DAG size of output: 43 [2018-11-10 11:37:40,871 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-11-10 11:37:42,753 WARN L179 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-11-10 11:37:46,782 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-11-10 11:37:48,461 WARN L179 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-10 11:37:49,930 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-11-10 11:37:50,703 WARN L179 SmtUtils]: Spent 629.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 29 [2018-11-10 11:37:51,548 WARN L179 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-11-10 11:37:54,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:37:54,636 INFO L93 Difference]: Finished difference Result 1156 states and 1198 transitions. [2018-11-10 11:37:54,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-10 11:37:54,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1156 states and 1198 transitions. [2018-11-10 11:37:54,640 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 88 [2018-11-10 11:37:54,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1156 states to 1156 states and 1198 transitions. [2018-11-10 11:37:54,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1156 [2018-11-10 11:37:54,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1156 [2018-11-10 11:37:54,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1156 states and 1198 transitions. [2018-11-10 11:37:54,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:37:54,642 INFO L705 BuchiCegarLoop]: Abstraction has 1156 states and 1198 transitions. [2018-11-10 11:37:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states and 1198 transitions. [2018-11-10 11:37:54,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 367. [2018-11-10 11:37:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-11-10 11:37:54,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 389 transitions. [2018-11-10 11:37:54,648 INFO L728 BuchiCegarLoop]: Abstraction has 367 states and 389 transitions. [2018-11-10 11:37:54,648 INFO L608 BuchiCegarLoop]: Abstraction has 367 states and 389 transitions. [2018-11-10 11:37:54,648 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 11:37:54,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 367 states and 389 transitions. [2018-11-10 11:37:54,649 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-10 11:37:54,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:37:54,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:37:54,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 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, 1] [2018-11-10 11:37:54,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:37:54,650 INFO L793 eck$LassoCheckResult]: Stem: 34041#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 34021#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 34018#L40 assume !(mp_add_~a3~0 % 256 == 0); 34015#L40-1 mp_add_~nb~0 := 4; 34016#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34039#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34025#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34027#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34106#L61-3 assume true; 34105#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; 34104#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34103#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34102#L65-2 assume !(mp_add_~i~0 % 256 == 1); 34101#L66-1 assume !(mp_add_~i~0 % 256 == 2); 34100#L67-1 assume !(mp_add_~i~0 % 256 == 3); 34099#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34042#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34043#L71-2 assume !(mp_add_~i~0 % 256 == 1); 34286#L72-1 assume !(mp_add_~i~0 % 256 == 2); 34327#L73-1 assume !(mp_add_~i~0 % 256 == 3); 34325#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34326#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 34339#L80-1 assume !(mp_add_~i~0 % 256 == 1); 34338#L81-1 assume !(mp_add_~i~0 % 256 == 2); 34337#L82-1 assume !(mp_add_~i~0 % 256 == 3); 34336#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 34335#L61-3 assume true; 34334#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; 34333#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34332#L65 assume !(mp_add_~i~0 % 256 == 0); 34331#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; 34330#L66-1 assume !(mp_add_~i~0 % 256 == 2); 34329#L67-1 assume !(mp_add_~i~0 % 256 == 3); 34328#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34309#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34310#L76-1 assume !(mp_add_~i~0 % 256 == 0); 34305#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 34306#L81-1 assume !(mp_add_~i~0 % 256 == 2); 34301#L82-1 assume !(mp_add_~i~0 % 256 == 3); 34302#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 34297#L61-3 assume true; 34298#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; 34293#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34294#L65 assume !(mp_add_~i~0 % 256 == 0); 34289#L65-2 assume !(mp_add_~i~0 % 256 == 1); 34290#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; 34345#L67-1 assume !(mp_add_~i~0 % 256 == 3); 34342#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34020#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34356#L76-1 assume !(mp_add_~i~0 % 256 == 0); 34355#L80-1 assume !(mp_add_~i~0 % 256 == 1); 34354#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 34353#L82-1 assume !(mp_add_~i~0 % 256 == 3); 34352#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 34351#L61-3 assume true; 34350#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; 34349#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34348#L65 assume !(mp_add_~i~0 % 256 == 0); 34347#L65-2 assume !(mp_add_~i~0 % 256 == 1); 34346#L66-1 assume !(mp_add_~i~0 % 256 == 2); 34343#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; 34344#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34340#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34341#L76-1 assume !(mp_add_~i~0 % 256 == 0); 34374#L80-1 assume !(mp_add_~i~0 % 256 == 1); 34373#L81-1 assume !(mp_add_~i~0 % 256 == 2); 34372#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 34014#L83-1 [2018-11-10 11:37:54,651 INFO L795 eck$LassoCheckResult]: Loop: 34014#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 34031#L61-3 assume true; 34032#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; 34035#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34028#L65 assume !(mp_add_~i~0 % 256 == 0); 34022#L65-2 assume !(mp_add_~i~0 % 256 == 1); 34023#L66-1 assume !(mp_add_~i~0 % 256 == 2); 34029#L67-1 assume !(mp_add_~i~0 % 256 == 3); 34030#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34033#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34024#L76-1 assume !(mp_add_~i~0 % 256 == 0); 34009#L80-1 assume !(mp_add_~i~0 % 256 == 1); 34010#L81-1 assume !(mp_add_~i~0 % 256 == 2); 34013#L82-1 assume !(mp_add_~i~0 % 256 == 3); 34014#L83-1 [2018-11-10 11:37:54,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:37:54,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1508691391, now seen corresponding path program 1 times [2018-11-10 11:37:54,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:37:54,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:37:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:37:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:37:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:37:54,733 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 11:37:54,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:37:54,734 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:37:54,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:37:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:37:54,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 55 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 11:38:02,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:38:02,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 11:38:02,064 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:38:02,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:02,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1506597377, now seen corresponding path program 1 times [2018-11-10 11:38:02,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:38:02,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:38:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:02,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:02,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:02,116 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:38:02,116 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:38:02,116 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:38:02,116 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:38:02,116 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:38:02,116 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:02,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:38:02,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:38:02,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration20_Loop [2018-11-10 11:38:02,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:38:02,116 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:38:02,117 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 11:38:02,123 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 11:38:02,265 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:38:02,266 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:38:02,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:38:02,269 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:38:02,274 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:38:02,274 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_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:02,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:38:02,292 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:38:02,342 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:38:02,342 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:38:03,467 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:38:03,469 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:38:03,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:38:03,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:38:03,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:38:03,469 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:38:03,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:03,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:38:03,469 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:38:03,469 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration20_Loop [2018-11-10 11:38:03,469 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:38:03,469 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:38:03,470 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 11:38:03,492 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 11:38:03,632 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:38:03,632 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:38:03,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:38:03,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:38:03,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:38:03,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:38:03,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,635 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,636 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:38:03,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 11:38:03,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,636 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:03,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:03,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,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 11:38:03,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,639 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:03,640 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:03,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,640 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:38:03,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:03,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:03,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:03,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:03,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,646 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:38:03,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 11:38:03,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,647 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:03,648 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:03,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,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 11:38:03,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:03,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,652 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:03,652 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:03,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,653 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:38:03,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 11:38:03,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,654 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:03,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,654 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:03,655 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:03,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,659 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:03,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,660 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:03,660 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:03,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,661 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:38:03,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,662 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:38:03,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,662 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:03,663 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:03,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,670 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:38:03,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,671 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:03,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:03,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,673 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:38:03,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,673 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:03,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,674 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:03,676 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:03,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,689 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:03,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,689 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:03,691 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:03,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,692 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:38:03,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,692 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,692 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:03,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:03,693 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:03,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,698 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:03,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:03,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:03,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,701 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:38:03,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,701 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:03,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,702 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:38:03,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:38:03,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:03,713 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:03,713 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:03,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:03,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:03,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:03,713 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:38:03,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:38:03,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:03,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 11:38:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 11:38:03,718 INFO L87 Difference]: Start difference. First operand 367 states and 389 transitions. cyclomatic complexity: 25 Second operand 7 states. [2018-11-10 11:38:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:04,068 INFO L93 Difference]: Finished difference Result 505 states and 529 transitions. [2018-11-10 11:38:04,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 11:38:04,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 505 states and 529 transitions. [2018-11-10 11:38:04,070 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-10 11:38:04,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 505 states to 505 states and 529 transitions. [2018-11-10 11:38:04,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2018-11-10 11:38:04,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505 [2018-11-10 11:38:04,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 505 states and 529 transitions. [2018-11-10 11:38:04,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:38:04,071 INFO L705 BuchiCegarLoop]: Abstraction has 505 states and 529 transitions. [2018-11-10 11:38:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states and 529 transitions. [2018-11-10 11:38:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 354. [2018-11-10 11:38:04,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-10 11:38:04,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 376 transitions. [2018-11-10 11:38:04,075 INFO L728 BuchiCegarLoop]: Abstraction has 354 states and 376 transitions. [2018-11-10 11:38:04,075 INFO L608 BuchiCegarLoop]: Abstraction has 354 states and 376 transitions. [2018-11-10 11:38:04,075 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 11:38:04,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 376 transitions. [2018-11-10 11:38:04,076 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-10 11:38:04,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:38:04,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:38:04,077 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 11:38:04,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:04,078 INFO L793 eck$LassoCheckResult]: Stem: 35124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 35106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 35103#L40 assume !(mp_add_~a3~0 % 256 == 0); 35099#L40-1 mp_add_~nb~0 := 4; 35100#L50 assume mp_add_~b3~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 35121#L52 assume mp_add_~b2~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 35108#L54 assume mp_add_~b1~0 % 256 == 0;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 35110#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 35117#L61-3 assume true; 35179#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; 35178#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35177#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 35176#L65-2 assume !(mp_add_~i~0 % 256 == 1); 35175#L66-1 assume !(mp_add_~i~0 % 256 == 2); 35174#L67-1 assume !(mp_add_~i~0 % 256 == 3); 35173#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35172#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 35093#L71-2 assume !(mp_add_~i~0 % 256 == 1); 35094#L72-1 assume !(mp_add_~i~0 % 256 == 2); 35101#L73-1 assume !(mp_add_~i~0 % 256 == 3); 35102#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35426#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 35425#L80-1 assume !(mp_add_~i~0 % 256 == 1); 35424#L81-1 assume !(mp_add_~i~0 % 256 == 2); 35423#L82-1 assume !(mp_add_~i~0 % 256 == 3); 35422#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 35421#L61-3 assume true; 35118#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; 35119#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35420#L65 assume !(mp_add_~i~0 % 256 == 0); 35419#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; 35125#L66-1 assume !(mp_add_~i~0 % 256 == 2); 35126#L67-1 assume !(mp_add_~i~0 % 256 == 3); 35418#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35417#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35410#L76-1 assume !(mp_add_~i~0 % 256 == 0); 35416#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 35415#L81-1 assume !(mp_add_~i~0 % 256 == 2); 35414#L82-1 assume !(mp_add_~i~0 % 256 == 3); 35413#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 35412#L61-3 assume true; 35402#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; 35400#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35398#L65 assume !(mp_add_~i~0 % 256 == 0); 35396#L65-2 assume !(mp_add_~i~0 % 256 == 1); 35394#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; 35392#L67-1 assume !(mp_add_~i~0 % 256 == 3); 35390#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35388#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35385#L76-1 assume !(mp_add_~i~0 % 256 == 0); 35384#L80-1 assume !(mp_add_~i~0 % 256 == 1); 35383#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 35382#L82-1 assume !(mp_add_~i~0 % 256 == 3); 35381#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 35380#L61-3 assume true; 35379#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; 35378#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35377#L65 assume !(mp_add_~i~0 % 256 == 0); 35376#L65-2 assume !(mp_add_~i~0 % 256 == 1); 35375#L66-1 assume !(mp_add_~i~0 % 256 == 2); 35373#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; 35374#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35432#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35430#L76-1 assume !(mp_add_~i~0 % 256 == 0); 35429#L80-1 assume !(mp_add_~i~0 % 256 == 1); 35428#L81-1 assume !(mp_add_~i~0 % 256 == 2); 35427#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 35096#L83-1 [2018-11-10 11:38:04,078 INFO L795 eck$LassoCheckResult]: Loop: 35096#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 35114#L61-3 assume true; 35115#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; 35123#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35111#L65 assume !(mp_add_~i~0 % 256 == 0); 35104#L65-2 assume !(mp_add_~i~0 % 256 == 1); 35105#L66-1 assume !(mp_add_~i~0 % 256 == 2); 35112#L67-1 assume !(mp_add_~i~0 % 256 == 3); 35113#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35116#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35107#L76-1 assume !(mp_add_~i~0 % 256 == 0); 35091#L80-1 assume !(mp_add_~i~0 % 256 == 1); 35092#L81-1 assume !(mp_add_~i~0 % 256 == 2); 35095#L82-1 assume !(mp_add_~i~0 % 256 == 3); 35096#L83-1 [2018-11-10 11:38:04,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:04,078 INFO L82 PathProgramCache]: Analyzing trace with hash 671857223, now seen corresponding path program 1 times [2018-11-10 11:38:04,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:38:04,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:38:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:04,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:04,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:04,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1506597377, now seen corresponding path program 2 times [2018-11-10 11:38:04,107 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:38:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:38:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:04,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:04,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:04,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:04,117 INFO L82 PathProgramCache]: Analyzing trace with hash 264905159, now seen corresponding path program 2 times [2018-11-10 11:38:04,117 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:38:04,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:38:04,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:04,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:04,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:04,391 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 11:38:04,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:04,391 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:38:04,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 11:38:04,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-10 11:38:04,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 11:38:04,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:04,508 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 11:38:04,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:38:04,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2018-11-10 11:38:04,570 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:38:04,570 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:38:04,570 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:38:04,570 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:38:04,570 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:38:04,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:04,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:38:04,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:38:04,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration21_Loop [2018-11-10 11:38:04,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:38:04,570 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:38:04,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:38:04,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 11:38:04,691 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-10 11:38:04,750 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:38:04,751 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/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 11:38:04,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:38:04,756 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:04,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:38:04,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:38:06,294 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:38:06,296 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:38:06,296 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:38:06,296 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:38:06,296 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:38:06,296 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:38:06,296 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:06,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:38:06,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:38:06,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration21_Loop [2018-11-10 11:38:06,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:38:06,296 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:38:06,297 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 11:38:06,302 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 11:38:06,481 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:38:06,481 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:38:06,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:38:06,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:38:06,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:38:06,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:38:06,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,485 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:38:06,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:06,486 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:06,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,488 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:06,488 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:06,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,490 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:38:06,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:06,492 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:06,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,493 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:06,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:06,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,496 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:38:06,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:06,498 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:06,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:06,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,499 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:06,500 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:06,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,503 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:38:06,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,504 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:06,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,504 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:06,505 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:06,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,506 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:06,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,506 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:06,507 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:06,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,510 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:38:06,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 11:38:06,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,511 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:38:06,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:06,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:06,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,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 11:38:06,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,514 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:38:06,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,515 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:06,516 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:06,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,523 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:38:06,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,524 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:06,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,524 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:06,525 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:06,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,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 11:38:06,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,527 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:06,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,527 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:06,529 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:06,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,538 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:38:06,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,538 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,538 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:06,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,539 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:06,539 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:06,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,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 11:38:06,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,542 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:06,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,542 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:06,543 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:06,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,548 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:38:06,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,549 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,549 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:06,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,549 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:38:06,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:38:06,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:06,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:06,554 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:06,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:06,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:06,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:06,554 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:38:06,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:38:06,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:06,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 11:38:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-10 11:38:06,564 INFO L87 Difference]: Start difference. First operand 354 states and 376 transitions. cyclomatic complexity: 25 Second operand 15 states. [2018-11-10 11:38:07,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:07,440 INFO L93 Difference]: Finished difference Result 315 states and 331 transitions. [2018-11-10 11:38:07,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 11:38:07,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 315 states and 331 transitions. [2018-11-10 11:38:07,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 11:38:07,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 315 states to 132 states and 139 transitions. [2018-11-10 11:38:07,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2018-11-10 11:38:07,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-11-10 11:38:07,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 139 transitions. [2018-11-10 11:38:07,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:38:07,443 INFO L705 BuchiCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-11-10 11:38:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states and 139 transitions. [2018-11-10 11:38:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2018-11-10 11:38:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-10 11:38:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2018-11-10 11:38:07,444 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-11-10 11:38:07,444 INFO L608 BuchiCegarLoop]: Abstraction has 105 states and 111 transitions. [2018-11-10 11:38:07,445 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 11:38:07,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 111 transitions. [2018-11-10 11:38:07,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-10 11:38:07,445 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 11:38:07,445 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 11:38:07,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:07,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:38:07,446 INFO L793 eck$LassoCheckResult]: Stem: 36064#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 36063#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~0 := 234770789;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; 36059#L40 assume !(mp_add_~a3~0 % 256 == 0); 36056#L40-1 mp_add_~nb~0 := 4; 36057#L50 assume !(mp_add_~b3~0 % 256 == 0); 36051#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 36052#L61-3 assume true; 36073#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; 36072#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36070#L65 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 36071#L65-2 assume !(mp_add_~i~0 % 256 == 1); 36092#L66-1 assume !(mp_add_~i~0 % 256 == 2); 36091#L67-1 assume !(mp_add_~i~0 % 256 == 3); 36090#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36089#L71 assume mp_add_~i~0 % 256 == 0;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 36088#L71-2 assume !(mp_add_~i~0 % 256 == 1); 36087#L72-1 assume !(mp_add_~i~0 % 256 == 2); 36086#L73-1 assume !(mp_add_~i~0 % 256 == 3); 36085#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36084#L76-1 assume mp_add_~i~0 % 256 == 0;mp_add_~r0~0 := mp_add_~partial_sum~0; 36083#L80-1 assume !(mp_add_~i~0 % 256 == 1); 36082#L81-1 assume !(mp_add_~i~0 % 256 == 2); 36081#L82-1 assume !(mp_add_~i~0 % 256 == 3); 36080#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 36079#L61-3 assume true; 36078#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; 36077#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36076#L65 assume !(mp_add_~i~0 % 256 == 0); 36060#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; 36061#L66-1 assume !(mp_add_~i~0 % 256 == 2); 36067#L67-1 assume !(mp_add_~i~0 % 256 == 3); 36127#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36126#L71 assume !(mp_add_~i~0 % 256 == 0); 36125#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; 36124#L72-1 assume !(mp_add_~i~0 % 256 == 2); 36123#L73-1 assume !(mp_add_~i~0 % 256 == 3); 36122#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36114#L76-1 assume !(mp_add_~i~0 % 256 == 0); 36112#L80-1 assume mp_add_~i~0 % 256 == 1;mp_add_~r1~0 := mp_add_~partial_sum~0; 36110#L81-1 assume !(mp_add_~i~0 % 256 == 2); 36108#L82-1 assume !(mp_add_~i~0 % 256 == 3); 36106#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 36103#L61-3 assume true; 36100#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; 36097#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36065#L65 assume !(mp_add_~i~0 % 256 == 0); 36066#L65-2 assume !(mp_add_~i~0 % 256 == 1); 36095#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; 36096#L67-1 assume !(mp_add_~i~0 % 256 == 3); 36121#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36120#L71 assume !(mp_add_~i~0 % 256 == 0); 36119#L71-2 assume !(mp_add_~i~0 % 256 == 1); 36118#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; 36117#L73-1 assume !(mp_add_~i~0 % 256 == 3); 36115#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 36116#L76-1 assume !(mp_add_~i~0 % 256 == 0); 36139#L80-1 assume !(mp_add_~i~0 % 256 == 1); 36138#L81-1 assume mp_add_~i~0 % 256 == 2;mp_add_~r2~0 := mp_add_~partial_sum~0; 36137#L82-1 assume !(mp_add_~i~0 % 256 == 3); 36136#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 36101#L61-3 assume true; 36102#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; 36093#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36069#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36141#L71 assume !(mp_add_~i~0 % 256 == 0); 36140#L71-2 assume !(mp_add_~i~0 % 256 == 1); 36130#L72-1 assume !(mp_add_~i~0 % 256 == 2); 36129#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; 36128#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36048#L76-1 assume !(mp_add_~i~0 % 256 == 0); 36040#L80-1 assume !(mp_add_~i~0 % 256 == 1); 36041#L81-1 assume !(mp_add_~i~0 % 256 == 2); 36046#L82-1 assume mp_add_~i~0 % 256 == 3;mp_add_~r3~0 := mp_add_~partial_sum~0; 36050#L83-1 [2018-11-10 11:38:07,446 INFO L795 eck$LassoCheckResult]: Loop: 36050#L83-1 mp_add_~i~0 := mp_add_~i~0 % 256 + 1; 36042#L61-3 assume true; 36043#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; 36053#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36062#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36054#L71 assume !(mp_add_~i~0 % 256 == 0); 36044#L71-2 assume !(mp_add_~i~0 % 256 == 1); 36045#L72-1 assume !(mp_add_~i~0 % 256 == 2); 36055#L73-1 assume !(mp_add_~i~0 % 256 == 3); 36058#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36144#L76-1 assume !(mp_add_~i~0 % 256 == 0); 36143#L80-1 assume !(mp_add_~i~0 % 256 == 1); 36142#L81-1 assume !(mp_add_~i~0 % 256 == 2); 36049#L82-1 assume !(mp_add_~i~0 % 256 == 3); 36050#L83-1 [2018-11-10 11:38:07,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:07,446 INFO L82 PathProgramCache]: Analyzing trace with hash -827663828, now seen corresponding path program 1 times [2018-11-10 11:38:07,446 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:38:07,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:38:07,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:07,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 11:38:07,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-10 11:38:07,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:38:07,528 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 11:38:07,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:38:07,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:38:07,576 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 11:38:07,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 11:38:07,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-10 11:38:07,594 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 11:38:07,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:38:07,594 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 1 times [2018-11-10 11:38:07,594 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 11:38:07,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 11:38:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:07,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:38:07,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:38:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 11:38:07,647 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:38:07,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:38:07,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:38:07,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:38:07,648 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 11:38:07,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:07,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:38:07,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:38:07,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2018-11-10 11:38:07,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:38:07,648 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:38:07,649 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 11:38:07,655 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 11:38:07,770 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:38:07,770 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:07,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:38:07,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:38:07,778 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 11:38:07,779 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_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:07,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 11:38:07,797 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6c7578e-0c91-4671-b3e6-c694af260379/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:07,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 11:38:07,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 11:38:09,069 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 11:38:09,071 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 11:38:09,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 11:38:09,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 11:38:09,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 11:38:09,071 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 11:38:09,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 11:38:09,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 11:38:09,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 11:38:09,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2018-11-10 11:38:09,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 11:38:09,072 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 11:38:09,072 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 11:38:09,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 11:38:09,190 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 11:38:09,190 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 11:38:09,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,191 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:38:09,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:38:09,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,192 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 11:38:09,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 11:38:09,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,193 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 11:38:09,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,194 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:09,194 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:09,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,194 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,195 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:09,195 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:09,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,197 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,197 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 11:38:09,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,198 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:09,198 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:09,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,199 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,199 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:09,200 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:09,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,201 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 11:38:09,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 11:38:09,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,202 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:09,203 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:09,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,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 11:38:09,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 11:38:09,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,204 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:09,205 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:09,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,208 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,208 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 11:38:09,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 11:38:09,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:09,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,209 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:09,210 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:09,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,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 11:38:09,211 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,211 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:09,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,211 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 11:38:09,212 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 11:38:09,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,215 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 11:38:09,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 11:38:09,216 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,216 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:38:09,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,216 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:09,217 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:09,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,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 11:38:09,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,219 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 11:38:09,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,220 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:09,221 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:09,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,227 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 11:38:09,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:09,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,228 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:09,230 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:09,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,230 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,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 11:38:09,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,231 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:09,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,232 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 11:38:09,234 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 11:38:09,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,241 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,241 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 11:38:09,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 11:38:09,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,242 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:09,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:09,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:09,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,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 11:38:09,245 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,245 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 11:38:09,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,246 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 11:38:09,246 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 11:38:09,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,251 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 11:38:09,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,251 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,252 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:09,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,252 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:38:09,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:38:09,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,256 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 11:38:09,256 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 11:38:09,257 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 11:38:09,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 11:38:09,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 11:38:09,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 11:38:09,257 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 11:38:09,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 11:38:09,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 11:38:09,268 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 11:38:09,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 11:38:09,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:38:09,269 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. cyclomatic complexity: 7 Second operand 8 states. [2018-11-10 11:38:09,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:38:09,413 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-10 11:38:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 11:38:09,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 95 transitions. [2018-11-10 11:38:09,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:38:09,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 0 states and 0 transitions. [2018-11-10 11:38:09,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 11:38:09,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 11:38:09,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 11:38:09,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 11:38:09,415 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:38:09,415 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:38:09,415 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:38:09,415 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 11:38:09,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:38:09,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 11:38:09,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 11:38:09,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 11:38:09 BoogieIcfgContainer [2018-11-10 11:38:09,422 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 11:38:09,422 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 11:38:09,422 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 11:38:09,422 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 11:38:09,423 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:34:29" (3/4) ... [2018-11-10 11:38:09,426 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 11:38:09,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 11:38:09,427 INFO L168 Benchmark]: Toolchain (without parser) took 220489.44 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 576.2 MB). Free memory was 960.8 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 412.7 MB. Max. memory is 11.5 GB. [2018-11-10 11:38:09,428 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:09,428 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 11:38:09,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.72 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:09,429 INFO L168 Benchmark]: Boogie Preprocessor took 16.15 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:09,429 INFO L168 Benchmark]: RCFGBuilder took 307.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -209.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-10 11:38:09,429 INFO L168 Benchmark]: BuchiAutomizer took 219932.66 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 395.8 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 425.6 MB. Max. memory is 11.5 GB. [2018-11-10 11:38:09,430 INFO L168 Benchmark]: Witness Printer took 4.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 11:38:09,432 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 200.41 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 944.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.72 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.15 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 307.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -209.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 219932.66 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 395.8 MB). Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 29.7 MB). Peak memory consumption was 425.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.25 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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 19 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 219.8s and 23 iterations. TraceHistogramMax:10. Analysis of lassos took 71.0s. Construction of modules took 58.0s. Büchi inclusion checks took 90.1s. Highest rank in rank-based complementation 0. Minimization of det autom 22. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 6674 StatesRemovedByMinimization, 20 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1714 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1060 SDtfs, 5652 SDslu, 2422 SDs, 0 SdLazy, 9567 SolverSat, 1233 SolverUnsat, 79 SolverUnknown, 0 SolverNotchecked, 58.0s Time LassoAnalysisResults: nont0 unkn0 SFLI10 SFLT0 conc2 concLT0 SILN0 SILU5 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital52 mio100 ax100 hnf97 lsp69 ukn100 mio100 lsp100 div564 bol100 ite100 ukn100 eq142 hnf42 smp80 dnf100 smp100 tf102 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 20.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forcibly destroying the process Received shutdown request...