./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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 889a23428ce9b0e3800ffce916f37e53fe302b49 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 10:48:09,619 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 10:48:09,620 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 10:48:09,629 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 10:48:09,629 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 10:48:09,630 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 10:48:09,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 10:48:09,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 10:48:09,632 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 10:48:09,633 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 10:48:09,633 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 10:48:09,633 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 10:48:09,634 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 10:48:09,635 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 10:48:09,635 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 10:48:09,636 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 10:48:09,636 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 10:48:09,637 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 10:48:09,639 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 10:48:09,640 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 10:48:09,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 10:48:09,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 10:48:09,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 10:48:09,643 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 10:48:09,643 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 10:48:09,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 10:48:09,644 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 10:48:09,645 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 10:48:09,645 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 10:48:09,646 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 10:48:09,646 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 10:48:09,647 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 10:48:09,647 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 10:48:09,647 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 10:48:09,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 10:48:09,648 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 10:48:09,649 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 10:48:09,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 10:48:09,657 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 10:48:09,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 10:48:09,659 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 10:48:09,659 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 10:48:09,659 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 10:48:09,659 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 10:48:09,659 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 10:48:09,659 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 10:48:09,660 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 10:48:09,660 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 10:48:09,660 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 10:48:09,660 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 10:48:09,660 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 10:48:09,660 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 10:48:09,660 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 10:48:09,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 10:48:09,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 10:48:09,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 10:48:09,661 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 10:48:09,661 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 10:48:09,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 10:48:09,662 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 10:48:09,662 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 10:48:09,662 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 10:48:09,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 10:48:09,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 10:48:09,662 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 10:48:09,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 10:48:09,663 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 10:48:09,663 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 10:48:09,663 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 10:48:09,664 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_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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 -> 889a23428ce9b0e3800ffce916f37e53fe302b49 [2018-11-28 10:48:09,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 10:48:09,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 10:48:09,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 10:48:09,703 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 10:48:09,704 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 10:48:09,704 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 10:48:09,757 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/data/9415165f4/589975b917744380bed6e6b95d77e7eb/FLAG622b1b31c [2018-11-28 10:48:10,111 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 10:48:10,112 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 10:48:10,116 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/data/9415165f4/589975b917744380bed6e6b95d77e7eb/FLAG622b1b31c [2018-11-28 10:48:10,128 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/data/9415165f4/589975b917744380bed6e6b95d77e7eb [2018-11-28 10:48:10,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 10:48:10,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 10:48:10,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:10,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 10:48:10,136 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 10:48:10,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7de6dd22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10, skipping insertion in model container [2018-11-28 10:48:10,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 10:48:10,165 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 10:48:10,308 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:10,312 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 10:48:10,340 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 10:48:10,354 INFO L195 MainTranslator]: Completed translation [2018-11-28 10:48:10,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10 WrapperNode [2018-11-28 10:48:10,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 10:48:10,355 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 10:48:10,355 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 10:48:10,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 10:48:10,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 10:48:10,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 10:48:10,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 10:48:10,430 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 10:48:10,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... [2018-11-28 10:48:10,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 10:48:10,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 10:48:10,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 10:48:10,449 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 10:48:10,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:10,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 10:48:10,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 10:48:10,725 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 10:48:10,725 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-28 10:48:10,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:10 BoogieIcfgContainer [2018-11-28 10:48:10,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 10:48:10,726 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 10:48:10,726 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 10:48:10,730 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 10:48:10,731 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:48:10,731 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 10:48:10" (1/3) ... [2018-11-28 10:48:10,732 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ee91800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:48:10, skipping insertion in model container [2018-11-28 10:48:10,732 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:48:10,732 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:48:10" (2/3) ... [2018-11-28 10:48:10,733 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ee91800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 10:48:10, skipping insertion in model container [2018-11-28 10:48:10,733 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 10:48:10,733 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:10" (3/3) ... [2018-11-28 10:48:10,737 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-28 10:48:10,781 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 10:48:10,781 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 10:48:10,782 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 10:48:10,782 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 10:48:10,782 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 10:48:10,782 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 10:48:10,782 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 10:48:10,782 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 10:48:10,782 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 10:48:10,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-28 10:48:10,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-28 10:48:10,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:10,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:10,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:48:10,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:10,819 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 10:48:10,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-28 10:48:10,822 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-28 10:48:10,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:10,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:10,823 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 10:48:10,823 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:10,829 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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 !(0 == mp_add_~a3~0 % 256); 8#L40-1true mp_add_~nb~0 := 4; 29#L50true assume !(0 == mp_add_~b3~0 % 256); 27#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-2true [2018-11-28 10:48:10,829 INFO L796 eck$LassoCheckResult]: Loop: 23#L61-2true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25#L70true assume !(mp_add_~partial_sum~0 % 65536 > 255); 13#L76-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22#L81-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23#L61-2true [2018-11-28 10:48:10,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2018-11-28 10:48:10,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:10,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:10,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:10,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:10,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:10,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:10,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:10,967 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2018-11-28 10:48:10,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:10,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:10,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:10,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:11,021 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-28 10:48:11,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:11,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:48:11,027 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:11,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:11,040 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-28 10:48:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:11,229 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2018-11-28 10:48:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:11,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2018-11-28 10:48:11,233 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-28 10:48:11,237 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2018-11-28 10:48:11,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-28 10:48:11,239 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-28 10:48:11,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2018-11-28 10:48:11,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:11,240 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2018-11-28 10:48:11,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2018-11-28 10:48:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-28 10:48:11,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 10:48:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2018-11-28 10:48:11,266 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-11-28 10:48:11,266 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-11-28 10:48:11,266 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 10:48:11,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2018-11-28 10:48:11,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-28 10:48:11,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:11,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:11,268 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:11,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:11,270 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 123#L40 assume !(0 == mp_add_~a3~0 % 256); 120#L40-1 mp_add_~nb~0 := 4; 121#L50 assume !(0 == mp_add_~b3~0 % 256); 131#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 138#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 139#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 136#L64-1 [2018-11-28 10:48:11,270 INFO L796 eck$LassoCheckResult]: Loop: 136#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 126#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 129#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 112#L80-1 assume !(1 == mp_add_~i~0 % 256); 113#L81-1 assume !(2 == mp_add_~i~0 % 256); 118#L82-1 assume !(3 == mp_add_~i~0 % 256); 119#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 143#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 159#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 160#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 127#L65-2 assume !(1 == mp_add_~i~0 % 256); 128#L66-1 assume !(2 == mp_add_~i~0 % 256); 135#L67-1 assume !(3 == mp_add_~i~0 % 256); 136#L64-1 [2018-11-28 10:48:11,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2018-11-28 10:48:11,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:11,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:11,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:11,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:11,459 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-28 10:48:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:11,460 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:48:11,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:11,460 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2018-11-28 10:48:11,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:11,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:11,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:11,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:11,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:11,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:11,542 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-28 10:48:11,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:11,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:11,543 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:48:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:11,544 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-28 10:48:12,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:12,146 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2018-11-28 10:48:12,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 10:48:12,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2018-11-28 10:48:12,152 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2018-11-28 10:48:12,155 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2018-11-28 10:48:12,155 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2018-11-28 10:48:12,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2018-11-28 10:48:12,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2018-11-28 10:48:12,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:12,158 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2018-11-28 10:48:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2018-11-28 10:48:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2018-11-28 10:48:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-28 10:48:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2018-11-28 10:48:12,171 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-11-28 10:48:12,171 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-11-28 10:48:12,171 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 10:48:12,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2018-11-28 10:48:12,174 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2018-11-28 10:48:12,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:12,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:12,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:12,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:12,178 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 410#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 412#L42 assume !(0 == mp_add_~a2~0 % 256); 406#L40-1 mp_add_~nb~0 := 4; 407#L50 assume !(0 == mp_add_~b3~0 % 256); 433#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 485#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 488#L64-1 [2018-11-28 10:48:12,179 INFO L796 eck$LassoCheckResult]: Loop: 488#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 492#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 417#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 418#L80-1 assume !(1 == mp_add_~i~0 % 256); 428#L81-1 assume !(2 == mp_add_~i~0 % 256); 404#L82-1 assume !(3 == mp_add_~i~0 % 256); 405#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 438#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 448#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 443#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 415#L65-2 assume !(1 == mp_add_~i~0 % 256); 416#L66-1 assume !(2 == mp_add_~i~0 % 256); 444#L67-1 assume !(3 == mp_add_~i~0 % 256); 488#L64-1 [2018-11-28 10:48:12,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2018-11-28 10:48:12,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:12,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:12,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:12,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:12,358 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-28 10:48:12,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:12,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 10:48:12,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:48:12,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2018-11-28 10:48:12,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:12,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:12,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:12,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:12,427 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-28 10:48:12,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:12,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:12,428 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:12,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:48:12,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:48:12,428 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2018-11-28 10:48:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:13,146 INFO L93 Difference]: Finished difference Result 373 states and 546 transitions. [2018-11-28 10:48:13,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 10:48:13,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 546 transitions. [2018-11-28 10:48:13,151 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 255 [2018-11-28 10:48:13,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 546 transitions. [2018-11-28 10:48:13,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2018-11-28 10:48:13,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-28 10:48:13,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 546 transitions. [2018-11-28 10:48:13,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:13,158 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 546 transitions. [2018-11-28 10:48:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 546 transitions. [2018-11-28 10:48:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 201. [2018-11-28 10:48:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-28 10:48:13,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2018-11-28 10:48:13,172 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-11-28 10:48:13,172 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-11-28 10:48:13,172 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 10:48:13,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 289 transitions. [2018-11-28 10:48:13,174 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2018-11-28 10:48:13,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:13,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:13,175 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:13,175 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:13,175 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 937#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 938#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 965#L44 assume !(0 == mp_add_~a1~0 % 256); 969#L40-1 mp_add_~nb~0 := 4; 988#L50 assume !(0 == mp_add_~b3~0 % 256); 985#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 983#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 984#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 951#L64-1 [2018-11-28 10:48:13,175 INFO L796 eck$LassoCheckResult]: Loop: 951#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 940#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 943#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 944#L80-1 assume !(1 == mp_add_~i~0 % 256); 1081#L81-1 assume !(2 == mp_add_~i~0 % 256); 931#L82-1 assume !(3 == mp_add_~i~0 % 256); 932#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 972#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 973#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 968#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 941#L65-2 assume !(1 == mp_add_~i~0 % 256); 942#L66-1 assume !(2 == mp_add_~i~0 % 256); 950#L67-1 assume !(3 == mp_add_~i~0 % 256); 951#L64-1 [2018-11-28 10:48:13,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:13,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1341941206, now seen corresponding path program 1 times [2018-11-28 10:48:13,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:13,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:13,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:13,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:13,365 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-28 10:48:13,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:13,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:13,366 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:48:13,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:13,366 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 3 times [2018-11-28 10:48:13,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:13,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:13,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:13,426 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-28 10:48:13,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:13,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:13,426 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:13,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:48:13,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:13,427 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. cyclomatic complexity: 93 Second operand 8 states. [2018-11-28 10:48:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:14,497 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2018-11-28 10:48:14,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 10:48:14,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 616 transitions. [2018-11-28 10:48:14,502 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 306 [2018-11-28 10:48:14,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 616 transitions. [2018-11-28 10:48:14,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2018-11-28 10:48:14,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2018-11-28 10:48:14,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 616 transitions. [2018-11-28 10:48:14,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:14,507 INFO L705 BuchiCegarLoop]: Abstraction has 418 states and 616 transitions. [2018-11-28 10:48:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 616 transitions. [2018-11-28 10:48:14,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2018-11-28 10:48:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-28 10:48:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2018-11-28 10:48:14,522 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-11-28 10:48:14,522 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-11-28 10:48:14,522 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 10:48:14,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 395 transitions. [2018-11-28 10:48:14,524 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2018-11-28 10:48:14,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:14,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:14,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:14,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:14,525 INFO L794 eck$LassoCheckResult]: Stem: 1613#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 1581#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1583#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1611#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1617#L40-1 mp_add_~nb~0 := 4; 1625#L50 assume !(0 == mp_add_~b3~0 % 256); 1620#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1621#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1762#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1808#L64-1 [2018-11-28 10:48:14,525 INFO L796 eck$LassoCheckResult]: Loop: 1808#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1585#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1588#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1569#L80-1 assume !(1 == mp_add_~i~0 % 256); 1570#L81-1 assume !(2 == mp_add_~i~0 % 256); 1575#L82-1 assume !(3 == mp_add_~i~0 % 256); 1576#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1622#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1756#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1614#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1586#L65-2 assume !(1 == mp_add_~i~0 % 256); 1587#L66-1 assume !(2 == mp_add_~i~0 % 256); 1815#L67-1 assume !(3 == mp_add_~i~0 % 256); 1808#L64-1 [2018-11-28 10:48:14,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199508, now seen corresponding path program 1 times [2018-11-28 10:48:14,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:14,638 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-28 10:48:14,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:14,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:14,638 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:48:14,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 4 times [2018-11-28 10:48:14,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:14,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:14,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:14,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:14,689 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-28 10:48:14,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:14,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:14,690 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:14,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:48:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:14,691 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. cyclomatic complexity: 126 Second operand 8 states. [2018-11-28 10:48:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:15,577 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2018-11-28 10:48:15,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 10:48:15,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 533 transitions. [2018-11-28 10:48:15,581 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2018-11-28 10:48:15,583 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 533 transitions. [2018-11-28 10:48:15,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-11-28 10:48:15,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-11-28 10:48:15,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 533 transitions. [2018-11-28 10:48:15,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:15,584 INFO L705 BuchiCegarLoop]: Abstraction has 375 states and 533 transitions. [2018-11-28 10:48:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 533 transitions. [2018-11-28 10:48:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 300. [2018-11-28 10:48:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-28 10:48:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 431 transitions. [2018-11-28 10:48:15,594 INFO L728 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-11-28 10:48:15,595 INFO L608 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-11-28 10:48:15,595 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 10:48:15,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 431 transitions. [2018-11-28 10:48:15,596 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-11-28 10:48:15,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:15,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:15,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:15,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:15,597 INFO L794 eck$LassoCheckResult]: Stem: 2298#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 2263#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2265#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2294#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2259#L40-1 mp_add_~nb~0 := 4; 2260#L50 assume !(0 == mp_add_~b3~0 % 256); 2271#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2286#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2485#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2018-11-28 10:48:15,598 INFO L796 eck$LassoCheckResult]: Loop: 2272#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2273#L65-2 assume !(1 == mp_add_~i~0 % 256); 2510#L66-1 assume !(2 == mp_add_~i~0 % 256); 2509#L67-1 assume !(3 == mp_add_~i~0 % 256); 2506#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2504#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2503#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2494#L80-1 assume !(1 == mp_add_~i~0 % 256); 2502#L81-1 assume !(2 == mp_add_~i~0 % 256); 2490#L82-1 assume !(3 == mp_add_~i~0 % 256); 2488#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2486#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2487#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2018-11-28 10:48:15,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:15,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 1 times [2018-11-28 10:48:15,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:15,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:15,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 5 times [2018-11-28 10:48:15,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:15,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:15,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:15,633 INFO L82 PathProgramCache]: Analyzing trace with hash -833715526, now seen corresponding path program 1 times [2018-11-28 10:48:15,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:15,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:15,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:15,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 10:48:15,797 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:15,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:15,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:15,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:15,798 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:48:15,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:15,799 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:15,799 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:15,799 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-28 10:48:15,799 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:15,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:15,813 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-28 10:48:15,823 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-28 10:48:16,006 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:16,007 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:16,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:48:16,016 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:16,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:48:16,061 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:48:17,790 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 10:48:17,792 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:17,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:17,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:17,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:17,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:48:17,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:17,793 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:17,793 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:17,793 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-28 10:48:17,793 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:17,793 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:17,794 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-28 10:48:17,801 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-28 10:48:17,933 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:17,937 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:48:17,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:17,943 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:17,944 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:17,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:17,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,953 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 10:48:17,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,954 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:17,956 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:17,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,960 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:17,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:17,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,969 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 10:48:17,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,970 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:17,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:17,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,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-28 10:48:17,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,975 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:17,976 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:17,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,982 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 10:48:17,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,983 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:17,985 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:17,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:17,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,988 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:17,989 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:17,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:17,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:17,995 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 10:48:17,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:17,996 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:17,996 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:17,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:17,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:17,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:17,997 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:17,999 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:17,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:18,003 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,003 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:18,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,003 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:18,005 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:18,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,015 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 10:48:18,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:18,015 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,016 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:18,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,016 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:18,022 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:18,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:18,029 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,029 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:18,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:18,035 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:18,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,047 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 10:48:18,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-28 10:48:18,048 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,048 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:18,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,048 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:18,054 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:18,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:18,057 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,057 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:18,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,057 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:18,061 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:18,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,073 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 10:48:18,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-28 10:48:18,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,074 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:18,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,075 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:18,076 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:18,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:18,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,082 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:18,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:18,084 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:18,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,091 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 10:48:18,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-28 10:48:18,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,092 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:18,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,092 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:18,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:18,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,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-28 10:48:18,104 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:18,104 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:18,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:18,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:18,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:18,107 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:18,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:18,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:18,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:48:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:18,122 INFO L87 Difference]: Start difference. First operand 300 states and 431 transitions. cyclomatic complexity: 139 Second operand 6 states. [2018-11-28 10:48:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:18,400 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2018-11-28 10:48:18,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:48:18,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 882 transitions. [2018-11-28 10:48:18,404 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 325 [2018-11-28 10:48:18,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 612 states and 882 transitions. [2018-11-28 10:48:18,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2018-11-28 10:48:18,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2018-11-28 10:48:18,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 882 transitions. [2018-11-28 10:48:18,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:18,410 INFO L705 BuchiCegarLoop]: Abstraction has 612 states and 882 transitions. [2018-11-28 10:48:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 882 transitions. [2018-11-28 10:48:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 380. [2018-11-28 10:48:18,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-28 10:48:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2018-11-28 10:48:18,423 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-11-28 10:48:18,423 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-11-28 10:48:18,423 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 10:48:18,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 520 transitions. [2018-11-28 10:48:18,425 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-11-28 10:48:18,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:18,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:18,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:18,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:18,426 INFO L794 eck$LassoCheckResult]: Stem: 3219#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 3190#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3191#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3217#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3222#L40-1 mp_add_~nb~0 := 4; 3451#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3216#L52 assume !(0 == mp_add_~b2~0 % 256); 3196#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3210#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3525#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2018-11-28 10:48:18,426 INFO L796 eck$LassoCheckResult]: Loop: 3524#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3523#L65-2 assume !(1 == mp_add_~i~0 % 256); 3522#L66-1 assume !(2 == mp_add_~i~0 % 256); 3521#L67-1 assume !(3 == mp_add_~i~0 % 256); 3520#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3189#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3194#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3176#L80-1 assume !(1 == mp_add_~i~0 % 256); 3177#L81-1 assume !(2 == mp_add_~i~0 % 256); 3261#L82-1 assume !(3 == mp_add_~i~0 % 256); 3254#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3245#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3246#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2018-11-28 10:48:18,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash -438599534, now seen corresponding path program 1 times [2018-11-28 10:48:18,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:18,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:18,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:18,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:18,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:18,486 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-28 10:48:18,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:18,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 10:48:18,487 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:48:18,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 6 times [2018-11-28 10:48:18,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:18,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:18,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:18,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:18,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:18,552 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:18,552 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:18,552 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:18,552 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:18,552 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:48:18,552 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:18,552 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:18,552 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:18,552 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-28 10:48:18,552 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:18,552 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:18,553 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-28 10:48:18,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 10:48:18,723 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:18,723 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:18,726 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:48:18,726 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:18,763 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:48:18,763 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:48:30,778 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 10:48:30,781 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:30,781 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:30,781 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:30,781 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:30,781 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:48:30,781 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:30,781 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:30,781 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:30,781 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-28 10:48:30,781 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:30,781 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:30,782 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-28 10:48:30,789 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-28 10:48:30,919 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:30,919 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:48:30,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-28 10:48:30,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:30,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:30,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:30,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:30,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,926 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 10:48:30,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:30,927 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:30,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,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-28 10:48:30,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,931 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:30,932 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:30,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,933 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 10:48:30,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,934 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:30,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:30,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,939 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:30,940 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:30,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,941 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 10:48:30,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,942 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:30,942 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:30,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:30,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,948 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:30,948 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:30,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,950 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 10:48:30,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,950 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:30,951 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:30,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,951 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:30,952 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:30,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:30,957 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:30,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,958 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:30,959 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:30,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,960 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 10:48:30,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-28 10:48:30,961 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:30,961 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:30,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,961 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:30,963 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:30,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,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-28 10:48:30,971 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:30,971 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:30,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:30,973 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:30,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,976 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 10:48:30,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,977 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:30,980 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:30,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:30,983 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:30,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:30,991 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:30,991 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:30,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:30,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:30,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:30,992 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:30,998 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:30,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:30,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:30,999 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 10:48:31,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-28 10:48:31,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:31,000 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:31,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:31,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:31,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:31,000 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:31,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:31,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:31,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:31,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:31,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:31,007 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:31,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:31,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:31,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:31,008 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:31,009 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:31,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:31,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:31,012 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 10:48:31,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-28 10:48:31,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:31,013 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:31,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:31,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:31,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:31,014 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:31,015 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:31,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:31,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:31,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-28 10:48:31,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:31,026 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:31,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:31,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:31,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:31,026 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:31,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:31,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:31,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:31,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:31,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:31,035 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. cyclomatic complexity: 148 Second operand 3 states. [2018-11-28 10:48:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:31,047 INFO L93 Difference]: Finished difference Result 295 states and 401 transitions. [2018-11-28 10:48:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:31,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 401 transitions. [2018-11-28 10:48:31,049 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2018-11-28 10:48:31,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 295 states and 401 transitions. [2018-11-28 10:48:31,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2018-11-28 10:48:31,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2018-11-28 10:48:31,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 401 transitions. [2018-11-28 10:48:31,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:31,050 INFO L705 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-11-28 10:48:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 401 transitions. [2018-11-28 10:48:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-11-28 10:48:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-28 10:48:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2018-11-28 10:48:31,053 INFO L728 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-11-28 10:48:31,053 INFO L608 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-11-28 10:48:31,053 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 10:48:31,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 295 states and 401 transitions. [2018-11-28 10:48:31,055 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2018-11-28 10:48:31,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:31,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:31,055 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:31,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:31,056 INFO L794 eck$LassoCheckResult]: Stem: 3896#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 3871#L40 assume !(0 == mp_add_~a3~0 % 256); 3867#L40-1 mp_add_~nb~0 := 4; 3868#L50 assume !(0 == mp_add_~b3~0 % 256); 3889#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3884#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3885#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3876#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3873#L65-2 assume !(1 == mp_add_~i~0 % 256); 3874#L66-1 assume !(2 == mp_add_~i~0 % 256); 3879#L67-1 assume !(3 == mp_add_~i~0 % 256); 3880#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4136#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4135#L71-2 assume !(1 == mp_add_~i~0 % 256); 4134#L72-1 assume !(2 == mp_add_~i~0 % 256); 4133#L73-1 assume !(3 == mp_add_~i~0 % 256); 4132#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; 4131#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4130#L80-1 assume !(1 == mp_add_~i~0 % 256); 4129#L81-1 assume !(2 == mp_add_~i~0 % 256); 4128#L82-1 assume !(3 == mp_add_~i~0 % 256); 4127#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4126#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4125#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2018-11-28 10:48:31,056 INFO L796 eck$LassoCheckResult]: Loop: 4112#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4123#L65-2 assume !(1 == mp_add_~i~0 % 256); 4121#L66-1 assume !(2 == mp_add_~i~0 % 256); 4119#L67-1 assume !(3 == mp_add_~i~0 % 256); 4117#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4115#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4113#L71-2 assume !(1 == mp_add_~i~0 % 256); 4110#L72-1 assume !(2 == mp_add_~i~0 % 256); 4091#L73-1 assume !(3 == mp_add_~i~0 % 256); 3888#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3875#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3857#L80-1 assume !(1 == mp_add_~i~0 % 256); 3858#L81-1 assume !(2 == mp_add_~i~0 % 256); 3863#L82-1 assume !(3 == mp_add_~i~0 % 256); 3864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3919#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3920#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2018-11-28 10:48:31,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 1 times [2018-11-28 10:48:31,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:31,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:31,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:31,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:31,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1235554401, now seen corresponding path program 1 times [2018-11-28 10:48:31,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:31,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:31,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:31,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:31,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:31,081 INFO L82 PathProgramCache]: Analyzing trace with hash 350902213, now seen corresponding path program 1 times [2018-11-28 10:48:31,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:31,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:31,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:31,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:31,142 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:31,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:31,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:31,192 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:31,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:31,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:31,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:31,193 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:48:31,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:31,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:31,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:31,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-28 10:48:31,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:31,193 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:31,194 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-28 10:48:31,201 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-28 10:48:31,580 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-28 10:48:31,581 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:31,581 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:31,594 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:48:31,594 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:31,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:48:31,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:48:32,644 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 10:48:32,647 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:32,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:32,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:32,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:32,647 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:48:32,647 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:32,647 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:32,647 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:32,647 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-28 10:48:32,647 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:32,647 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:32,648 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-28 10:48:32,654 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-28 10:48:32,822 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:32,822 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:48:32,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:32,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:32,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:32,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:32,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,830 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 10:48:32,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,831 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:32,831 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:32,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,835 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:32,836 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:32,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,838 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 10:48:32,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:32,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:32,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:32,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:32,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,847 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 10:48:32,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,848 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:32,848 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:32,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:32,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,853 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:32,855 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:32,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,856 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 10:48:32,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,857 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,857 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:32,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,857 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:32,858 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:32,858 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,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-28 10:48:32,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,865 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:32,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,866 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:32,867 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:32,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,869 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 10:48:32,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,870 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,870 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:32,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:32,872 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:32,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,883 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:32,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,884 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:32,886 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:32,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,890 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 10:48:32,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-28 10:48:32,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,891 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:32,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,892 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:32,894 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:32,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,908 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,908 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:32,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,908 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:32,912 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:32,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,914 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 10:48:32,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:32,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,915 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:32,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:32,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,923 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,923 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:32,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:32,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:32,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,931 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 10:48:32,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,932 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:32,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,932 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:32,934 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:32,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:32,945 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:32,945 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:32,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:32,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:32,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:32,946 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:32,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:32,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:32,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:48:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:48:32,960 INFO L87 Difference]: Start difference. First operand 295 states and 401 transitions. cyclomatic complexity: 113 Second operand 4 states. [2018-11-28 10:48:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,118 INFO L93 Difference]: Finished difference Result 404 states and 572 transitions. [2018-11-28 10:48:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:48:33,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 572 transitions. [2018-11-28 10:48:33,121 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 283 [2018-11-28 10:48:33,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 402 states and 570 transitions. [2018-11-28 10:48:33,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2018-11-28 10:48:33,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2018-11-28 10:48:33,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 570 transitions. [2018-11-28 10:48:33,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:33,123 INFO L705 BuchiCegarLoop]: Abstraction has 402 states and 570 transitions. [2018-11-28 10:48:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 570 transitions. [2018-11-28 10:48:33,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 364. [2018-11-28 10:48:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-28 10:48:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 507 transitions. [2018-11-28 10:48:33,129 INFO L728 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2018-11-28 10:48:33,129 INFO L608 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2018-11-28 10:48:33,129 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 10:48:33,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 507 transitions. [2018-11-28 10:48:33,130 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 245 [2018-11-28 10:48:33,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:33,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:33,131 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,131 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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-28 10:48:33,131 INFO L794 eck$LassoCheckResult]: Stem: 4602#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 4576#L40 assume !(0 == mp_add_~a3~0 % 256); 4573#L40-1 mp_add_~nb~0 := 4; 4574#L50 assume !(0 == mp_add_~b3~0 % 256); 4596#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4597#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4860#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4859#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4858#L65-2 assume !(1 == mp_add_~i~0 % 256); 4857#L66-1 assume !(2 == mp_add_~i~0 % 256); 4856#L67-1 assume !(3 == mp_add_~i~0 % 256); 4855#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4854#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4853#L71-2 assume !(1 == mp_add_~i~0 % 256); 4852#L72-1 assume !(2 == mp_add_~i~0 % 256); 4851#L73-1 assume !(3 == mp_add_~i~0 % 256); 4850#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; 4848#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4847#L80-1 assume !(1 == mp_add_~i~0 % 256); 4845#L81-1 assume !(2 == mp_add_~i~0 % 256); 4846#L82-1 assume !(3 == mp_add_~i~0 % 256); 4599#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4591#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4592#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2018-11-28 10:48:33,132 INFO L796 eck$LassoCheckResult]: Loop: 4867#L65 assume !(0 == mp_add_~i~0 % 256); 4862#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4605#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 4587#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 4588#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4575#L71 assume !(0 == mp_add_~i~0 % 256); 4569#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 4570#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 4598#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 4863#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4864#L76-1 assume !(0 == mp_add_~i~0 % 256); 4885#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4926#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4571#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 4572#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4619#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4620#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4890#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4865#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4866#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4636#L80-1 assume !(1 == mp_add_~i~0 % 256); 4637#L81-1 assume !(2 == mp_add_~i~0 % 256); 4884#L82-1 assume !(3 == mp_add_~i~0 % 256); 4882#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4611#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4612#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2018-11-28 10:48:33,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 2 times [2018-11-28 10:48:33,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash -929180227, now seen corresponding path program 1 times [2018-11-28 10:48:33,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:33,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 10:48:33,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:33,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:48:33,172 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:33,173 INFO L87 Difference]: Start difference. First operand 364 states and 507 transitions. cyclomatic complexity: 150 Second operand 3 states. [2018-11-28 10:48:33,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,240 INFO L93 Difference]: Finished difference Result 454 states and 625 transitions. [2018-11-28 10:48:33,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:33,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 454 states and 625 transitions. [2018-11-28 10:48:33,244 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 329 [2018-11-28 10:48:33,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 454 states to 454 states and 625 transitions. [2018-11-28 10:48:33,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2018-11-28 10:48:33,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2018-11-28 10:48:33,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 625 transitions. [2018-11-28 10:48:33,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:33,246 INFO L705 BuchiCegarLoop]: Abstraction has 454 states and 625 transitions. [2018-11-28 10:48:33,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 625 transitions. [2018-11-28 10:48:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2018-11-28 10:48:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-28 10:48:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 565 transitions. [2018-11-28 10:48:33,254 INFO L728 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2018-11-28 10:48:33,254 INFO L608 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2018-11-28 10:48:33,254 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 10:48:33,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 565 transitions. [2018-11-28 10:48:33,255 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 285 [2018-11-28 10:48:33,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:33,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:33,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,256 INFO L794 eck$LassoCheckResult]: Stem: 5434#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 5403#L40 assume !(0 == mp_add_~a3~0 % 256); 5404#L40-1 mp_add_~nb~0 := 4; 5742#L50 assume !(0 == mp_add_~b3~0 % 256); 5741#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5740#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5739#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5738#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5737#L65-2 assume !(1 == mp_add_~i~0 % 256); 5736#L66-1 assume !(2 == mp_add_~i~0 % 256); 5735#L67-1 assume !(3 == mp_add_~i~0 % 256); 5734#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5733#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5732#L71-2 assume !(1 == mp_add_~i~0 % 256); 5731#L72-1 assume !(2 == mp_add_~i~0 % 256); 5730#L73-1 assume !(3 == mp_add_~i~0 % 256); 5729#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; 5728#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5727#L80-1 assume !(1 == mp_add_~i~0 % 256); 5726#L81-1 assume !(2 == mp_add_~i~0 % 256); 5725#L82-1 assume !(3 == mp_add_~i~0 % 256); 5724#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5723#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5722#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2018-11-28 10:48:33,256 INFO L796 eck$LassoCheckResult]: Loop: 5687#L65 assume !(0 == mp_add_~i~0 % 256); 5721#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 5719#L66-1 assume !(2 == mp_add_~i~0 % 256); 5717#L67-1 assume !(3 == mp_add_~i~0 % 256); 5715#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5714#L71 assume !(0 == mp_add_~i~0 % 256); 5711#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 5709#L72-1 assume !(2 == mp_add_~i~0 % 256); 5707#L73-1 assume !(3 == mp_add_~i~0 % 256); 5681#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5677#L76-1 assume !(0 == mp_add_~i~0 % 256); 5672#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5670#L81-1 assume !(2 == mp_add_~i~0 % 256); 5668#L82-1 assume !(3 == mp_add_~i~0 % 256); 5666#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5665#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5663#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5664#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5679#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5674#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5675#L80-1 assume !(1 == mp_add_~i~0 % 256); 5695#L81-1 assume !(2 == mp_add_~i~0 % 256); 5694#L82-1 assume !(3 == mp_add_~i~0 % 256); 5692#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5689#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5686#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2018-11-28 10:48:33,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 3 times [2018-11-28 10:48:33,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,282 INFO L82 PathProgramCache]: Analyzing trace with hash 440290813, now seen corresponding path program 1 times [2018-11-28 10:48:33,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:33,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:33,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:33,303 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:33,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:33,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:33,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-11-28 10:48:33,428 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:33,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 10:48:33,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 10:48:33,429 INFO L87 Difference]: Start difference. First operand 407 states and 565 transitions. cyclomatic complexity: 164 Second operand 6 states. [2018-11-28 10:48:33,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,677 INFO L93 Difference]: Finished difference Result 482 states and 628 transitions. [2018-11-28 10:48:33,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:48:33,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 628 transitions. [2018-11-28 10:48:33,679 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 341 [2018-11-28 10:48:33,681 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 476 states and 619 transitions. [2018-11-28 10:48:33,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2018-11-28 10:48:33,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2018-11-28 10:48:33,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 476 states and 619 transitions. [2018-11-28 10:48:33,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:33,682 INFO L705 BuchiCegarLoop]: Abstraction has 476 states and 619 transitions. [2018-11-28 10:48:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states and 619 transitions. [2018-11-28 10:48:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 372. [2018-11-28 10:48:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-28 10:48:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 477 transitions. [2018-11-28 10:48:33,690 INFO L728 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2018-11-28 10:48:33,690 INFO L608 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2018-11-28 10:48:33,690 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 10:48:33,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 477 transitions. [2018-11-28 10:48:33,691 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 241 [2018-11-28 10:48:33,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:33,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:33,692 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,692 INFO L794 eck$LassoCheckResult]: Stem: 6416#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 6383#L40 assume !(0 == mp_add_~a3~0 % 256); 6379#L40-1 mp_add_~nb~0 := 4; 6380#L50 assume !(0 == mp_add_~b3~0 % 256); 6404#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6405#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6632#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6633#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6628#L65-2 assume !(1 == mp_add_~i~0 % 256); 6629#L66-1 assume !(2 == mp_add_~i~0 % 256); 6624#L67-1 assume !(3 == mp_add_~i~0 % 256); 6625#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6620#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6621#L71-2 assume !(1 == mp_add_~i~0 % 256); 6616#L72-1 assume !(2 == mp_add_~i~0 % 256); 6617#L73-1 assume !(3 == mp_add_~i~0 % 256); 6612#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; 6613#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6734#L80-1 assume !(1 == mp_add_~i~0 % 256); 6733#L81-1 assume !(2 == mp_add_~i~0 % 256); 6732#L82-1 assume !(3 == mp_add_~i~0 % 256); 6731#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6730#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6729#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2018-11-28 10:48:33,693 INFO L796 eck$LassoCheckResult]: Loop: 6390#L65 assume !(0 == mp_add_~i~0 % 256); 6391#L65-2 assume !(1 == mp_add_~i~0 % 256); 6727#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 6725#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 6723#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6721#L71 assume !(0 == mp_add_~i~0 % 256); 6651#L71-2 assume !(1 == mp_add_~i~0 % 256); 6647#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 6644#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 6643#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6641#L76-1 assume !(0 == mp_add_~i~0 % 256); 6642#L80-1 assume !(1 == mp_add_~i~0 % 256); 6637#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 6638#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6546#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6547#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6674#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6668#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6669#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6663#L71-2 assume !(1 == mp_add_~i~0 % 256); 6664#L72-1 assume !(2 == mp_add_~i~0 % 256); 6659#L73-1 assume !(3 == mp_add_~i~0 % 256); 6660#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6655#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6656#L80-1 assume !(1 == mp_add_~i~0 % 256); 6684#L81-1 assume !(2 == mp_add_~i~0 % 256); 6685#L82-1 assume !(3 == mp_add_~i~0 % 256); 6677#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6678#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6671#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2018-11-28 10:48:33,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,693 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 4 times [2018-11-28 10:48:33,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 293037747, now seen corresponding path program 1 times [2018-11-28 10:48:33,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 10:48:33,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:33,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:48:33,728 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:33,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:33,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:33,728 INFO L87 Difference]: Start difference. First operand 372 states and 477 transitions. cyclomatic complexity: 111 Second operand 3 states. [2018-11-28 10:48:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:33,859 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2018-11-28 10:48:33,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:33,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 422 states and 539 transitions. [2018-11-28 10:48:33,862 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 289 [2018-11-28 10:48:33,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 422 states to 422 states and 539 transitions. [2018-11-28 10:48:33,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 422 [2018-11-28 10:48:33,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2018-11-28 10:48:33,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 422 states and 539 transitions. [2018-11-28 10:48:33,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:33,864 INFO L705 BuchiCegarLoop]: Abstraction has 422 states and 539 transitions. [2018-11-28 10:48:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states and 539 transitions. [2018-11-28 10:48:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 375. [2018-11-28 10:48:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-28 10:48:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 483 transitions. [2018-11-28 10:48:33,869 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2018-11-28 10:48:33,869 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2018-11-28 10:48:33,869 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 10:48:33,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 483 transitions. [2018-11-28 10:48:33,871 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 247 [2018-11-28 10:48:33,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:33,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:33,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:33,872 INFO L794 eck$LassoCheckResult]: Stem: 7208#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 7179#L40 assume !(0 == mp_add_~a3~0 % 256); 7180#L40-1 mp_add_~nb~0 := 4; 7436#L50 assume !(0 == mp_add_~b3~0 % 256); 7435#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7433#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7432#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7431#L65-2 assume !(1 == mp_add_~i~0 % 256); 7429#L66-1 assume !(2 == mp_add_~i~0 % 256); 7427#L67-1 assume !(3 == mp_add_~i~0 % 256); 7424#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7421#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7419#L71-2 assume !(1 == mp_add_~i~0 % 256); 7417#L72-1 assume !(2 == mp_add_~i~0 % 256); 7415#L73-1 assume !(3 == mp_add_~i~0 % 256); 7413#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; 7411#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7409#L80-1 assume !(1 == mp_add_~i~0 % 256); 7407#L81-1 assume !(2 == mp_add_~i~0 % 256); 7405#L82-1 assume !(3 == mp_add_~i~0 % 256); 7403#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7400#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2018-11-28 10:48:33,872 INFO L796 eck$LassoCheckResult]: Loop: 7393#L65 assume !(0 == mp_add_~i~0 % 256); 7389#L65-2 assume !(1 == mp_add_~i~0 % 256); 7387#L66-1 assume !(2 == mp_add_~i~0 % 256); 7383#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 7384#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7460#L71 assume !(0 == mp_add_~i~0 % 256); 7457#L71-2 assume !(1 == mp_add_~i~0 % 256); 7455#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 7456#L73-1 assume !(3 == mp_add_~i~0 % 256); 7469#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7466#L76-1 assume !(0 == mp_add_~i~0 % 256); 7463#L80-1 assume !(1 == mp_add_~i~0 % 256); 7461#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7450#L82-1 assume !(3 == mp_add_~i~0 % 256); 7402#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7399#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7394#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7395#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7423#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7420#L71-2 assume !(1 == mp_add_~i~0 % 256); 7418#L72-1 assume !(2 == mp_add_~i~0 % 256); 7416#L73-1 assume !(3 == mp_add_~i~0 % 256); 7414#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7412#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7410#L80-1 assume !(1 == mp_add_~i~0 % 256); 7408#L81-1 assume !(2 == mp_add_~i~0 % 256); 7406#L82-1 assume !(3 == mp_add_~i~0 % 256); 7404#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7401#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7397#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2018-11-28 10:48:33,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,872 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 5 times [2018-11-28 10:48:33,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:33,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:33,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:33,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1585928527, now seen corresponding path program 1 times [2018-11-28 10:48:33,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:33,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:33,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:33,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 10:48:33,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:33,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 10:48:33,903 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 10:48:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 10:48:33,904 INFO L87 Difference]: Start difference. First operand 375 states and 483 transitions. cyclomatic complexity: 113 Second operand 3 states. [2018-11-28 10:48:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:34,010 INFO L93 Difference]: Finished difference Result 419 states and 534 transitions. [2018-11-28 10:48:34,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 10:48:34,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 534 transitions. [2018-11-28 10:48:34,013 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 289 [2018-11-28 10:48:34,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 534 transitions. [2018-11-28 10:48:34,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2018-11-28 10:48:34,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2018-11-28 10:48:34,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 534 transitions. [2018-11-28 10:48:34,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:34,015 INFO L705 BuchiCegarLoop]: Abstraction has 419 states and 534 transitions. [2018-11-28 10:48:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 534 transitions. [2018-11-28 10:48:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 398. [2018-11-28 10:48:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-28 10:48:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2018-11-28 10:48:34,022 INFO L728 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2018-11-28 10:48:34,022 INFO L608 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2018-11-28 10:48:34,022 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 10:48:34,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 511 transitions. [2018-11-28 10:48:34,024 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 268 [2018-11-28 10:48:34,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:34,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:34,024 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:34,024 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:34,025 INFO L794 eck$LassoCheckResult]: Stem: 8008#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 7979#L40 assume !(0 == mp_add_~a3~0 % 256); 7976#L40-1 mp_add_~nb~0 := 4; 7977#L50 assume !(0 == mp_add_~b3~0 % 256); 8000#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8001#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8040#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8041#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8141#L65-2 assume !(1 == mp_add_~i~0 % 256); 8142#L66-1 assume !(2 == mp_add_~i~0 % 256); 8137#L67-1 assume !(3 == mp_add_~i~0 % 256); 8138#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8133#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8134#L71-2 assume !(1 == mp_add_~i~0 % 256); 8129#L72-1 assume !(2 == mp_add_~i~0 % 256); 8130#L73-1 assume !(3 == mp_add_~i~0 % 256); 8126#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; 8125#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8124#L80-1 assume !(1 == mp_add_~i~0 % 256); 8123#L81-1 assume !(2 == mp_add_~i~0 % 256); 8039#L82-1 assume !(3 == mp_add_~i~0 % 256); 8004#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7996#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7997#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2018-11-28 10:48:34,025 INFO L796 eck$LassoCheckResult]: Loop: 8276#L65 assume !(0 == mp_add_~i~0 % 256); 8274#L65-2 assume !(1 == mp_add_~i~0 % 256); 8272#L66-1 assume !(2 == mp_add_~i~0 % 256); 8273#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 8280#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8279#L71 assume !(0 == mp_add_~i~0 % 256); 8278#L71-2 assume !(1 == mp_add_~i~0 % 256); 8243#L72-1 assume !(2 == mp_add_~i~0 % 256); 8244#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 8324#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8156#L76-1 assume !(0 == mp_add_~i~0 % 256); 8157#L80-1 assume !(1 == mp_add_~i~0 % 256); 8144#L81-1 assume !(2 == mp_add_~i~0 % 256); 8145#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 8037#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8038#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8032#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8165#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8121#L71-2 assume !(1 == mp_add_~i~0 % 256); 8120#L72-1 assume !(2 == mp_add_~i~0 % 256); 8119#L73-1 assume !(3 == mp_add_~i~0 % 256); 8118#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8117#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8116#L80-1 assume !(1 == mp_add_~i~0 % 256); 8115#L81-1 assume !(2 == mp_add_~i~0 % 256); 8113#L82-1 assume !(3 == mp_add_~i~0 % 256); 8114#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8023#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8024#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2018-11-28 10:48:34,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:34,025 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 6 times [2018-11-28 10:48:34,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:34,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:34,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:34,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:34,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:34,041 INFO L82 PathProgramCache]: Analyzing trace with hash 278948913, now seen corresponding path program 1 times [2018-11-28 10:48:34,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:34,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:34,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:34,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:34,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:34,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:34,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:34,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:34,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 10:48:34,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-28 10:48:34,162 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 10:48:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 10:48:34,163 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. cyclomatic complexity: 118 Second operand 7 states. [2018-11-28 10:48:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:34,713 INFO L93 Difference]: Finished difference Result 1137 states and 1501 transitions. [2018-11-28 10:48:34,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 10:48:34,715 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1501 transitions. [2018-11-28 10:48:34,720 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 988 [2018-11-28 10:48:34,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 1137 states and 1501 transitions. [2018-11-28 10:48:34,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1137 [2018-11-28 10:48:34,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2018-11-28 10:48:34,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1137 states and 1501 transitions. [2018-11-28 10:48:34,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:34,728 INFO L705 BuchiCegarLoop]: Abstraction has 1137 states and 1501 transitions. [2018-11-28 10:48:34,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states and 1501 transitions. [2018-11-28 10:48:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 516. [2018-11-28 10:48:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-28 10:48:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 669 transitions. [2018-11-28 10:48:34,740 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2018-11-28 10:48:34,740 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2018-11-28 10:48:34,740 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 10:48:34,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 669 transitions. [2018-11-28 10:48:34,742 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 386 [2018-11-28 10:48:34,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:34,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:34,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:34,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:34,743 INFO L794 eck$LassoCheckResult]: Stem: 9679#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 9648#L40 assume !(0 == mp_add_~a3~0 % 256); 9649#L40-1 mp_add_~nb~0 := 4; 9866#L50 assume !(0 == mp_add_~b3~0 % 256); 9865#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9864#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9863#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9862#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9861#L65-2 assume !(1 == mp_add_~i~0 % 256); 9860#L66-1 assume !(2 == mp_add_~i~0 % 256); 9859#L67-1 assume !(3 == mp_add_~i~0 % 256); 9858#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9857#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9856#L71-2 assume !(1 == mp_add_~i~0 % 256); 9855#L72-1 assume !(2 == mp_add_~i~0 % 256); 9854#L73-1 assume !(3 == mp_add_~i~0 % 256); 9853#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; 9852#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9851#L80-1 assume !(1 == mp_add_~i~0 % 256); 9850#L81-1 assume !(2 == mp_add_~i~0 % 256); 9849#L82-1 assume !(3 == mp_add_~i~0 % 256); 9848#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9847#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9844#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2018-11-28 10:48:34,743 INFO L796 eck$LassoCheckResult]: Loop: 9837#L65 assume !(0 == mp_add_~i~0 % 256); 9835#L65-2 assume !(1 == mp_add_~i~0 % 256); 9833#L66-1 assume !(2 == mp_add_~i~0 % 256); 9832#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 9830#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9828#L71 assume !(0 == mp_add_~i~0 % 256); 9826#L71-2 assume !(1 == mp_add_~i~0 % 256); 9824#L72-1 assume !(2 == mp_add_~i~0 % 256); 9821#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 9819#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 9820#L76-1 assume !(0 == mp_add_~i~0 % 256); 9815#L80-1 assume !(1 == mp_add_~i~0 % 256); 9816#L81-1 assume !(2 == mp_add_~i~0 % 256); 9810#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 9811#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9845#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9846#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2018-11-28 10:48:34,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 7 times [2018-11-28 10:48:34,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:34,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:34,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:34,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:34,760 INFO L82 PathProgramCache]: Analyzing trace with hash -459730205, now seen corresponding path program 1 times [2018-11-28 10:48:34,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:34,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:34,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:34,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:34,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:34,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1126726409, now seen corresponding path program 1 times [2018-11-28 10:48:34,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:34,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:34,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:34,830 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:34,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:34,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 10:48:34,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 10:48:34,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-11-28 10:48:35,024 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:35,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:35,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:35,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:35,024 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:48:35,024 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:35,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:35,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:35,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2018-11-28 10:48:35,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:35,025 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:35,025 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-28 10:48:35,038 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-28 10:48:35,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:35,223 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:35,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:48:35,227 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:48:35,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:48:35,258 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:48:35,867 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 10:48:35,869 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:48:35,869 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:48:35,869 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:48:35,869 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:48:35,869 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:48:35,869 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:48:35,869 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:48:35,869 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:48:35,869 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2018-11-28 10:48:35,869 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:48:35,869 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:48:35,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-28 10:48:35,880 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-28 10:48:36,066 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:48:36,066 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:48:36,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-28 10:48:36,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:36,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:36,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:48:36,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:48:36,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,072 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 10:48:36,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-28 10:48:36,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,073 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:36,073 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:36,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,077 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:36,078 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:36,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,079 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 10:48:36,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,080 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:36,081 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:36,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:36,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:36,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,087 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 10:48:36,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-28 10:48:36,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,088 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:36,089 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:36,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,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-28 10:48:36,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:48:36,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,094 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:36,095 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:36,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,097 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 10:48:36,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,097 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,098 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:36,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,098 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:36,099 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:36,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,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-28 10:48:36,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,107 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:36,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,107 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:48:36,109 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:48:36,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,111 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 10:48:36,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,112 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,112 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:36,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,112 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:36,114 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:36,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,128 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:48:36,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,128 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:36,131 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:36,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,134 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 10:48:36,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-28 10:48:36,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,135 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:36,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,136 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:36,138 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:36,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,150 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:36,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,150 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:48:36,154 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:48:36,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,156 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 10:48:36,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,157 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:36,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,158 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:36,158 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:36,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,166 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:48:36,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,166 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:48:36,167 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:48:36,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,173 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 10:48:36,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:48:36,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,174 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:36,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,174 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:36,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:36,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,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-28 10:48:36,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:48:36,192 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:48:36,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:48:36,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:48:36,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:48:36,193 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:48:36,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:48:36,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:48:36,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:48:36,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:48:36,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:48:36,205 INFO L87 Difference]: Start difference. First operand 516 states and 669 transitions. cyclomatic complexity: 159 Second operand 8 states. [2018-11-28 10:48:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:36,653 INFO L93 Difference]: Finished difference Result 656 states and 821 transitions. [2018-11-28 10:48:36,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:48:36,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 821 transitions. [2018-11-28 10:48:36,656 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 514 [2018-11-28 10:48:36,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 647 states and 808 transitions. [2018-11-28 10:48:36,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2018-11-28 10:48:36,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 647 [2018-11-28 10:48:36,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 808 transitions. [2018-11-28 10:48:36,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:36,660 INFO L705 BuchiCegarLoop]: Abstraction has 647 states and 808 transitions. [2018-11-28 10:48:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 808 transitions. [2018-11-28 10:48:36,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 574. [2018-11-28 10:48:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-28 10:48:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 729 transitions. [2018-11-28 10:48:36,668 INFO L728 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2018-11-28 10:48:36,668 INFO L608 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2018-11-28 10:48:36,668 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 10:48:36,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 729 transitions. [2018-11-28 10:48:36,670 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 447 [2018-11-28 10:48:36,670 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:36,670 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:36,671 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,671 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,671 INFO L794 eck$LassoCheckResult]: Stem: 10990#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 10959#L40 assume !(0 == mp_add_~a3~0 % 256); 10960#L40-1 mp_add_~nb~0 := 4; 11140#L50 assume !(0 == mp_add_~b3~0 % 256); 11139#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11138#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11137#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11136#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11135#L65-2 assume !(1 == mp_add_~i~0 % 256); 11134#L66-1 assume !(2 == mp_add_~i~0 % 256); 11133#L67-1 assume !(3 == mp_add_~i~0 % 256); 11132#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11131#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11130#L71-2 assume !(1 == mp_add_~i~0 % 256); 11129#L72-1 assume !(2 == mp_add_~i~0 % 256); 11128#L73-1 assume !(3 == mp_add_~i~0 % 256); 11127#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; 11126#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11125#L80-1 assume !(1 == mp_add_~i~0 % 256); 11124#L81-1 assume !(2 == mp_add_~i~0 % 256); 11123#L82-1 assume !(3 == mp_add_~i~0 % 256); 11122#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11121#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11120#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11119#L65 assume !(0 == mp_add_~i~0 % 256); 11118#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11051#L66-1 [2018-11-28 10:48:36,671 INFO L796 eck$LassoCheckResult]: Loop: 11051#L66-1 assume !(2 == mp_add_~i~0 % 256); 11117#L67-1 assume !(3 == mp_add_~i~0 % 256); 11116#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11115#L71 assume !(0 == mp_add_~i~0 % 256); 11114#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 11113#L72-1 assume !(2 == mp_add_~i~0 % 256); 11112#L73-1 assume !(3 == mp_add_~i~0 % 256); 11111#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11110#L76-1 assume !(0 == mp_add_~i~0 % 256); 11108#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11107#L81-1 assume !(2 == mp_add_~i~0 % 256); 11052#L82-1 assume !(3 == mp_add_~i~0 % 256); 11043#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11044#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11039#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11040#L65 assume !(0 == mp_add_~i~0 % 256); 11050#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11051#L66-1 [2018-11-28 10:48:36,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 1 times [2018-11-28 10:48:36,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:36,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:36,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1434173717, now seen corresponding path program 1 times [2018-11-28 10:48:36,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:36,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:36,749 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-28 10:48:36,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:48:36,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:48:36,749 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:36,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 10:48:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 10:48:36,750 INFO L87 Difference]: Start difference. First operand 574 states and 729 transitions. cyclomatic complexity: 163 Second operand 5 states. [2018-11-28 10:48:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:48:36,887 INFO L93 Difference]: Finished difference Result 896 states and 1144 transitions. [2018-11-28 10:48:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 10:48:36,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 896 states and 1144 transitions. [2018-11-28 10:48:36,895 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 763 [2018-11-28 10:48:36,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 896 states to 896 states and 1144 transitions. [2018-11-28 10:48:36,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2018-11-28 10:48:36,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 896 [2018-11-28 10:48:36,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 896 states and 1144 transitions. [2018-11-28 10:48:36,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:48:36,904 INFO L705 BuchiCegarLoop]: Abstraction has 896 states and 1144 transitions. [2018-11-28 10:48:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states and 1144 transitions. [2018-11-28 10:48:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 644. [2018-11-28 10:48:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-11-28 10:48:36,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 817 transitions. [2018-11-28 10:48:36,916 INFO L728 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2018-11-28 10:48:36,917 INFO L608 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2018-11-28 10:48:36,917 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 10:48:36,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 644 states and 817 transitions. [2018-11-28 10:48:36,919 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 523 [2018-11-28 10:48:36,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:48:36,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:48:36,920 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,920 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:48:36,920 INFO L794 eck$LassoCheckResult]: Stem: 12469#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 12438#L40 assume !(0 == mp_add_~a3~0 % 256); 12439#L40-1 mp_add_~nb~0 := 4; 12708#L50 assume !(0 == mp_add_~b3~0 % 256); 12707#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12706#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12705#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12704#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12703#L65-2 assume !(1 == mp_add_~i~0 % 256); 12702#L66-1 assume !(2 == mp_add_~i~0 % 256); 12701#L67-1 assume !(3 == mp_add_~i~0 % 256); 12700#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12699#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12698#L71-2 assume !(1 == mp_add_~i~0 % 256); 12697#L72-1 assume !(2 == mp_add_~i~0 % 256); 12696#L73-1 assume !(3 == mp_add_~i~0 % 256); 12695#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; 12694#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12693#L80-1 assume !(1 == mp_add_~i~0 % 256); 12692#L81-1 assume !(2 == mp_add_~i~0 % 256); 12691#L82-1 assume !(3 == mp_add_~i~0 % 256); 12690#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12689#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12688#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12687#L65 assume !(0 == mp_add_~i~0 % 256); 12686#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12685#L66-1 [2018-11-28 10:48:36,920 INFO L796 eck$LassoCheckResult]: Loop: 12685#L66-1 assume !(2 == mp_add_~i~0 % 256); 12684#L67-1 assume !(3 == mp_add_~i~0 % 256); 12683#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12682#L71 assume !(0 == mp_add_~i~0 % 256); 12681#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 12680#L72-1 assume !(2 == mp_add_~i~0 % 256); 12679#L73-1 assume !(3 == mp_add_~i~0 % 256); 12678#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12677#L76-1 assume !(0 == mp_add_~i~0 % 256); 12676#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12675#L81-1 assume !(2 == mp_add_~i~0 % 256); 12674#L82-1 assume !(3 == mp_add_~i~0 % 256); 12673#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12621#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12622#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12611#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12613#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12606#L76-1 assume !(0 == mp_add_~i~0 % 256); 12521#L80-1 assume !(1 == mp_add_~i~0 % 256); 12522#L81-1 assume !(2 == mp_add_~i~0 % 256); 12517#L82-1 assume !(3 == mp_add_~i~0 % 256); 12512#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12510#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12511#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12615#L65 assume !(0 == mp_add_~i~0 % 256); 12655#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12685#L66-1 [2018-11-28 10:48:36,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 2 times [2018-11-28 10:48:36,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:36,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:48:36,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:48:36,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1615640065, now seen corresponding path program 1 times [2018-11-28 10:48:36,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:48:36,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:48:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:48:36,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:48:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:37,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:48:37,078 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:48:37,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:48:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:48:37,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:48:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 10:48:37,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:48:37,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-28 10:48:37,492 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:48:37,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:48:37,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=104, Unknown=1, NotChecked=0, Total=132 [2018-11-28 10:48:37,492 INFO L87 Difference]: Start difference. First operand 644 states and 817 transitions. cyclomatic complexity: 181 Second operand 12 states. [2018-11-28 10:48:38,762 WARN L180 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-28 10:48:39,369 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-11-28 10:48:41,568 WARN L180 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-28 10:48:43,857 WARN L180 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-28 10:48:45,559 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-28 10:49:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:05,850 INFO L93 Difference]: Finished difference Result 1606 states and 1985 transitions. [2018-11-28 10:49:05,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 10:49:05,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1606 states and 1985 transitions. [2018-11-28 10:49:05,857 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1432 [2018-11-28 10:49:05,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1606 states to 1571 states and 1922 transitions. [2018-11-28 10:49:05,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1571 [2018-11-28 10:49:05,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1571 [2018-11-28 10:49:05,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1571 states and 1922 transitions. [2018-11-28 10:49:05,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:05,868 INFO L705 BuchiCegarLoop]: Abstraction has 1571 states and 1922 transitions. [2018-11-28 10:49:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states and 1922 transitions. [2018-11-28 10:49:05,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1105. [2018-11-28 10:49:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2018-11-28 10:49:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1386 transitions. [2018-11-28 10:49:05,888 INFO L728 BuchiCegarLoop]: Abstraction has 1105 states and 1386 transitions. [2018-11-28 10:49:05,889 INFO L608 BuchiCegarLoop]: Abstraction has 1105 states and 1386 transitions. [2018-11-28 10:49:05,889 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 10:49:05,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1105 states and 1386 transitions. [2018-11-28 10:49:05,893 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1022 [2018-11-28 10:49:05,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:05,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:05,893 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:05,893 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:05,894 INFO L794 eck$LassoCheckResult]: Stem: 14853#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 14825#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14827#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14851#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14822#L40-1 mp_add_~nb~0 := 4; 14823#L50 assume !(0 == mp_add_~b3~0 % 256); 14846#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14847#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15656#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15650#L65 [2018-11-28 10:49:05,894 INFO L796 eck$LassoCheckResult]: Loop: 15650#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15651#L65-2 assume !(1 == mp_add_~i~0 % 256); 15789#L66-1 assume !(2 == mp_add_~i~0 % 256); 15788#L67-1 assume !(3 == mp_add_~i~0 % 256); 15787#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15786#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15785#L71-2 assume !(1 == mp_add_~i~0 % 256); 15784#L72-1 assume !(2 == mp_add_~i~0 % 256); 15783#L73-1 assume !(3 == mp_add_~i~0 % 256); 15782#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15781#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15780#L80-1 assume !(1 == mp_add_~i~0 % 256); 15779#L81-1 assume !(2 == mp_add_~i~0 % 256); 15778#L82-1 assume !(3 == mp_add_~i~0 % 256); 15777#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15775#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15774#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15773#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15772#L71 assume !(0 == mp_add_~i~0 % 256); 15765#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 15674#L72-1 assume !(2 == mp_add_~i~0 % 256); 15763#L73-1 assume !(3 == mp_add_~i~0 % 256); 15762#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15761#L76-1 assume !(0 == mp_add_~i~0 % 256); 15748#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15746#L81-1 assume !(2 == mp_add_~i~0 % 256); 15744#L82-1 assume !(3 == mp_add_~i~0 % 256); 15743#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15726#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15720#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15287#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15285#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15284#L76-1 assume !(0 == mp_add_~i~0 % 256); 15283#L80-1 assume !(1 == mp_add_~i~0 % 256); 15282#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15281#L82-1 assume !(3 == mp_add_~i~0 % 256); 14892#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14893#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15706#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15704#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15702#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15699#L76-1 assume !(0 == mp_add_~i~0 % 256); 15696#L80-1 assume !(1 == mp_add_~i~0 % 256); 15691#L81-1 assume !(2 == mp_add_~i~0 % 256); 15688#L82-1 assume !(3 == mp_add_~i~0 % 256); 15676#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15660#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15661#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15650#L65 [2018-11-28 10:49:05,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:05,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 2 times [2018-11-28 10:49:05,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:05,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:05,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:05,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:05,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:05,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2024966345, now seen corresponding path program 1 times [2018-11-28 10:49:05,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:05,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:05,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:05,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:49:05,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:05,956 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 10:49:05,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:05,957 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:05,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:05,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 10:49:06,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 10:49:06,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-28 10:49:06,073 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:49:06,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:49:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:49:06,074 INFO L87 Difference]: Start difference. First operand 1105 states and 1386 transitions. cyclomatic complexity: 289 Second operand 8 states. [2018-11-28 10:49:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:06,192 INFO L93 Difference]: Finished difference Result 1843 states and 2218 transitions. [2018-11-28 10:49:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 10:49:06,193 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1843 states and 2218 transitions. [2018-11-28 10:49:06,200 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1745 [2018-11-28 10:49:06,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1843 states to 1843 states and 2218 transitions. [2018-11-28 10:49:06,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1843 [2018-11-28 10:49:06,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1843 [2018-11-28 10:49:06,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1843 states and 2218 transitions. [2018-11-28 10:49:06,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:06,211 INFO L705 BuchiCegarLoop]: Abstraction has 1843 states and 2218 transitions. [2018-11-28 10:49:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states and 2218 transitions. [2018-11-28 10:49:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1614. [2018-11-28 10:49:06,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2018-11-28 10:49:06,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1970 transitions. [2018-11-28 10:49:06,239 INFO L728 BuchiCegarLoop]: Abstraction has 1614 states and 1970 transitions. [2018-11-28 10:49:06,239 INFO L608 BuchiCegarLoop]: Abstraction has 1614 states and 1970 transitions. [2018-11-28 10:49:06,239 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 10:49:06,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1614 states and 1970 transitions. [2018-11-28 10:49:06,244 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1531 [2018-11-28 10:49:06,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:06,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:06,245 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:06,245 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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-28 10:49:06,245 INFO L794 eck$LassoCheckResult]: Stem: 17961#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 17928#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17930#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17957#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17924#L40-1 mp_add_~nb~0 := 4; 17925#L50 assume !(0 == mp_add_~b3~0 % 256); 17949#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17950#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18883#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18878#L65 [2018-11-28 10:49:06,245 INFO L796 eck$LassoCheckResult]: Loop: 18878#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18879#L65-2 assume !(1 == mp_add_~i~0 % 256); 19167#L66-1 assume !(2 == mp_add_~i~0 % 256); 19166#L67-1 assume !(3 == mp_add_~i~0 % 256); 19165#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19164#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 19163#L71-2 assume !(1 == mp_add_~i~0 % 256); 19162#L72-1 assume !(2 == mp_add_~i~0 % 256); 19161#L73-1 assume !(3 == mp_add_~i~0 % 256); 19160#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19159#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 19158#L80-1 assume !(1 == mp_add_~i~0 % 256); 19157#L81-1 assume !(2 == mp_add_~i~0 % 256); 19156#L82-1 assume !(3 == mp_add_~i~0 % 256); 19155#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19154#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19153#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19137#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19135#L71 assume !(0 == mp_add_~i~0 % 256); 19133#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 18987#L72-1 assume !(2 == mp_add_~i~0 % 256); 19130#L73-1 assume !(3 == mp_add_~i~0 % 256); 19126#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; 19124#L76-1 assume !(0 == mp_add_~i~0 % 256); 19121#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 19122#L81-1 assume !(2 == mp_add_~i~0 % 256); 19115#L82-1 assume !(3 == mp_add_~i~0 % 256); 19116#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19144#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19142#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19101#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19099#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; 19098#L76-1 assume !(0 == mp_add_~i~0 % 256); 19096#L80-1 assume !(1 == mp_add_~i~0 % 256); 19094#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 19092#L82-1 assume !(3 == mp_add_~i~0 % 256); 19068#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19069#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19051#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19052#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19072#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; 19081#L76-1 assume !(0 == mp_add_~i~0 % 256); 19080#L80-1 assume !(1 == mp_add_~i~0 % 256); 19030#L81-1 assume !(2 == mp_add_~i~0 % 256); 19004#L82-1 assume !(3 == mp_add_~i~0 % 256); 18993#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19022#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19019#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18878#L65 [2018-11-28 10:49:06,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:06,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 3 times [2018-11-28 10:49:06,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:06,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:06,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:06,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:06,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:06,258 INFO L82 PathProgramCache]: Analyzing trace with hash 310688569, now seen corresponding path program 1 times [2018-11-28 10:49:06,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:06,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:06,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:49:06,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 10:49:06,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:49:06,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 10:49:06,320 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:49:06,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 10:49:06,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 10:49:06,320 INFO L87 Difference]: Start difference. First operand 1614 states and 1970 transitions. cyclomatic complexity: 364 Second operand 4 states. [2018-11-28 10:49:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:06,392 INFO L93 Difference]: Finished difference Result 2008 states and 2388 transitions. [2018-11-28 10:49:06,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 10:49:06,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2008 states and 2388 transitions. [2018-11-28 10:49:06,398 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1910 [2018-11-28 10:49:06,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2008 states to 2008 states and 2388 transitions. [2018-11-28 10:49:06,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2008 [2018-11-28 10:49:06,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2008 [2018-11-28 10:49:06,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2008 states and 2388 transitions. [2018-11-28 10:49:06,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:06,409 INFO L705 BuchiCegarLoop]: Abstraction has 2008 states and 2388 transitions. [2018-11-28 10:49:06,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states and 2388 transitions. [2018-11-28 10:49:06,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1701. [2018-11-28 10:49:06,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2018-11-28 10:49:06,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2043 transitions. [2018-11-28 10:49:06,436 INFO L728 BuchiCegarLoop]: Abstraction has 1701 states and 2043 transitions. [2018-11-28 10:49:06,436 INFO L608 BuchiCegarLoop]: Abstraction has 1701 states and 2043 transitions. [2018-11-28 10:49:06,436 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 10:49:06,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1701 states and 2043 transitions. [2018-11-28 10:49:06,440 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1618 [2018-11-28 10:49:06,440 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:06,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:06,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:06,441 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:06,441 INFO L794 eck$LassoCheckResult]: Stem: 21582#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 21556#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21557#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21579#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21584#L40-1 mp_add_~nb~0 := 4; 22430#L50 assume !(0 == mp_add_~b3~0 % 256); 22427#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22428#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22406#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22405#L65 [2018-11-28 10:49:06,441 INFO L796 eck$LassoCheckResult]: Loop: 22405#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22404#L65-2 assume !(1 == mp_add_~i~0 % 256); 22403#L66-1 assume !(2 == mp_add_~i~0 % 256); 22402#L67-1 assume !(3 == mp_add_~i~0 % 256); 22401#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22400#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22399#L71-2 assume !(1 == mp_add_~i~0 % 256); 22398#L72-1 assume !(2 == mp_add_~i~0 % 256); 22397#L73-1 assume !(3 == mp_add_~i~0 % 256); 22396#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22392#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22388#L80-1 assume !(1 == mp_add_~i~0 % 256); 22387#L81-1 assume !(2 == mp_add_~i~0 % 256); 22386#L82-1 assume !(3 == mp_add_~i~0 % 256); 22385#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22384#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22382#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22380#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22378#L71 assume !(0 == mp_add_~i~0 % 256); 22377#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 22274#L72-1 assume !(2 == mp_add_~i~0 % 256); 22376#L73-1 assume !(3 == mp_add_~i~0 % 256); 22375#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; 22064#L76-1 assume !(0 == mp_add_~i~0 % 256); 22065#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22058#L81-1 assume !(2 == mp_add_~i~0 % 256); 22059#L82-1 assume !(3 == mp_add_~i~0 % 256); 22383#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22381#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22379#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22366#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22365#L71 assume !(0 == mp_add_~i~0 % 256); 22352#L71-2 assume !(1 == mp_add_~i~0 % 256); 22351#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 21657#L73-1 assume !(3 == mp_add_~i~0 % 256); 21658#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; 22525#L76-1 assume !(0 == mp_add_~i~0 % 256); 22521#L80-1 assume !(1 == mp_add_~i~0 % 256); 22517#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22513#L82-1 assume !(3 == mp_add_~i~0 % 256); 22512#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22511#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22509#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22506#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22505#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22504#L76-1 assume !(0 == mp_add_~i~0 % 256); 22502#L80-1 assume !(1 == mp_add_~i~0 % 256); 22432#L81-1 assume !(2 == mp_add_~i~0 % 256); 22433#L82-1 assume !(3 == mp_add_~i~0 % 256); 22429#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22415#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22416#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22405#L65 [2018-11-28 10:49:06,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 4 times [2018-11-28 10:49:06,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:06,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:06,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:06,452 INFO L82 PathProgramCache]: Analyzing trace with hash 959804995, now seen corresponding path program 1 times [2018-11-28 10:49:06,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:49:06,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-28 10:49:06,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:06,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:06,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:06,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 10:49:06,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:49:06,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2018-11-28 10:49:06,754 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:49:06,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 10:49:06,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-11-28 10:49:06,754 INFO L87 Difference]: Start difference. First operand 1701 states and 2043 transitions. cyclomatic complexity: 350 Second operand 11 states. [2018-11-28 10:49:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:07,353 INFO L93 Difference]: Finished difference Result 2638 states and 3046 transitions. [2018-11-28 10:49:07,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 10:49:07,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2638 states and 3046 transitions. [2018-11-28 10:49:07,359 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 2419 [2018-11-28 10:49:07,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2638 states to 2543 states and 2945 transitions. [2018-11-28 10:49:07,366 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2543 [2018-11-28 10:49:07,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2543 [2018-11-28 10:49:07,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2543 states and 2945 transitions. [2018-11-28 10:49:07,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:07,370 INFO L705 BuchiCegarLoop]: Abstraction has 2543 states and 2945 transitions. [2018-11-28 10:49:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states and 2945 transitions. [2018-11-28 10:49:07,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 1750. [2018-11-28 10:49:07,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-11-28 10:49:07,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2085 transitions. [2018-11-28 10:49:07,398 INFO L728 BuchiCegarLoop]: Abstraction has 1750 states and 2085 transitions. [2018-11-28 10:49:07,398 INFO L608 BuchiCegarLoop]: Abstraction has 1750 states and 2085 transitions. [2018-11-28 10:49:07,399 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 10:49:07,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1750 states and 2085 transitions. [2018-11-28 10:49:07,403 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1668 [2018-11-28 10:49:07,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:07,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:07,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:07,404 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:07,404 INFO L794 eck$LassoCheckResult]: Stem: 26121#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 26091#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 26092#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 26117#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 26122#L40-1 mp_add_~nb~0 := 4; 26113#L50 assume !(0 == mp_add_~b3~0 % 256); 26114#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 27120#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27119#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27118#L65 [2018-11-28 10:49:07,404 INFO L796 eck$LassoCheckResult]: Loop: 27118#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 27117#L65-2 assume !(1 == mp_add_~i~0 % 256); 27116#L66-1 assume !(2 == mp_add_~i~0 % 256); 27115#L67-1 assume !(3 == mp_add_~i~0 % 256); 27114#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27113#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 27112#L71-2 assume !(1 == mp_add_~i~0 % 256); 27111#L72-1 assume !(2 == mp_add_~i~0 % 256); 27110#L73-1 assume !(3 == mp_add_~i~0 % 256); 27109#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27108#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 27107#L80-1 assume !(1 == mp_add_~i~0 % 256); 27106#L81-1 assume !(2 == mp_add_~i~0 % 256); 27105#L82-1 assume !(3 == mp_add_~i~0 % 256); 27103#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27104#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27214#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27053#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27054#L71 assume !(0 == mp_add_~i~0 % 256); 27050#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 26572#L72-1 assume !(2 == mp_add_~i~0 % 256); 26573#L73-1 assume !(3 == mp_add_~i~0 % 256); 26567#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; 26569#L76-1 assume !(0 == mp_add_~i~0 % 256); 27230#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 27229#L81-1 assume !(2 == mp_add_~i~0 % 256); 27228#L82-1 assume !(3 == mp_add_~i~0 % 256); 27227#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27226#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27225#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27224#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27223#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27209#L76-1 assume !(0 == mp_add_~i~0 % 256); 27200#L80-1 assume !(1 == mp_add_~i~0 % 256); 27198#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 27196#L82-1 assume !(3 == mp_add_~i~0 % 256); 26545#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26155#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26156#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27191#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27179#L71 assume !(0 == mp_add_~i~0 % 256); 27156#L71-2 assume !(1 == mp_add_~i~0 % 256); 27145#L72-1 assume !(2 == mp_add_~i~0 % 256); 27136#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 27132#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; 27130#L76-1 assume !(0 == mp_add_~i~0 % 256); 27128#L80-1 assume !(1 == mp_add_~i~0 % 256); 27126#L81-1 assume !(2 == mp_add_~i~0 % 256); 27124#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 27123#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26994#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26995#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26988#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26990#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26911#L76-1 assume !(0 == mp_add_~i~0 % 256); 26912#L80-1 assume !(1 == mp_add_~i~0 % 256); 26908#L81-1 assume !(2 == mp_add_~i~0 % 256); 26903#L82-1 assume !(3 == mp_add_~i~0 % 256); 26904#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26899#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26900#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27118#L65 [2018-11-28 10:49:07,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 5 times [2018-11-28 10:49:07,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:07,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:07,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:07,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:07,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:07,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1780505291, now seen corresponding path program 1 times [2018-11-28 10:49:07,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:07,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:07,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:49:07,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-28 10:49:07,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 10:49:07,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 10:49:07,539 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:49:07,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:49:07,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:49:07,539 INFO L87 Difference]: Start difference. First operand 1750 states and 2085 transitions. cyclomatic complexity: 342 Second operand 8 states. [2018-11-28 10:49:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:07,822 INFO L93 Difference]: Finished difference Result 1163 states and 1285 transitions. [2018-11-28 10:49:07,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 10:49:07,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1163 states and 1285 transitions. [2018-11-28 10:49:07,826 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 906 [2018-11-28 10:49:07,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1163 states to 1084 states and 1200 transitions. [2018-11-28 10:49:07,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1084 [2018-11-28 10:49:07,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1084 [2018-11-28 10:49:07,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1084 states and 1200 transitions. [2018-11-28 10:49:07,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:07,838 INFO L705 BuchiCegarLoop]: Abstraction has 1084 states and 1200 transitions. [2018-11-28 10:49:07,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states and 1200 transitions. [2018-11-28 10:49:07,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 933. [2018-11-28 10:49:07,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2018-11-28 10:49:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1038 transitions. [2018-11-28 10:49:07,848 INFO L728 BuchiCegarLoop]: Abstraction has 933 states and 1038 transitions. [2018-11-28 10:49:07,848 INFO L608 BuchiCegarLoop]: Abstraction has 933 states and 1038 transitions. [2018-11-28 10:49:07,848 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 10:49:07,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 933 states and 1038 transitions. [2018-11-28 10:49:07,850 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 810 [2018-11-28 10:49:07,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:07,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:07,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:07,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:07,851 INFO L794 eck$LassoCheckResult]: Stem: 29050#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 29023#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 29025#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 29048#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 29019#L40-1 mp_add_~nb~0 := 4; 29020#L50 assume !(0 == mp_add_~b3~0 % 256); 29045#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29585#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29583#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29580#L65 [2018-11-28 10:49:07,851 INFO L796 eck$LassoCheckResult]: Loop: 29580#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29579#L65-2 assume !(1 == mp_add_~i~0 % 256); 29578#L66-1 assume !(2 == mp_add_~i~0 % 256); 29575#L67-1 assume !(3 == mp_add_~i~0 % 256); 29576#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29570#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 29571#L71-2 assume !(1 == mp_add_~i~0 % 256); 29566#L72-1 assume !(2 == mp_add_~i~0 % 256); 29567#L73-1 assume !(3 == mp_add_~i~0 % 256); 29562#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29563#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 29558#L80-1 assume !(1 == mp_add_~i~0 % 256); 29559#L81-1 assume !(2 == mp_add_~i~0 % 256); 29554#L82-1 assume !(3 == mp_add_~i~0 % 256); 29555#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29551#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29076#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29374#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29375#L71 assume !(0 == mp_add_~i~0 % 256); 29705#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 29704#L72-1 assume !(2 == mp_add_~i~0 % 256); 29703#L73-1 assume !(3 == mp_add_~i~0 % 256); 29702#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; 29701#L76-1 assume !(0 == mp_add_~i~0 % 256); 29700#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 29699#L81-1 assume !(2 == mp_add_~i~0 % 256); 29698#L82-1 assume !(3 == mp_add_~i~0 % 256); 29366#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29367#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29331#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29332#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29314#L71 assume !(0 == mp_add_~i~0 % 256); 29309#L71-2 assume !(1 == mp_add_~i~0 % 256); 29310#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 29105#L73-1 assume !(3 == mp_add_~i~0 % 256); 29106#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29692#L76-1 assume !(0 == mp_add_~i~0 % 256); 29690#L80-1 assume !(1 == mp_add_~i~0 % 256); 29688#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 29686#L82-1 assume !(3 == mp_add_~i~0 % 256); 29654#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29652#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29650#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29647#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29643#L71 assume !(0 == mp_add_~i~0 % 256); 29639#L71-2 assume !(1 == mp_add_~i~0 % 256); 29635#L72-1 assume !(2 == mp_add_~i~0 % 256); 29629#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 29623#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; 29619#L76-1 assume !(0 == mp_add_~i~0 % 256); 29615#L80-1 assume !(1 == mp_add_~i~0 % 256); 29611#L81-1 assume !(2 == mp_add_~i~0 % 256); 29608#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 29606#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29604#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29601#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29598#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29596#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29594#L76-1 assume !(0 == mp_add_~i~0 % 256); 29592#L80-1 assume !(1 == mp_add_~i~0 % 256); 29591#L81-1 assume !(2 == mp_add_~i~0 % 256); 29588#L82-1 assume !(3 == mp_add_~i~0 % 256); 29586#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29581#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29582#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29580#L65 [2018-11-28 10:49:07,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 6 times [2018-11-28 10:49:07,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:07,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:07,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:07,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1997619351, now seen corresponding path program 1 times [2018-11-28 10:49:07,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:07,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:07,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:49:07,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 10:49:07,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:07,968 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:07,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:07,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 88 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 10:49:08,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:49:08,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 12 [2018-11-28 10:49:08,049 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:49:08,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:49:08,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:49:08,050 INFO L87 Difference]: Start difference. First operand 933 states and 1038 transitions. cyclomatic complexity: 112 Second operand 12 states. [2018-11-28 10:49:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:09,367 INFO L93 Difference]: Finished difference Result 1984 states and 2109 transitions. [2018-11-28 10:49:09,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-28 10:49:09,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1984 states and 2109 transitions. [2018-11-28 10:49:09,370 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 866 [2018-11-28 10:49:09,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1984 states to 1902 states and 2023 transitions. [2018-11-28 10:49:09,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1902 [2018-11-28 10:49:09,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1902 [2018-11-28 10:49:09,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1902 states and 2023 transitions. [2018-11-28 10:49:09,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:09,375 INFO L705 BuchiCegarLoop]: Abstraction has 1902 states and 2023 transitions. [2018-11-28 10:49:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states and 2023 transitions. [2018-11-28 10:49:09,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 926. [2018-11-28 10:49:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2018-11-28 10:49:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1006 transitions. [2018-11-28 10:49:09,388 INFO L728 BuchiCegarLoop]: Abstraction has 926 states and 1006 transitions. [2018-11-28 10:49:09,388 INFO L608 BuchiCegarLoop]: Abstraction has 926 states and 1006 transitions. [2018-11-28 10:49:09,388 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 10:49:09,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 926 states and 1006 transitions. [2018-11-28 10:49:09,390 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 478 [2018-11-28 10:49:09,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:09,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:09,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:09,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:09,392 INFO L794 eck$LassoCheckResult]: Stem: 32272#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 32249#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 32250#L42 assume !(0 == mp_add_~a2~0 % 256); 32271#L40-1 mp_add_~nb~0 := 4; 32379#L50 assume !(0 == mp_add_~b3~0 % 256); 32376#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 32374#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32375#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32370#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32369#L65-2 assume !(1 == mp_add_~i~0 % 256); 32368#L66-1 assume !(2 == mp_add_~i~0 % 256); 32367#L67-1 assume !(3 == mp_add_~i~0 % 256); 32366#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32365#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32364#L71-2 assume !(1 == mp_add_~i~0 % 256); 32363#L72-1 assume !(2 == mp_add_~i~0 % 256); 32362#L73-1 assume !(3 == mp_add_~i~0 % 256); 32360#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; 32361#L76-1 [2018-11-28 10:49:09,392 INFO L796 eck$LassoCheckResult]: Loop: 32361#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32502#L80-1 assume !(1 == mp_add_~i~0 % 256); 32501#L81-1 assume !(2 == mp_add_~i~0 % 256); 32500#L82-1 assume !(3 == mp_add_~i~0 % 256); 32499#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32498#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32497#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32348#L65 assume !(0 == mp_add_~i~0 % 256); 32347#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 32346#L66-1 assume !(2 == mp_add_~i~0 % 256); 32345#L67-1 assume !(3 == mp_add_~i~0 % 256); 32344#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32343#L71 assume !(0 == mp_add_~i~0 % 256); 32342#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 32341#L72-1 assume !(2 == mp_add_~i~0 % 256); 32340#L73-1 assume !(3 == mp_add_~i~0 % 256); 32338#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; 32337#L76-1 assume !(0 == mp_add_~i~0 % 256); 32336#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 32335#L81-1 assume !(2 == mp_add_~i~0 % 256); 32334#L82-1 assume !(3 == mp_add_~i~0 % 256); 32333#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32332#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32330#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32331#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32324#L71 assume !(0 == mp_add_~i~0 % 256); 32455#L71-2 assume !(1 == mp_add_~i~0 % 256); 32453#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 32452#L73-1 assume !(3 == mp_add_~i~0 % 256); 32450#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; 32449#L76-1 assume !(0 == mp_add_~i~0 % 256); 32448#L80-1 assume !(1 == mp_add_~i~0 % 256); 32447#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 32446#L82-1 assume !(3 == mp_add_~i~0 % 256); 32445#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32444#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32442#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32440#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32438#L71 assume !(0 == mp_add_~i~0 % 256); 32436#L71-2 assume !(1 == mp_add_~i~0 % 256); 32434#L72-1 assume !(2 == mp_add_~i~0 % 256); 32432#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 32430#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32428#L76-1 assume !(0 == mp_add_~i~0 % 256); 32427#L80-1 assume !(1 == mp_add_~i~0 % 256); 32426#L81-1 assume !(2 == mp_add_~i~0 % 256); 32425#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 32423#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32422#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32421#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32420#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32419#L71 assume !(0 == mp_add_~i~0 % 256); 32418#L71-2 assume !(1 == mp_add_~i~0 % 256); 32417#L72-1 assume !(2 == mp_add_~i~0 % 256); 32416#L73-1 assume !(3 == mp_add_~i~0 % 256); 32415#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32414#L76-1 assume !(0 == mp_add_~i~0 % 256); 32413#L80-1 assume !(1 == mp_add_~i~0 % 256); 32412#L81-1 assume !(2 == mp_add_~i~0 % 256); 32411#L82-1 assume !(3 == mp_add_~i~0 % 256); 32410#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32409#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32408#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32396#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32407#L71 assume !(0 == mp_add_~i~0 % 256); 32406#L71-2 assume !(1 == mp_add_~i~0 % 256); 32405#L72-1 assume !(2 == mp_add_~i~0 % 256); 32404#L73-1 assume !(3 == mp_add_~i~0 % 256); 32403#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32402#L76-1 assume !(0 == mp_add_~i~0 % 256); 32401#L80-1 assume !(1 == mp_add_~i~0 % 256); 32400#L81-1 assume !(2 == mp_add_~i~0 % 256); 32399#L82-1 assume !(3 == mp_add_~i~0 % 256); 32398#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32397#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32395#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32392#L65 assume !(0 == mp_add_~i~0 % 256); 32390#L65-2 assume !(1 == mp_add_~i~0 % 256); 32391#L66-1 assume !(2 == mp_add_~i~0 % 256); 32386#L67-1 assume !(3 == mp_add_~i~0 % 256); 32387#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32384#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32383#L76-1 assume !(0 == mp_add_~i~0 % 256); 32382#L80-1 assume !(1 == mp_add_~i~0 % 256); 32381#L81-1 assume !(2 == mp_add_~i~0 % 256); 32380#L82-1 assume !(3 == mp_add_~i~0 % 256); 32377#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32378#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32371#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32372#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32393#L65-2 assume !(1 == mp_add_~i~0 % 256); 32703#L66-1 assume !(2 == mp_add_~i~0 % 256); 32702#L67-1 assume !(3 == mp_add_~i~0 % 256); 32701#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32700#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32699#L71-2 assume !(1 == mp_add_~i~0 % 256); 32698#L72-1 assume !(2 == mp_add_~i~0 % 256); 32697#L73-1 assume !(3 == mp_add_~i~0 % 256); 32696#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; 32361#L76-1 [2018-11-28 10:49:09,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:09,392 INFO L82 PathProgramCache]: Analyzing trace with hash 149431148, now seen corresponding path program 1 times [2018-11-28 10:49:09,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:09,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:09,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:09,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:09,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:09,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1662504361, now seen corresponding path program 1 times [2018-11-28 10:49:09,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:09,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:09,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:09,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 171 proven. 74 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 10:49:09,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:09,549 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:09,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:09,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:10,251 WARN L180 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-28 10:49:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 200 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 10:49:10,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:49:10,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2018-11-28 10:49:10,286 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:49:10,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 10:49:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=134, Unknown=1, NotChecked=0, Total=182 [2018-11-28 10:49:10,287 INFO L87 Difference]: Start difference. First operand 926 states and 1006 transitions. cyclomatic complexity: 87 Second operand 14 states. [2018-11-28 10:49:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:13,122 INFO L93 Difference]: Finished difference Result 1068 states and 1155 transitions. [2018-11-28 10:49:13,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-28 10:49:13,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1068 states and 1155 transitions. [2018-11-28 10:49:13,126 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 269 [2018-11-28 10:49:13,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1068 states to 1068 states and 1155 transitions. [2018-11-28 10:49:13,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1068 [2018-11-28 10:49:13,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1068 [2018-11-28 10:49:13,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1068 states and 1155 transitions. [2018-11-28 10:49:13,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:13,130 INFO L705 BuchiCegarLoop]: Abstraction has 1068 states and 1155 transitions. [2018-11-28 10:49:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states and 1155 transitions. [2018-11-28 10:49:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 467. [2018-11-28 10:49:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-11-28 10:49:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 511 transitions. [2018-11-28 10:49:13,137 INFO L728 BuchiCegarLoop]: Abstraction has 467 states and 511 transitions. [2018-11-28 10:49:13,137 INFO L608 BuchiCegarLoop]: Abstraction has 467 states and 511 transitions. [2018-11-28 10:49:13,137 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-28 10:49:13,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 467 states and 511 transitions. [2018-11-28 10:49:13,138 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 137 [2018-11-28 10:49:13,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:13,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:13,139 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:13,139 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:13,139 INFO L794 eck$LassoCheckResult]: Stem: 34619#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 34594#L40 assume !(0 == mp_add_~a3~0 % 256); 34595#L40-1 mp_add_~nb~0 := 4; 34742#L50 assume !(0 == mp_add_~b3~0 % 256); 34740#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34741#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34737#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34738#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34733#L65-2 assume !(1 == mp_add_~i~0 % 256); 34734#L66-1 assume !(2 == mp_add_~i~0 % 256); 34729#L67-1 assume !(3 == mp_add_~i~0 % 256); 34730#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34725#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34726#L71-2 assume !(1 == mp_add_~i~0 % 256); 34721#L72-1 assume !(2 == mp_add_~i~0 % 256); 34722#L73-1 assume !(3 == mp_add_~i~0 % 256); 34717#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; 34718#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 35040#L80-1 assume !(1 == mp_add_~i~0 % 256); 35039#L81-1 assume !(2 == mp_add_~i~0 % 256); 35038#L82-1 assume !(3 == mp_add_~i~0 % 256); 34710#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34711#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34707#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34706#L65 [2018-11-28 10:49:13,139 INFO L796 eck$LassoCheckResult]: Loop: 34706#L65 assume !(0 == mp_add_~i~0 % 256); 34705#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 34704#L66-1 assume !(2 == mp_add_~i~0 % 256); 34703#L67-1 assume !(3 == mp_add_~i~0 % 256); 34702#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34701#L71 assume !(0 == mp_add_~i~0 % 256); 34700#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 34699#L72-1 assume !(2 == mp_add_~i~0 % 256); 34698#L73-1 assume !(3 == mp_add_~i~0 % 256); 34696#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34694#L76-1 assume !(0 == mp_add_~i~0 % 256); 34695#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 34690#L81-1 assume !(2 == mp_add_~i~0 % 256); 34691#L82-1 assume !(3 == mp_add_~i~0 % 256); 34686#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34687#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34682#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34681#L65 assume !(0 == mp_add_~i~0 % 256); 34680#L65-2 assume !(1 == mp_add_~i~0 % 256); 34679#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 34678#L67-1 assume !(3 == mp_add_~i~0 % 256); 34677#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34676#L71 assume !(0 == mp_add_~i~0 % 256); 34675#L71-2 assume !(1 == mp_add_~i~0 % 256); 34674#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 34673#L73-1 assume !(3 == mp_add_~i~0 % 256); 34671#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; 34672#L76-1 assume !(0 == mp_add_~i~0 % 256); 34667#L80-1 assume !(1 == mp_add_~i~0 % 256); 34668#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 34663#L82-1 assume !(3 == mp_add_~i~0 % 256); 34664#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34659#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34660#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34656#L65 assume !(0 == mp_add_~i~0 % 256); 34655#L65-2 assume !(1 == mp_add_~i~0 % 256); 34654#L66-1 assume !(2 == mp_add_~i~0 % 256); 34653#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 34652#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34651#L71 assume !(0 == mp_add_~i~0 % 256); 34650#L71-2 assume !(1 == mp_add_~i~0 % 256); 34649#L72-1 assume !(2 == mp_add_~i~0 % 256); 34648#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 34646#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; 34645#L76-1 assume !(0 == mp_add_~i~0 % 256); 34644#L80-1 assume !(1 == mp_add_~i~0 % 256); 34643#L81-1 assume !(2 == mp_add_~i~0 % 256); 34642#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 34641#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34640#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34639#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34638#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34637#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34636#L76-1 assume !(0 == mp_add_~i~0 % 256); 34635#L80-1 assume !(1 == mp_add_~i~0 % 256); 34634#L81-1 assume !(2 == mp_add_~i~0 % 256); 34633#L82-1 assume !(3 == mp_add_~i~0 % 256); 34631#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34632#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34739#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34735#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34736#L65-2 assume !(1 == mp_add_~i~0 % 256); 34731#L66-1 assume !(2 == mp_add_~i~0 % 256); 34732#L67-1 assume !(3 == mp_add_~i~0 % 256); 34727#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34728#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34723#L71-2 assume !(1 == mp_add_~i~0 % 256); 34724#L72-1 assume !(2 == mp_add_~i~0 % 256); 34719#L73-1 assume !(3 == mp_add_~i~0 % 256); 34720#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34716#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 34715#L80-1 assume !(1 == mp_add_~i~0 % 256); 34714#L81-1 assume !(2 == mp_add_~i~0 % 256); 34712#L82-1 assume !(3 == mp_add_~i~0 % 256); 34713#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34708#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34709#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34706#L65 [2018-11-28 10:49:13,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:13,139 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 8 times [2018-11-28 10:49:13,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:13,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:13,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:13,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:13,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:13,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:13,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1681553115, now seen corresponding path program 1 times [2018-11-28 10:49:13,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:13,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:13,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:49:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 10:49:13,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:13,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:13,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:13,323 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 10:49:13,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:49:13,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-28 10:49:13,340 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 10:49:13,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 10:49:13,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-28 10:49:13,340 INFO L87 Difference]: Start difference. First operand 467 states and 511 transitions. cyclomatic complexity: 47 Second operand 8 states. [2018-11-28 10:49:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:13,781 INFO L93 Difference]: Finished difference Result 437 states and 466 transitions. [2018-11-28 10:49:13,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:49:13,781 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 437 states and 466 transitions. [2018-11-28 10:49:13,782 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 10:49:13,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 437 states to 370 states and 393 transitions. [2018-11-28 10:49:13,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2018-11-28 10:49:13,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2018-11-28 10:49:13,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 370 states and 393 transitions. [2018-11-28 10:49:13,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:13,783 INFO L705 BuchiCegarLoop]: Abstraction has 370 states and 393 transitions. [2018-11-28 10:49:13,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states and 393 transitions. [2018-11-28 10:49:13,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 278. [2018-11-28 10:49:13,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-28 10:49:13,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 299 transitions. [2018-11-28 10:49:13,787 INFO L728 BuchiCegarLoop]: Abstraction has 278 states and 299 transitions. [2018-11-28 10:49:13,787 INFO L608 BuchiCegarLoop]: Abstraction has 278 states and 299 transitions. [2018-11-28 10:49:13,787 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-28 10:49:13,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 299 transitions. [2018-11-28 10:49:13,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 10:49:13,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:13,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:13,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-11-28 10:49:13,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:13,789 INFO L794 eck$LassoCheckResult]: Stem: 35762#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 35755#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 35757#L42 assume !(0 == mp_add_~a2~0 % 256); 35751#L40-1 mp_add_~nb~0 := 4; 35752#L50 assume !(0 == mp_add_~b3~0 % 256); 35747#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 35748#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35771#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35772#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 35797#L65-2 assume !(1 == mp_add_~i~0 % 256); 35796#L66-1 assume !(2 == mp_add_~i~0 % 256); 35795#L67-1 assume !(3 == mp_add_~i~0 % 256); 35793#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35794#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 35893#L71-2 assume !(1 == mp_add_~i~0 % 256); 35789#L72-1 assume !(2 == mp_add_~i~0 % 256); 35787#L73-1 assume !(3 == mp_add_~i~0 % 256); 35788#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; 35890#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 35889#L80-1 assume !(1 == mp_add_~i~0 % 256); 35888#L81-1 assume !(2 == mp_add_~i~0 % 256); 35887#L82-1 assume !(3 == mp_add_~i~0 % 256); 35886#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35884#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35885#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35971#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35969#L71 assume !(0 == mp_add_~i~0 % 256); 35967#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 35966#L72-1 assume !(2 == mp_add_~i~0 % 256); 35964#L73-1 assume !(3 == mp_add_~i~0 % 256); 35965#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35962#L76-1 assume !(0 == mp_add_~i~0 % 256); 35961#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 35957#L81-1 assume !(2 == mp_add_~i~0 % 256); 35956#L82-1 assume !(3 == mp_add_~i~0 % 256); 35954#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35953#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35950#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35949#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35948#L71 assume !(0 == mp_add_~i~0 % 256); 35947#L71-2 assume !(1 == mp_add_~i~0 % 256); 35945#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 35943#L73-1 assume !(3 == mp_add_~i~0 % 256); 35932#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35931#L76-1 assume !(0 == mp_add_~i~0 % 256); 35929#L80-1 assume !(1 == mp_add_~i~0 % 256); 35927#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 35925#L82-1 assume !(3 == mp_add_~i~0 % 256); 35923#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35922#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35921#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35920#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35919#L71 assume !(0 == mp_add_~i~0 % 256); 35918#L71-2 assume !(1 == mp_add_~i~0 % 256); 35917#L72-1 assume !(2 == mp_add_~i~0 % 256); 35916#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 35914#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35913#L76-1 assume !(0 == mp_add_~i~0 % 256); 35912#L80-1 assume !(1 == mp_add_~i~0 % 256); 35911#L81-1 assume !(2 == mp_add_~i~0 % 256); 35910#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 35746#L83-1 [2018-11-28 10:49:13,790 INFO L796 eck$LassoCheckResult]: Loop: 35746#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35742#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35743#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35758#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35749#L71 assume !(0 == mp_add_~i~0 % 256); 35739#L71-2 assume !(1 == mp_add_~i~0 % 256); 35740#L72-1 assume !(2 == mp_add_~i~0 % 256); 35750#L73-1 assume !(3 == mp_add_~i~0 % 256); 35744#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35745#L76-1 assume !(0 == mp_add_~i~0 % 256); 35737#L80-1 assume !(1 == mp_add_~i~0 % 256); 35738#L81-1 assume !(2 == mp_add_~i~0 % 256); 35741#L82-1 assume !(3 == mp_add_~i~0 % 256); 35746#L83-1 [2018-11-28 10:49:13,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:13,791 INFO L82 PathProgramCache]: Analyzing trace with hash -959140882, now seen corresponding path program 1 times [2018-11-28 10:49:13,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:13,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:13,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:13,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:13,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:13,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-28 10:49:13,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:13,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:13,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:13,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 10:49:14,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:49:14,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-28 10:49:14,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 10:49:14,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:14,003 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 1 times [2018-11-28 10:49:14,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:14,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:14,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:14,112 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:49:14,113 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:49:14,113 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:49:14,113 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:49:14,113 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:49:14,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:49:14,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:49:14,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:49:14,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-28 10:49:14,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:49:14,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:49:14,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-28 10:49:14,119 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-28 10:49:14,249 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:49:14,249 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:49:14,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:49:14,254 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:49:14,259 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 10:49:14,259 INFO L448 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_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:49:14,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:49:14,275 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:49:14,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:49:14,311 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:49:16,765 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 10:49:16,767 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:49:16,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:49:16,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:49:16,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:49:16,767 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:49:16,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:49:16,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:49:16,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:49:16,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-28 10:49:16,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:49:16,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:49:16,768 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-28 10:49:16,773 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-28 10:49:16,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:49:16,907 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:49:16,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,908 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:49:16,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:49:16,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:49:16,909 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:49:16,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,911 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 10:49:16,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,912 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:16,913 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:16,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,914 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:16,915 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:16,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,917 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 10:49:16,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,919 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:16,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:16,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,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-28 10:49:16,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,921 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:16,921 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:16,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,925 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 10:49:16,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,926 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:16,926 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:16,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,927 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,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-28 10:49:16,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:16,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,928 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:16,929 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:16,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,933 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 10:49:16,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,934 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:16,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,934 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:16,935 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:16,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,936 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:16,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,937 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:16,938 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:16,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,942 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 10:49:16,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,943 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:49:16,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,943 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:16,944 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:16,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,947 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:49:16,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:16,949 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:16,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,958 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 10:49:16,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-28 10:49:16,958 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,958 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:16,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,959 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:16,960 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:16,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,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-28 10:49:16,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,962 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:16,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,963 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:16,965 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:16,966 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,975 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 10:49:16,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,976 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:16,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:16,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:16,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,980 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:16,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,980 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:16,981 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:16,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,987 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 10:49:16,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,987 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:16,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,988 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:49:16,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:49:16,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:16,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:16,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:16,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:16,994 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:16,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:16,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:16,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:16,994 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:49:16,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:49:16,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:17,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:17,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 10:49:17,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-28 10:49:17,007 INFO L87 Difference]: Start difference. First operand 278 states and 299 transitions. cyclomatic complexity: 22 Second operand 12 states. [2018-11-28 10:49:17,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:17,669 INFO L93 Difference]: Finished difference Result 392 states and 412 transitions. [2018-11-28 10:49:17,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 10:49:17,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 392 states and 412 transitions. [2018-11-28 10:49:17,670 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2018-11-28 10:49:17,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 392 states to 373 states and 393 transitions. [2018-11-28 10:49:17,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2018-11-28 10:49:17,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-28 10:49:17,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 393 transitions. [2018-11-28 10:49:17,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:17,671 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 393 transitions. [2018-11-28 10:49:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 393 transitions. [2018-11-28 10:49:17,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 257. [2018-11-28 10:49:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-28 10:49:17,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 273 transitions. [2018-11-28 10:49:17,674 INFO L728 BuchiCegarLoop]: Abstraction has 257 states and 273 transitions. [2018-11-28 10:49:17,674 INFO L608 BuchiCegarLoop]: Abstraction has 257 states and 273 transitions. [2018-11-28 10:49:17,674 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-28 10:49:17,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 273 transitions. [2018-11-28 10:49:17,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 10:49:17,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 10:49:17,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 10:49:17,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-11-28 10:49:17,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 10:49:17,676 INFO L794 eck$LassoCheckResult]: Stem: 36636#ULTIMATE.startENTRY 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_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;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; 36628#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36630#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36634#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36640#L40-1 mp_add_~nb~0 := 4; 36688#L50 assume !(0 == mp_add_~b3~0 % 256); 36687#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 36686#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36685#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36643#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 36632#L65-2 assume !(1 == mp_add_~i~0 % 256); 36633#L66-1 assume !(2 == mp_add_~i~0 % 256); 36639#L67-1 assume !(3 == mp_add_~i~0 % 256); 36855#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36854#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 36853#L71-2 assume !(1 == mp_add_~i~0 % 256); 36852#L72-1 assume !(2 == mp_add_~i~0 % 256); 36851#L73-1 assume !(3 == mp_add_~i~0 % 256); 36849#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36848#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36847#L80-1 assume !(1 == mp_add_~i~0 % 256); 36846#L81-1 assume !(2 == mp_add_~i~0 % 256); 36845#L82-1 assume !(3 == mp_add_~i~0 % 256); 36844#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36843#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36842#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36841#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36840#L71 assume !(0 == mp_add_~i~0 % 256); 36839#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 36838#L72-1 assume !(2 == mp_add_~i~0 % 256); 36837#L73-1 assume !(3 == mp_add_~i~0 % 256); 36828#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36826#L76-1 assume !(0 == mp_add_~i~0 % 256); 36824#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 36822#L81-1 assume !(2 == mp_add_~i~0 % 256); 36820#L82-1 assume !(3 == mp_add_~i~0 % 256); 36818#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36817#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36816#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36815#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36814#L71 assume !(0 == mp_add_~i~0 % 256); 36813#L71-2 assume !(1 == mp_add_~i~0 % 256); 36812#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 36811#L73-1 assume !(3 == mp_add_~i~0 % 256); 36800#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36799#L76-1 assume !(0 == mp_add_~i~0 % 256); 36798#L80-1 assume !(1 == mp_add_~i~0 % 256); 36797#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 36796#L82-1 assume !(3 == mp_add_~i~0 % 256); 36795#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36794#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36788#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36787#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36785#L71 assume !(0 == mp_add_~i~0 % 256); 36783#L71-2 assume !(1 == mp_add_~i~0 % 256); 36781#L72-1 assume !(2 == mp_add_~i~0 % 256); 36779#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 36777#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36776#L76-1 assume !(0 == mp_add_~i~0 % 256); 36775#L80-1 assume !(1 == mp_add_~i~0 % 256); 36774#L81-1 assume !(2 == mp_add_~i~0 % 256); 36773#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 36619#L83-1 [2018-11-28 10:49:17,676 INFO L796 eck$LassoCheckResult]: Loop: 36619#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36615#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36616#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36631#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36623#L71 assume !(0 == mp_add_~i~0 % 256); 36612#L71-2 assume !(1 == mp_add_~i~0 % 256); 36613#L72-1 assume !(2 == mp_add_~i~0 % 256); 36622#L73-1 assume !(3 == mp_add_~i~0 % 256); 36617#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36618#L76-1 assume !(0 == mp_add_~i~0 % 256); 36610#L80-1 assume !(1 == mp_add_~i~0 % 256); 36611#L81-1 assume !(2 == mp_add_~i~0 % 256); 36614#L82-1 assume !(3 == mp_add_~i~0 % 256); 36619#L83-1 [2018-11-28 10:49:17,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash 773605064, now seen corresponding path program 1 times [2018-11-28 10:49:17,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:17,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:17,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:17,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:17,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:17,699 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 2 times [2018-11-28 10:49:17,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:17,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:17,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:17,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 10:49:17,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 10:49:17,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 10:49:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash -600207712, now seen corresponding path program 2 times [2018-11-28 10:49:17,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 10:49:17,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 10:49:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:17,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 10:49:17,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 10:49:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 10:49:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-28 10:49:17,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 10:49:17,935 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 10:49:17,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 10:49:17,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 10:49:17,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 10:49:17,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 10:49:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-28 10:49:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 10:49:18,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-28 10:49:18,152 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:49:18,152 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:49:18,152 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:49:18,152 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:49:18,152 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 10:49:18,152 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:49:18,152 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:49:18,152 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:49:18,152 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-28 10:49:18,153 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:49:18,153 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:49:18,153 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-28 10:49:18,169 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-28 10:49:18,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:49:18,314 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:49:18,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 10:49:18,317 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_65bbea4d-ec67-4ccb-bb15-c7b338976c3d/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-28 10:49:18,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 10:49:18,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 10:49:19,437 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 10:49:19,441 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 10:49:19,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 10:49:19,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 10:49:19,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 10:49:19,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 10:49:19,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 10:49:19,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 10:49:19,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 10:49:19,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-28 10:49:19,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 10:49:19,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 10:49:19,443 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-28 10:49:19,455 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-28 10:49:19,628 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 10:49:19,628 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 10:49:19,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:49:19,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:49:19,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,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-28 10:49:19,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 10:49:19,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 10:49:19,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,634 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 10:49:19,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-28 10:49:19,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,635 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:19,636 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:19,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,639 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:19,639 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:19,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,640 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 10:49:19,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-28 10:49:19,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:19,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:19,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:19,646 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:19,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,647 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 10:49:19,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,648 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:19,649 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:19,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,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-28 10:49:19,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 10:49:19,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,653 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:19,654 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:19,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,655 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 10:49:19,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,656 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:19,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,656 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:19,657 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:19,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,662 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,662 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:19,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,662 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 10:49:19,663 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 10:49:19,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,664 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 10:49:19,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,665 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:49:19,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,665 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:19,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:19,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,678 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 10:49:19,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:19,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:19,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,681 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 10:49:19,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,682 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:19,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,682 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:19,685 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:19,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,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-28 10:49:19,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,695 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:19,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,695 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 10:49:19,697 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 10:49:19,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,698 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 10:49:19,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-28 10:49:19,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,698 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:19,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:19,700 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:19,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,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-28 10:49:19,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,705 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 10:49:19,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,706 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 10:49:19,706 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 10:49:19,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,709 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 10:49:19,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,709 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,709 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:19,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,710 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:49:19,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:49:19,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 10:49:19,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 10:49:19,722 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 10:49:19,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 10:49:19,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 10:49:19,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 10:49:19,723 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 10:49:19,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 10:49:19,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 10:49:19,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 10:49:19,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 10:49:19,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-28 10:49:19,728 INFO L87 Difference]: Start difference. First operand 257 states and 273 transitions. cyclomatic complexity: 17 Second operand 16 states. [2018-11-28 10:49:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 10:49:20,365 INFO L93 Difference]: Finished difference Result 251 states and 266 transitions. [2018-11-28 10:49:20,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 10:49:20,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 266 transitions. [2018-11-28 10:49:20,367 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:49:20,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 0 states and 0 transitions. [2018-11-28 10:49:20,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 10:49:20,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 10:49:20,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 10:49:20,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 10:49:20,367 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:49:20,367 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:49:20,368 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 10:49:20,368 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-28 10:49:20,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 10:49:20,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 10:49:20,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 10:49:20,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 10:49:20 BoogieIcfgContainer [2018-11-28 10:49:20,375 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 10:49:20,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 10:49:20,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 10:49:20,376 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 10:49:20,376 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:48:10" (3/4) ... [2018-11-28 10:49:20,380 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 10:49:20,380 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 10:49:20,380 INFO L168 Benchmark]: Toolchain (without parser) took 70249.53 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 414.2 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -325.2 MB). Peak memory consumption was 89.0 MB. Max. memory is 11.5 GB. [2018-11-28 10:49:20,381 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:49:20,381 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.28 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 938.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 10:49:20,382 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 938.8 MB in the beginning and 1.2 GB in the end (delta: -225.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2018-11-28 10:49:20,382 INFO L168 Benchmark]: Boogie Preprocessor took 18.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:49:20,383 INFO L168 Benchmark]: RCFGBuilder took 277.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-11-28 10:49:20,383 INFO L168 Benchmark]: BuchiAutomizer took 69648.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -136.6 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. [2018-11-28 10:49:20,384 INFO L168 Benchmark]: Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 10:49:20,387 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 222.28 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 938.8 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 74.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 938.8 MB in the beginning and 1.2 GB in the end (delta: -225.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 277.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 69648.86 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 244.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -136.6 MB). Peak memory consumption was 108.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.38 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (25 trivial, 0 deterministic, 0 nondeterministic). 25 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 69.6s and 26 iterations. TraceHistogramMax:7. Analysis of lassos took 27.9s. Construction of modules took 33.9s. Büchi inclusion checks took 7.0s. Highest rank in rank-based complementation 0. Minimization of det autom 25. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 5643 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1750 states and ocurred in iteration 19. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1043 SDtfs, 4995 SDslu, 2088 SDs, 0 SdLazy, 8916 SolverSat, 773 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 33.9s Time LassoAnalysisResults: nont0 unkn0 SFLI15 SFLT0 conc4 concLT0 SILN0 SILU2 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf98 lsp64 ukn100 mio100 lsp100 div580 bol100 ite100 ukn100 eq143 hnf42 smp84 dnf100 smp100 tf102 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 12ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 19.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...