./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 11:52:51,452 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 11:52:51,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 11:52:51,460 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 11:52:51,460 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 11:52:51,461 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 11:52:51,462 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 11:52:51,463 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 11:52:51,464 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 11:52:51,464 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 11:52:51,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 11:52:51,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 11:52:51,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 11:52:51,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 11:52:51,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 11:52:51,467 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 11:52:51,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 11:52:51,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 11:52:51,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 11:52:51,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 11:52:51,472 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 11:52:51,473 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 11:52:51,475 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 11:52:51,475 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 11:52:51,475 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 11:52:51,476 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 11:52:51,476 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 11:52:51,477 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 11:52:51,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 11:52:51,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 11:52:51,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 11:52:51,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 11:52:51,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 11:52:51,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 11:52:51,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 11:52:51,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 11:52:51,480 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 11:52:51,491 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 11:52:51,492 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 11:52:51,492 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 11:52:51,493 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 11:52:51,493 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 11:52:51,493 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 11:52:51,493 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 11:52:51,493 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 11:52:51,493 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 11:52:51,493 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 11:52:51,494 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 11:52:51,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 11:52:51,494 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 11:52:51,494 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 11:52:51,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 11:52:51,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 11:52:51,494 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 11:52:51,494 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 11:52:51,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 11:52:51,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 11:52:51,495 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 11:52:51,495 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 11:52:51,495 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 11:52:51,495 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 11:52:51,495 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 11:52:51,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 11:52:51,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 11:52:51,496 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 11:52:51,496 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 11:52:51,496 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 11:52:51,496 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 11:52:51,497 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 11:52:51,497 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_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2018-11-28 11:52:51,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 11:52:51,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 11:52:51,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 11:52:51,530 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 11:52:51,531 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 11:52:51,531 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-28 11:52:51,571 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/data/e0bbae55f/e3d4951fa59046c4bd651d876a012d97/FLAG5fb919a44 [2018-11-28 11:52:51,973 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 11:52:51,973 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/sv-benchmarks/c/bitvector/byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-28 11:52:51,977 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/data/e0bbae55f/e3d4951fa59046c4bd651d876a012d97/FLAG5fb919a44 [2018-11-28 11:52:51,986 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/data/e0bbae55f/e3d4951fa59046c4bd651d876a012d97 [2018-11-28 11:52:51,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 11:52:51,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 11:52:51,989 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 11:52:51,989 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 11:52:51,992 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 11:52:51,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:52:51" (1/1) ... [2018-11-28 11:52:51,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3389b3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:51, skipping insertion in model container [2018-11-28 11:52:51,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:52:51" (1/1) ... [2018-11-28 11:52:52,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 11:52:52,016 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 11:52:52,143 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:52:52,146 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 11:52:52,168 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 11:52:52,177 INFO L195 MainTranslator]: Completed translation [2018-11-28 11:52:52,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52 WrapperNode [2018-11-28 11:52:52,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 11:52:52,178 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 11:52:52,178 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 11:52:52,178 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 11:52:52,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 11:52:52,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 11:52:52,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 11:52:52,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 11:52:52,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,261 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... [2018-11-28 11:52:52,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 11:52:52,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 11:52:52,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 11:52:52,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 11:52:52,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:52:52,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 11:52:52,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 11:52:52,543 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 11:52:52,543 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-28 11:52:52,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:52 BoogieIcfgContainer [2018-11-28 11:52:52,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 11:52:52,544 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 11:52:52,544 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 11:52:52,547 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 11:52:52,548 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:52:52,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:52:51" (1/3) ... [2018-11-28 11:52:52,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77801631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:52:52, skipping insertion in model container [2018-11-28 11:52:52,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:52:52,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:52:52" (2/3) ... [2018-11-28 11:52:52,550 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@77801631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:52:52, skipping insertion in model container [2018-11-28 11:52:52,550 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 11:52:52,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:52" (3/3) ... [2018-11-28 11:52:52,551 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_false-unreach-call_true-no-overflow_true-termination.i [2018-11-28 11:52:52,588 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 11:52:52,589 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 11:52:52,589 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 11:52:52,589 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 11:52:52,589 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 11:52:52,589 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 11:52:52,589 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 11:52:52,589 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 11:52:52,589 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 11:52:52,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-28 11:52:52,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-28 11:52:52,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:52,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:52,618 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:52:52,618 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:52,618 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 11:52:52,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-28 11:52:52,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-28 11:52:52,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:52,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:52,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 11:52:52,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:52,625 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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 11:52:52,626 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 > 254); 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 11:52:52,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:52,630 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2018-11-28 11:52:52,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:52,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:52,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:52,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:52,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:52,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:52,726 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2018-11-28 11:52:52,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:52,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:52,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:52,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:52,769 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 11:52:52,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:52,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:52:52,773 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:52:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:52:52,784 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-28 11:52:52,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:52,946 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2018-11-28 11:52:52,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:52:52,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2018-11-28 11:52:52,950 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-28 11:52:52,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2018-11-28 11:52:52,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-28 11:52:52,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-28 11:52:52,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2018-11-28 11:52:52,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:52,957 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2018-11-28 11:52:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2018-11-28 11:52:52,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-28 11:52:52,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-28 11:52:52,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2018-11-28 11:52:52,978 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-11-28 11:52:52,978 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-11-28 11:52:52,978 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 11:52:52,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2018-11-28 11:52:52,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-28 11:52:52,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:52,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:52,980 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:52,980 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:52,980 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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 11:52:52,980 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 > 254); 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 11:52:52,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2018-11-28 11:52:52,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:52,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:53,139 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 11:52:53,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:53,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:52:53,140 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:52:53,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2018-11-28 11:52:53,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:53,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:53,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:53,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:53,206 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 11:52:53,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:53,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:52:53,207 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:53,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:52:53,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:52:53,208 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-28 11:52:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:53,689 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2018-11-28 11:52:53,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:52:53,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2018-11-28 11:52:53,693 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2018-11-28 11:52:53,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2018-11-28 11:52:53,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2018-11-28 11:52:53,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2018-11-28 11:52:53,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2018-11-28 11:52:53,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:53,698 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2018-11-28 11:52:53,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2018-11-28 11:52:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2018-11-28 11:52:53,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-28 11:52:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2018-11-28 11:52:53,711 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-11-28 11:52:53,711 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-11-28 11:52:53,711 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 11:52:53,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2018-11-28 11:52:53,713 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2018-11-28 11:52:53,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:53,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:53,714 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:53,714 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:53,715 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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 11:52:53,715 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 > 254); 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 11:52:53,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:53,715 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2018-11-28 11:52:53,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:53,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:53,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:53,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:53,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:53,848 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 11:52:53,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:53,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:52:53,848 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:52:53,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2018-11-28 11:52:53,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:53,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:53,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:53,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:53,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:53,903 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 11:52:53,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:53,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:52:53,904 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:53,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:52:53,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:52:53,904 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2018-11-28 11:52:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:54,556 INFO L93 Difference]: Finished difference Result 373 states and 546 transitions. [2018-11-28 11:52:54,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:52:54,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 546 transitions. [2018-11-28 11:52:54,559 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 255 [2018-11-28 11:52:54,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 546 transitions. [2018-11-28 11:52:54,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2018-11-28 11:52:54,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-28 11:52:54,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 546 transitions. [2018-11-28 11:52:54,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:54,564 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 546 transitions. [2018-11-28 11:52:54,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 546 transitions. [2018-11-28 11:52:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 201. [2018-11-28 11:52:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-28 11:52:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2018-11-28 11:52:54,574 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-11-28 11:52:54,574 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-11-28 11:52:54,574 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 11:52:54,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 289 transitions. [2018-11-28 11:52:54,575 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2018-11-28 11:52:54,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:54,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:54,576 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:54,576 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:54,576 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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 11:52:54,576 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 > 254); 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 11:52:54,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:54,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1341941206, now seen corresponding path program 1 times [2018-11-28 11:52:54,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:54,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:54,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:54,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:54,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:54,701 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 11:52:54,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:54,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:52:54,702 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:52:54,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:54,702 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 3 times [2018-11-28 11:52:54,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:54,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:54,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:54,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:54,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:54,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:54,739 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 11:52:54,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:54,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:52:54,739 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:54,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:52:54,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:52:54,740 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. cyclomatic complexity: 93 Second operand 8 states. [2018-11-28 11:52:55,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:55,603 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2018-11-28 11:52:55,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:52:55,604 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 616 transitions. [2018-11-28 11:52:55,607 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 306 [2018-11-28 11:52:55,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 616 transitions. [2018-11-28 11:52:55,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2018-11-28 11:52:55,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2018-11-28 11:52:55,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 616 transitions. [2018-11-28 11:52:55,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:55,615 INFO L705 BuchiCegarLoop]: Abstraction has 418 states and 616 transitions. [2018-11-28 11:52:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 616 transitions. [2018-11-28 11:52:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2018-11-28 11:52:55,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-28 11:52:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2018-11-28 11:52:55,629 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-11-28 11:52:55,629 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-11-28 11:52:55,630 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 11:52:55,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 395 transitions. [2018-11-28 11:52:55,631 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2018-11-28 11:52:55,631 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:55,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:55,632 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:55,632 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:55,632 INFO L794 eck$LassoCheckResult]: Stem: 1613#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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 11:52:55,632 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 > 254); 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 11:52:55,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199508, now seen corresponding path program 1 times [2018-11-28 11:52:55,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:55,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:55,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:55,739 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 11:52:55,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:55,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:52:55,739 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:52:55,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:55,740 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 4 times [2018-11-28 11:52:55,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:55,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:55,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:55,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:55,771 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 11:52:55,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:52:55,771 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:52:55,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:52:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:52:55,772 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. cyclomatic complexity: 126 Second operand 8 states. [2018-11-28 11:52:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:56,454 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2018-11-28 11:52:56,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-28 11:52:56,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 533 transitions. [2018-11-28 11:52:56,456 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2018-11-28 11:52:56,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 533 transitions. [2018-11-28 11:52:56,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-11-28 11:52:56,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-11-28 11:52:56,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 533 transitions. [2018-11-28 11:52:56,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:56,459 INFO L705 BuchiCegarLoop]: Abstraction has 375 states and 533 transitions. [2018-11-28 11:52:56,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 533 transitions. [2018-11-28 11:52:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 300. [2018-11-28 11:52:56,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-28 11:52:56,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 431 transitions. [2018-11-28 11:52:56,468 INFO L728 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-11-28 11:52:56,468 INFO L608 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-11-28 11:52:56,468 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 11:52:56,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 431 transitions. [2018-11-28 11:52:56,471 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-11-28 11:52:56,471 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:56,471 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:56,472 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:56,472 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:56,472 INFO L794 eck$LassoCheckResult]: Stem: 2298#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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 11:52:56,472 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 > 254); 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 11:52:56,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 1 times [2018-11-28 11:52:56,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:56,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:56,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:56,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:56,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 5 times [2018-11-28 11:52:56,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:56,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:56,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:56,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:56,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash -833715526, now seen corresponding path program 1 times [2018-11-28 11:52:56,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:56,502 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:56,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:56,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:56,595 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 11:52:56,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:56,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:52:56,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:52:56,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:52:56,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:52:56,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:52:56,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:52:56,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:52:56,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:52:56,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:52:56,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-28 11:52:56,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:52:56,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:52:56,665 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 11:52:56,672 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 11:52:56,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:52:56,813 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:52:56,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:52:56,816 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:52:56,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:52:56,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:52:58,357 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:52:58,360 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:52:58,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:52:58,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:52:58,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:52:58,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:52:58,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:52:58,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:52:58,360 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:52:58,360 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-28 11:52:58,360 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:52:58,360 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:52:58,361 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 11:52:58,368 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 11:52:58,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:52:58,497 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:52:58,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:58,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:58,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:52:58,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:52:58,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,513 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:52:58,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:52:58,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:52:58,516 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:52:58,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,520 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:52:58,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,521 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,521 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:52:58,523 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:52:58,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,527 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:52:58,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:52:58,530 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:52:58,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,533 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:52:58,537 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:52:58,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,542 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:52:58,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,544 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:52:58,545 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:52:58,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:52:58,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:52:58,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,548 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:52:58,549 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:52:58,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,555 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:52:58,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:52:58,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,556 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:52:58,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,556 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:52:58,561 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:52:58,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:52:58,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,564 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:52:58,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,564 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:52:58,566 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:52:58,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,575 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:52:58,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:52:58,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,576 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:52:58,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,577 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:52:58,583 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:52:58,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,589 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:52:58,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:52:58,592 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:52:58,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,605 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:52:58,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:52:58,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,607 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:52:58,612 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:52:58,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:52:58,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,615 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:52:58,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,616 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:52:58,620 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:52:58,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,635 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:52:58,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,636 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,636 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:52:58,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,637 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:52:58,638 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:52:58,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,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 11:52:58,646 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,646 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:52:58,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,647 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:52:58,648 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:52:58,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,657 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:52:58,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,660 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:52:58,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,660 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:52:58,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:58,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:52:58,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:52:58,676 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:52:58,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:52:58,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:52:58,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:52:58,677 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:52:58,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:52:58,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:52:58,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:52:58,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:52:58,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:52:58,696 INFO L87 Difference]: Start difference. First operand 300 states and 431 transitions. cyclomatic complexity: 139 Second operand 6 states. [2018-11-28 11:52:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:52:58,993 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2018-11-28 11:52:58,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:52:58,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 882 transitions. [2018-11-28 11:52:58,997 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 325 [2018-11-28 11:52:59,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 612 states and 882 transitions. [2018-11-28 11:52:59,000 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2018-11-28 11:52:59,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2018-11-28 11:52:59,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 882 transitions. [2018-11-28 11:52:59,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:52:59,001 INFO L705 BuchiCegarLoop]: Abstraction has 612 states and 882 transitions. [2018-11-28 11:52:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 882 transitions. [2018-11-28 11:52:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 380. [2018-11-28 11:52:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-28 11:52:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2018-11-28 11:52:59,009 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-11-28 11:52:59,009 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-11-28 11:52:59,009 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 11:52:59,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 520 transitions. [2018-11-28 11:52:59,011 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-11-28 11:52:59,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:52:59,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:52:59,011 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:59,011 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:52:59,012 INFO L794 eck$LassoCheckResult]: Stem: 3219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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 11:52:59,012 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 > 254); 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 11:52:59,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash -438599534, now seen corresponding path program 1 times [2018-11-28 11:52:59,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:59,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:59,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:59,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 6 times [2018-11-28 11:52:59,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:59,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:59,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:59,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:52:59,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:59,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:52:59,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:52:59,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1628339462, now seen corresponding path program 1 times [2018-11-28 11:52:59,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:52:59,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:52:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:59,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:52:59,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:52:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:52:59,105 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 11:52:59,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:52:59,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:52:59,160 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:52:59,160 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:52:59,160 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:52:59,160 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:52:59,160 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:52:59,160 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:52:59,160 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:52:59,160 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:52:59,161 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-28 11:52:59,161 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:52:59,161 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:52:59,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:52:59,170 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 11:52:59,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:52:59,363 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:52:59,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:52:59,366 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:52:59,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:52:59,420 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:11,435 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 11:53:11,438 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:11,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:11,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:11,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:11,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:11,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:11,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:11,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:11,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-28 11:53:11,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:11,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:11,440 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 11:53:11,446 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 11:53:11,612 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:11,613 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:11,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:11,615 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:11,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:11,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:11,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,619 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:53:11,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,620 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:11,621 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:11,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,625 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:11,625 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:11,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,627 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:53:11,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:11,629 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:11,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,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 11:53:11,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:11,633 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:11,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,635 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:53:11,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,638 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:11,639 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:11,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:11,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,643 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:11,644 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:11,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,646 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:53:11,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,647 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:11,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,647 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:11,648 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:11,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,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 11:53:11,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,653 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:11,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,654 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:11,655 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:11,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,657 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:53:11,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,657 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:11,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,658 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:11,660 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:11,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,670 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:11,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,671 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:11,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:11,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,677 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:53:11,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,677 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:11,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,681 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:11,683 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:11,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,695 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:11,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,696 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:11,699 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:11,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,701 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:53:11,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,702 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:11,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:11,703 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:11,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:11,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,711 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:11,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:11,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:11,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,717 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:53:11,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,718 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:11,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,718 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:11,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:11,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:11,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:11,734 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:11,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:11,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:11,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:11,734 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:11,736 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:11,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:11,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:53:11,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:53:11,745 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. cyclomatic complexity: 148 Second operand 7 states. [2018-11-28 11:53:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:12,241 INFO L93 Difference]: Finished difference Result 1001 states and 1432 transitions. [2018-11-28 11:53:12,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:53:12,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1001 states and 1432 transitions. [2018-11-28 11:53:12,271 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 748 [2018-11-28 11:53:12,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1001 states to 1001 states and 1432 transitions. [2018-11-28 11:53:12,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1001 [2018-11-28 11:53:12,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1001 [2018-11-28 11:53:12,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1001 states and 1432 transitions. [2018-11-28 11:53:12,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:12,275 INFO L705 BuchiCegarLoop]: Abstraction has 1001 states and 1432 transitions. [2018-11-28 11:53:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states and 1432 transitions. [2018-11-28 11:53:12,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 753. [2018-11-28 11:53:12,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-11-28 11:53:12,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1081 transitions. [2018-11-28 11:53:12,283 INFO L728 BuchiCegarLoop]: Abstraction has 753 states and 1081 transitions. [2018-11-28 11:53:12,283 INFO L608 BuchiCegarLoop]: Abstraction has 753 states and 1081 transitions. [2018-11-28 11:53:12,283 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 11:53:12,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 753 states and 1081 transitions. [2018-11-28 11:53:12,286 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 576 [2018-11-28 11:53:12,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:12,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:12,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:12,286 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 11:53:12,286 INFO L794 eck$LassoCheckResult]: Stem: 4628#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 4590#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4592#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4625#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 4629#L40-1 mp_add_~nb~0 := 4; 4737#L50 assume !(0 == mp_add_~b3~0 % 256); 4738#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5128#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; 5127#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5046#L65 [2018-11-28 11:53:12,287 INFO L796 eck$LassoCheckResult]: Loop: 5046#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5126#L65-2 assume !(1 == mp_add_~i~0 % 256); 5125#L66-1 assume !(2 == mp_add_~i~0 % 256); 5124#L67-1 assume !(3 == mp_add_~i~0 % 256); 5123#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5122#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5052#L71-2 assume !(1 == mp_add_~i~0 % 256); 5121#L72-1 assume !(2 == mp_add_~i~0 % 256); 5120#L73-1 assume !(3 == mp_add_~i~0 % 256); 5119#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 5118#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5037#L80-1 assume !(1 == mp_add_~i~0 % 256); 5034#L81-1 assume !(2 == mp_add_~i~0 % 256); 5113#L82-1 assume !(3 == mp_add_~i~0 % 256); 5112#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5088#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; 5055#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5046#L65 [2018-11-28 11:53:12,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 2 times [2018-11-28 11:53:12,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:12,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:12,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:12,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:12,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:12,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1235554401, now seen corresponding path program 1 times [2018-11-28 11:53:12,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:12,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:12,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:12,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:12,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1592238830, now seen corresponding path program 1 times [2018-11-28 11:53:12,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:12,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:12,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:12,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:12,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 11:53:12,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:12,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:53:12,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:12,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:12,682 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 11:53:12,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:53:12,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2018-11-28 11:53:12,747 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:12,748 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:12,748 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:12,748 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:12,748 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:12,748 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:12,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:12,748 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:12,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-28 11:53:12,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:12,748 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:12,749 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 11:53:12,757 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 11:53:12,940 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:12,940 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:53:12,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:12,943 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:12,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:12,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:13,850 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:13,852 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:13,852 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:13,853 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:13,853 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:13,853 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:13,853 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:13,853 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:13,853 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:13,853 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-28 11:53:13,853 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:13,853 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:13,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:13,862 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 11:53:14,040 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:14,040 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:14,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:14,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:14,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:14,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:14,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:14,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,046 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:53:14,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 11:53:14,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,047 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:14,048 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:14,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:14,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,052 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:14,053 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:14,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,054 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:53:14,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:14,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,056 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:14,056 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:14,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:14,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,061 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:14,062 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:14,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,064 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:53:14,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:14,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,065 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:14,065 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:14,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:14,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,071 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:14,072 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:14,072 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,074 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:53:14,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 11:53:14,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,074 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:14,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,075 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:14,076 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:14,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,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 11:53:14,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,083 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:14,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,083 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:14,084 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:14,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,086 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:53:14,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,087 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:14,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:14,089 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:14,089 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,096 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:14,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,097 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:14,099 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:14,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,103 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:53:14,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,104 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:14,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,104 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:14,106 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:14,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:14,117 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,117 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:14,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,117 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:14,121 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:14,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,123 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:53:14,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,124 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:14,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:14,125 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:14,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,132 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:14,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:14,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:14,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,139 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:53:14,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,140 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:14,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,140 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:14,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:14,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:14,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:14,156 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:14,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:14,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:14,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:14,156 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:14,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:14,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:14,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:14,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:53:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:53:14,169 INFO L87 Difference]: Start difference. First operand 753 states and 1081 transitions. cyclomatic complexity: 346 Second operand 14 states. [2018-11-28 11:53:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:16,578 INFO L93 Difference]: Finished difference Result 1083 states and 1433 transitions. [2018-11-28 11:53:16,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 11:53:16,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1083 states and 1433 transitions. [2018-11-28 11:53:16,584 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 883 [2018-11-28 11:53:16,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1083 states to 1073 states and 1420 transitions. [2018-11-28 11:53:16,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1073 [2018-11-28 11:53:16,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1073 [2018-11-28 11:53:16,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1073 states and 1420 transitions. [2018-11-28 11:53:16,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:16,591 INFO L705 BuchiCegarLoop]: Abstraction has 1073 states and 1420 transitions. [2018-11-28 11:53:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states and 1420 transitions. [2018-11-28 11:53:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1028. [2018-11-28 11:53:16,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-11-28 11:53:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1372 transitions. [2018-11-28 11:53:16,607 INFO L728 BuchiCegarLoop]: Abstraction has 1028 states and 1372 transitions. [2018-11-28 11:53:16,607 INFO L608 BuchiCegarLoop]: Abstraction has 1028 states and 1372 transitions. [2018-11-28 11:53:16,607 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 11:53:16,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1028 states and 1372 transitions. [2018-11-28 11:53:16,611 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 846 [2018-11-28 11:53:16,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:16,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:16,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:16,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:16,612 INFO L794 eck$LassoCheckResult]: Stem: 6575#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 6542#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6543#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6571#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 6578#L40-1 mp_add_~nb~0 := 4; 6651#L50 assume !(0 == mp_add_~b3~0 % 256); 6652#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6733#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; 6732#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6731#L65 [2018-11-28 11:53:16,612 INFO L796 eck$LassoCheckResult]: Loop: 6731#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6730#L65-2 assume !(1 == mp_add_~i~0 % 256); 6729#L66-1 assume !(2 == mp_add_~i~0 % 256); 6728#L67-1 assume !(3 == mp_add_~i~0 % 256); 6727#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6726#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6725#L71-2 assume !(1 == mp_add_~i~0 % 256); 6724#L72-1 assume !(2 == mp_add_~i~0 % 256); 6723#L73-1 assume !(3 == mp_add_~i~0 % 256); 6722#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6721#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6720#L80-1 assume !(1 == mp_add_~i~0 % 256); 6719#L81-1 assume !(2 == mp_add_~i~0 % 256); 6718#L82-1 assume !(3 == mp_add_~i~0 % 256); 6717#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6716#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; 6715#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6714#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6713#L71 assume !(0 == mp_add_~i~0 % 256); 6712#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; 6711#L72-1 assume !(2 == mp_add_~i~0 % 256); 6709#L73-1 assume !(3 == mp_add_~i~0 % 256); 6707#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6705#L76-1 assume !(0 == mp_add_~i~0 % 256); 6703#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 6684#L81-1 assume !(2 == mp_add_~i~0 % 256); 6702#L82-1 assume !(3 == mp_add_~i~0 % 256); 6701#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6700#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; 6699#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6698#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6693#L71 assume !(0 == mp_add_~i~0 % 256); 6696#L71-2 assume !(1 == mp_add_~i~0 % 256); 6694#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; 6690#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; 6691#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6686#L76-1 assume !(0 == mp_add_~i~0 % 256); 6687#L80-1 assume !(1 == mp_add_~i~0 % 256); 6681#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 6682#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6634#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6635#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; 6695#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6692#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6688#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6689#L76-1 assume !(0 == mp_add_~i~0 % 256); 6683#L80-1 assume !(1 == mp_add_~i~0 % 256); 6685#L81-1 assume !(2 == mp_add_~i~0 % 256); 6639#L82-1 assume !(3 == mp_add_~i~0 % 256); 6640#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6610#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; 6611#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6731#L65 [2018-11-28 11:53:16,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 3 times [2018-11-28 11:53:16,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:16,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1975040067, now seen corresponding path program 1 times [2018-11-28 11:53:16,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:16,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:16,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:16,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-28 11:53:16,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:16,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 11:53:16,666 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:16,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 11:53:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 11:53:16,666 INFO L87 Difference]: Start difference. First operand 1028 states and 1372 transitions. cyclomatic complexity: 362 Second operand 3 states. [2018-11-28 11:53:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:16,737 INFO L93 Difference]: Finished difference Result 1157 states and 1561 transitions. [2018-11-28 11:53:16,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 11:53:16,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1157 states and 1561 transitions. [2018-11-28 11:53:16,743 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 972 [2018-11-28 11:53:16,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1157 states to 1157 states and 1561 transitions. [2018-11-28 11:53:16,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1157 [2018-11-28 11:53:16,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1157 [2018-11-28 11:53:16,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1157 states and 1561 transitions. [2018-11-28 11:53:16,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:16,751 INFO L705 BuchiCegarLoop]: Abstraction has 1157 states and 1561 transitions. [2018-11-28 11:53:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states and 1561 transitions. [2018-11-28 11:53:16,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1061. [2018-11-28 11:53:16,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2018-11-28 11:53:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1427 transitions. [2018-11-28 11:53:16,768 INFO L728 BuchiCegarLoop]: Abstraction has 1061 states and 1427 transitions. [2018-11-28 11:53:16,768 INFO L608 BuchiCegarLoop]: Abstraction has 1061 states and 1427 transitions. [2018-11-28 11:53:16,768 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 11:53:16,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1061 states and 1427 transitions. [2018-11-28 11:53:16,772 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 880 [2018-11-28 11:53:16,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:16,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:16,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:16,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:16,773 INFO L794 eck$LassoCheckResult]: Stem: 8768#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 8733#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 8734#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 8764#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 8770#L40-1 mp_add_~nb~0 := 4; 8813#L50 assume !(0 == mp_add_~b3~0 % 256); 8814#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8981#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; 8980#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8979#L65 [2018-11-28 11:53:16,773 INFO L796 eck$LassoCheckResult]: Loop: 8979#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8978#L65-2 assume !(1 == mp_add_~i~0 % 256); 8977#L66-1 assume !(2 == mp_add_~i~0 % 256); 8976#L67-1 assume !(3 == mp_add_~i~0 % 256); 8975#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8974#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8973#L71-2 assume !(1 == mp_add_~i~0 % 256); 8972#L72-1 assume !(2 == mp_add_~i~0 % 256); 8971#L73-1 assume !(3 == mp_add_~i~0 % 256); 8970#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8969#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8968#L80-1 assume !(1 == mp_add_~i~0 % 256); 8967#L81-1 assume !(2 == mp_add_~i~0 % 256); 8966#L82-1 assume !(3 == mp_add_~i~0 % 256); 8965#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8964#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; 8963#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8962#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8961#L71 assume !(0 == mp_add_~i~0 % 256); 8960#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; 8959#L72-1 assume !(2 == mp_add_~i~0 % 256); 8958#L73-1 assume !(3 == mp_add_~i~0 % 256); 8957#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8956#L76-1 assume !(0 == mp_add_~i~0 % 256); 8951#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8923#L81-1 assume !(2 == mp_add_~i~0 % 256); 8950#L82-1 assume !(3 == mp_add_~i~0 % 256); 8949#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8948#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; 8947#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8935#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8934#L71 assume !(0 == mp_add_~i~0 % 256); 8932#L71-2 assume !(1 == mp_add_~i~0 % 256); 8930#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; 8929#L73-1 assume !(3 == mp_add_~i~0 % 256); 8928#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8927#L76-1 assume !(0 == mp_add_~i~0 % 256); 8926#L80-1 assume !(1 == mp_add_~i~0 % 256); 8925#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8866#L82-1 assume !(3 == mp_add_~i~0 % 256); 8862#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8863#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; 8937#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8938#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8946#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 8940#L76-1 assume !(0 == mp_add_~i~0 % 256); 8941#L80-1 assume !(1 == mp_add_~i~0 % 256); 8867#L81-1 assume !(2 == mp_add_~i~0 % 256); 8868#L82-1 assume !(3 == mp_add_~i~0 % 256); 8982#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8849#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; 8850#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8979#L65 [2018-11-28 11:53:16,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:16,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 4 times [2018-11-28 11:53:16,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:16,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:16,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:16,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:16,785 INFO L82 PathProgramCache]: Analyzing trace with hash -605910653, now seen corresponding path program 1 times [2018-11-28 11:53:16,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:16,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:16,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:53:16,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:16,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:53:16,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:16,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 49 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 11:53:16,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:53:16,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 11:53:16,974 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:53:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:53:16,974 INFO L87 Difference]: Start difference. First operand 1061 states and 1427 transitions. cyclomatic complexity: 382 Second operand 6 states. [2018-11-28 11:53:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:17,098 INFO L93 Difference]: Finished difference Result 1927 states and 2522 transitions. [2018-11-28 11:53:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:53:17,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1927 states and 2522 transitions. [2018-11-28 11:53:17,105 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 1704 [2018-11-28 11:53:17,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1927 states to 1927 states and 2522 transitions. [2018-11-28 11:53:17,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1927 [2018-11-28 11:53:17,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1927 [2018-11-28 11:53:17,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1927 states and 2522 transitions. [2018-11-28 11:53:17,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:17,114 INFO L705 BuchiCegarLoop]: Abstraction has 1927 states and 2522 transitions. [2018-11-28 11:53:17,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states and 2522 transitions. [2018-11-28 11:53:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1348. [2018-11-28 11:53:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-11-28 11:53:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1825 transitions. [2018-11-28 11:53:17,131 INFO L728 BuchiCegarLoop]: Abstraction has 1348 states and 1825 transitions. [2018-11-28 11:53:17,131 INFO L608 BuchiCegarLoop]: Abstraction has 1348 states and 1825 transitions. [2018-11-28 11:53:17,131 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 11:53:17,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1348 states and 1825 transitions. [2018-11-28 11:53:17,134 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 1167 [2018-11-28 11:53:17,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:17,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:17,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:17,135 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 11:53:17,135 INFO L794 eck$LassoCheckResult]: Stem: 11924#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 11888#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 11889#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 11922#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 11928#L40-1 mp_add_~nb~0 := 4; 11972#L50 assume !(0 == mp_add_~b3~0 % 256); 11973#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12137#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; 12134#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12132#L65 [2018-11-28 11:53:17,136 INFO L796 eck$LassoCheckResult]: Loop: 12132#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12131#L65-2 assume !(1 == mp_add_~i~0 % 256); 12130#L66-1 assume !(2 == mp_add_~i~0 % 256); 12129#L67-1 assume !(3 == mp_add_~i~0 % 256); 12128#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12127#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12126#L71-2 assume !(1 == mp_add_~i~0 % 256); 12125#L72-1 assume !(2 == mp_add_~i~0 % 256); 12124#L73-1 assume !(3 == mp_add_~i~0 % 256); 12123#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 12122#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12121#L80-1 assume !(1 == mp_add_~i~0 % 256); 12120#L81-1 assume !(2 == mp_add_~i~0 % 256); 12119#L82-1 assume !(3 == mp_add_~i~0 % 256); 12118#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12117#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; 12116#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12113#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12112#L71 assume !(0 == mp_add_~i~0 % 256); 12111#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; 12110#L72-1 assume !(2 == mp_add_~i~0 % 256); 12109#L73-1 assume !(3 == mp_add_~i~0 % 256); 12108#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 12106#L76-1 assume !(0 == mp_add_~i~0 % 256); 12104#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12073#L81-1 assume !(2 == mp_add_~i~0 % 256); 12103#L82-1 assume !(3 == mp_add_~i~0 % 256); 12102#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12101#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; 12057#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12085#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12084#L71 assume !(0 == mp_add_~i~0 % 256); 12082#L71-2 assume !(1 == mp_add_~i~0 % 256); 12080#L72-1 assume !(2 == mp_add_~i~0 % 256); 12081#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; 12092#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12142#L76-1 assume !(0 == mp_add_~i~0 % 256); 12099#L80-1 assume !(1 == mp_add_~i~0 % 256); 12100#L81-1 assume !(2 == mp_add_~i~0 % 256); 12097#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 12061#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12062#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; 12094#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12093#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12090#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12088#L76-1 assume !(0 == mp_add_~i~0 % 256); 12089#L80-1 assume !(1 == mp_add_~i~0 % 256); 12068#L81-1 assume !(2 == mp_add_~i~0 % 256); 12070#L82-1 assume !(3 == mp_add_~i~0 % 256); 12138#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12095#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; 12096#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12132#L65 [2018-11-28 11:53:17,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 5 times [2018-11-28 11:53:17,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:17,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:17,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:17,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:17,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1672673603, now seen corresponding path program 1 times [2018-11-28 11:53:17,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:17,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:17,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:17,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:17,262 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:53:17,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:17,262 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:53:17,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:17,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:53:17,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:53:17,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-28 11:53:17,347 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:17,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:53:17,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:53:17,348 INFO L87 Difference]: Start difference. First operand 1348 states and 1825 transitions. cyclomatic complexity: 493 Second operand 8 states. [2018-11-28 11:53:17,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:17,643 INFO L93 Difference]: Finished difference Result 2324 states and 2850 transitions. [2018-11-28 11:53:17,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 11:53:17,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2324 states and 2850 transitions. [2018-11-28 11:53:17,653 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 1919 [2018-11-28 11:53:17,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2324 states to 2217 states and 2733 transitions. [2018-11-28 11:53:17,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2217 [2018-11-28 11:53:17,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2217 [2018-11-28 11:53:17,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2217 states and 2733 transitions. [2018-11-28 11:53:17,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:17,665 INFO L705 BuchiCegarLoop]: Abstraction has 2217 states and 2733 transitions. [2018-11-28 11:53:17,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states and 2733 transitions. [2018-11-28 11:53:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 1462. [2018-11-28 11:53:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1462 states. [2018-11-28 11:53:17,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1917 transitions. [2018-11-28 11:53:17,690 INFO L728 BuchiCegarLoop]: Abstraction has 1462 states and 1917 transitions. [2018-11-28 11:53:17,690 INFO L608 BuchiCegarLoop]: Abstraction has 1462 states and 1917 transitions. [2018-11-28 11:53:17,690 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 11:53:17,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1462 states and 1917 transitions. [2018-11-28 11:53:17,694 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1374 [2018-11-28 11:53:17,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:17,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:17,695 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:17,695 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:17,695 INFO L794 eck$LassoCheckResult]: Stem: 15765#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 15730#L40 assume !(0 == mp_add_~a3~0 % 256); 15731#L40-1 mp_add_~nb~0 := 4; 15757#L50 assume !(0 == mp_add_~b3~0 % 256); 15758#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17153#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; 17152#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17151#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16890#L65-2 [2018-11-28 11:53:17,695 INFO L796 eck$LassoCheckResult]: Loop: 16890#L65-2 assume !(1 == mp_add_~i~0 % 256); 17149#L66-1 assume !(2 == mp_add_~i~0 % 256); 17148#L67-1 assume !(3 == mp_add_~i~0 % 256); 17146#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 17144#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16950#L71-2 assume !(1 == mp_add_~i~0 % 256); 17141#L72-1 assume !(2 == mp_add_~i~0 % 256); 17140#L73-1 assume !(3 == mp_add_~i~0 % 256); 17138#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 17136#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 16930#L80-1 assume !(1 == mp_add_~i~0 % 256); 17132#L81-1 assume !(2 == mp_add_~i~0 % 256); 17133#L82-1 assume !(3 == mp_add_~i~0 % 256); 15760#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15761#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; 17128#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 17124#L65 assume !(0 == mp_add_~i~0 % 256); 17125#L65-2 assume !(1 == mp_add_~i~0 % 256); 17122#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; 17121#L67-1 assume !(3 == mp_add_~i~0 % 256); 17120#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 17119#L71 assume !(0 == mp_add_~i~0 % 256); 17118#L71-2 assume !(1 == mp_add_~i~0 % 256); 17117#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; 17116#L73-1 assume !(3 == mp_add_~i~0 % 256); 17114#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 17113#L76-1 assume !(0 == mp_add_~i~0 % 256); 17112#L80-1 assume !(1 == mp_add_~i~0 % 256); 17111#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 16855#L82-1 assume !(3 == mp_add_~i~0 % 256); 17086#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16845#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; 16846#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16889#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16890#L65-2 [2018-11-28 11:53:17,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:17,695 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 1 times [2018-11-28 11:53:17,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:17,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:17,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:17,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:17,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:17,704 INFO L82 PathProgramCache]: Analyzing trace with hash 801043905, now seen corresponding path program 1 times [2018-11-28 11:53:17,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:17,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:17,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:17,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:53:17,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:17,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:53:17,766 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:17,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:53:17,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:53:17,766 INFO L87 Difference]: Start difference. First operand 1462 states and 1917 transitions. cyclomatic complexity: 470 Second operand 5 states. [2018-11-28 11:53:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:18,084 INFO L93 Difference]: Finished difference Result 2363 states and 3006 transitions. [2018-11-28 11:53:18,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:53:18,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2363 states and 3006 transitions. [2018-11-28 11:53:18,093 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 2266 [2018-11-28 11:53:18,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2363 states to 2363 states and 3006 transitions. [2018-11-28 11:53:18,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2363 [2018-11-28 11:53:18,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2363 [2018-11-28 11:53:18,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2363 states and 3006 transitions. [2018-11-28 11:53:18,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:18,106 INFO L705 BuchiCegarLoop]: Abstraction has 2363 states and 3006 transitions. [2018-11-28 11:53:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2363 states and 3006 transitions. [2018-11-28 11:53:18,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2363 to 1465. [2018-11-28 11:53:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1465 states. [2018-11-28 11:53:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1912 transitions. [2018-11-28 11:53:18,131 INFO L728 BuchiCegarLoop]: Abstraction has 1465 states and 1912 transitions. [2018-11-28 11:53:18,131 INFO L608 BuchiCegarLoop]: Abstraction has 1465 states and 1912 transitions. [2018-11-28 11:53:18,131 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 11:53:18,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1465 states and 1912 transitions. [2018-11-28 11:53:18,135 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1377 [2018-11-28 11:53:18,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:18,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:18,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:18,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:18,136 INFO L794 eck$LassoCheckResult]: Stem: 19599#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 19568#L40 assume !(0 == mp_add_~a3~0 % 256); 19565#L40-1 mp_add_~nb~0 := 4; 19566#L50 assume !(0 == mp_add_~b3~0 % 256); 20459#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 20801#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; 20800#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20799#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 20270#L65-2 [2018-11-28 11:53:18,136 INFO L796 eck$LassoCheckResult]: Loop: 20270#L65-2 assume !(1 == mp_add_~i~0 % 256); 20798#L66-1 assume !(2 == mp_add_~i~0 % 256); 20797#L67-1 assume !(3 == mp_add_~i~0 % 256); 20796#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20795#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 20793#L71-2 assume !(1 == mp_add_~i~0 % 256); 20792#L72-1 assume !(2 == mp_add_~i~0 % 256); 20791#L73-1 assume !(3 == mp_add_~i~0 % 256); 20790#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 20789#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 20787#L80-1 assume !(1 == mp_add_~i~0 % 256); 20788#L81-1 assume !(2 == mp_add_~i~0 % 256); 20810#L82-1 assume !(3 == mp_add_~i~0 % 256); 20809#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20781#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; 20782#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20777#L65 assume !(0 == mp_add_~i~0 % 256); 20778#L65-2 assume !(1 == mp_add_~i~0 % 256); 20775#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; 20712#L67-1 assume !(3 == mp_add_~i~0 % 256); 20774#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20773#L71 assume !(0 == mp_add_~i~0 % 256); 20772#L71-2 assume !(1 == mp_add_~i~0 % 256); 20771#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; 20700#L73-1 assume !(3 == mp_add_~i~0 % 256); 20770#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20769#L76-1 assume !(0 == mp_add_~i~0 % 256); 20767#L80-1 assume !(1 == mp_add_~i~0 % 256); 20735#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 20732#L82-1 assume !(3 == mp_add_~i~0 % 256); 20730#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20719#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; 20720#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 20725#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20723#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20692#L76-1 assume !(0 == mp_add_~i~0 % 256); 20688#L80-1 assume !(1 == mp_add_~i~0 % 256); 20689#L81-1 assume !(2 == mp_add_~i~0 % 256); 20677#L82-1 assume !(3 == mp_add_~i~0 % 256); 20676#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20668#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; 20669#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20269#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 20270#L65-2 [2018-11-28 11:53:18,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 2 times [2018-11-28 11:53:18,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:18,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:18,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:18,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1828321911, now seen corresponding path program 1 times [2018-11-28 11:53:18,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:18,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:18,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:18,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:18,359 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 11:53:18,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:18,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:53:18,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:18,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 11:53:18,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:53:18,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2018-11-28 11:53:18,459 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:18,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 11:53:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 11:53:18,459 INFO L87 Difference]: Start difference. First operand 1465 states and 1912 transitions. cyclomatic complexity: 462 Second operand 10 states. [2018-11-28 11:53:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:18,772 INFO L93 Difference]: Finished difference Result 2420 states and 2923 transitions. [2018-11-28 11:53:18,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 11:53:18,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2420 states and 2923 transitions. [2018-11-28 11:53:18,777 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 2021 [2018-11-28 11:53:18,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2420 states to 2339 states and 2834 transitions. [2018-11-28 11:53:18,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2339 [2018-11-28 11:53:18,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2339 [2018-11-28 11:53:18,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2339 states and 2834 transitions. [2018-11-28 11:53:18,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:18,790 INFO L705 BuchiCegarLoop]: Abstraction has 2339 states and 2834 transitions. [2018-11-28 11:53:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states and 2834 transitions. [2018-11-28 11:53:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 1566. [2018-11-28 11:53:18,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1566 states. [2018-11-28 11:53:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1992 transitions. [2018-11-28 11:53:18,813 INFO L728 BuchiCegarLoop]: Abstraction has 1566 states and 1992 transitions. [2018-11-28 11:53:18,813 INFO L608 BuchiCegarLoop]: Abstraction has 1566 states and 1992 transitions. [2018-11-28 11:53:18,813 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 11:53:18,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1566 states and 1992 transitions. [2018-11-28 11:53:18,817 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1471 [2018-11-28 11:53:18,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:18,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:18,817 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:18,818 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:18,818 INFO L794 eck$LassoCheckResult]: Stem: 23630#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 23598#L40 assume !(0 == mp_add_~a3~0 % 256); 23595#L40-1 mp_add_~nb~0 := 4; 23596#L50 assume !(0 == mp_add_~b3~0 % 256); 24567#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25007#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; 25006#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25005#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24837#L65-2 [2018-11-28 11:53:18,818 INFO L796 eck$LassoCheckResult]: Loop: 24837#L65-2 assume !(1 == mp_add_~i~0 % 256); 25004#L66-1 assume !(2 == mp_add_~i~0 % 256); 25003#L67-1 assume !(3 == mp_add_~i~0 % 256); 25002#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25001#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 24889#L71-2 assume !(1 == mp_add_~i~0 % 256); 25000#L72-1 assume !(2 == mp_add_~i~0 % 256); 24999#L73-1 assume !(3 == mp_add_~i~0 % 256); 24998#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 24997#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 24872#L80-1 assume !(1 == mp_add_~i~0 % 256); 24996#L81-1 assume !(2 == mp_add_~i~0 % 256); 24995#L82-1 assume !(3 == mp_add_~i~0 % 256); 24994#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24993#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; 24992#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24991#L65 assume !(0 == mp_add_~i~0 % 256); 24990#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; 24835#L66-1 assume !(2 == mp_add_~i~0 % 256); 24989#L67-1 assume !(3 == mp_add_~i~0 % 256); 24988#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24987#L71 assume !(0 == mp_add_~i~0 % 256); 24986#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; 24887#L72-1 assume !(2 == mp_add_~i~0 % 256); 24985#L73-1 assume !(3 == mp_add_~i~0 % 256); 24984#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 24983#L76-1 assume !(0 == mp_add_~i~0 % 256); 24982#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 24908#L81-1 assume !(2 == mp_add_~i~0 % 256); 24981#L82-1 assume !(3 == mp_add_~i~0 % 256); 24980#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24979#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; 24978#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24977#L65 assume !(0 == mp_add_~i~0 % 256); 24976#L65-2 assume !(1 == mp_add_~i~0 % 256); 24975#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; 24833#L67-1 assume !(3 == mp_add_~i~0 % 256); 24974#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24973#L71 assume !(0 == mp_add_~i~0 % 256); 24972#L71-2 assume !(1 == mp_add_~i~0 % 256); 24971#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; 24884#L73-1 assume !(3 == mp_add_~i~0 % 256); 24963#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 24959#L76-1 assume !(0 == mp_add_~i~0 % 256); 24958#L80-1 assume !(1 == mp_add_~i~0 % 256); 24957#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 24863#L82-1 assume !(3 == mp_add_~i~0 % 256); 24941#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24938#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; 24935#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24934#L65 assume !(0 == mp_add_~i~0 % 256); 24933#L65-2 assume !(1 == mp_add_~i~0 % 256); 24932#L66-1 assume !(2 == mp_add_~i~0 % 256); 24931#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; 24831#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24926#L71 assume !(0 == mp_add_~i~0 % 256); 24923#L71-2 assume !(1 == mp_add_~i~0 % 256); 24922#L72-1 assume !(2 == mp_add_~i~0 % 256); 24921#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; 24880#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 24919#L76-1 assume !(0 == mp_add_~i~0 % 256); 24917#L80-1 assume !(1 == mp_add_~i~0 % 256); 24915#L81-1 assume !(2 == mp_add_~i~0 % 256); 24907#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 24903#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24902#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; 24900#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24898#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24895#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 24894#L76-1 assume !(0 == mp_add_~i~0 % 256); 24893#L80-1 assume !(1 == mp_add_~i~0 % 256); 24892#L81-1 assume !(2 == mp_add_~i~0 % 256); 24891#L82-1 assume !(3 == mp_add_~i~0 % 256); 24890#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24888#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; 24885#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24858#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24882#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 24909#L76-1 assume !(0 == mp_add_~i~0 % 256); 24874#L80-1 assume !(1 == mp_add_~i~0 % 256); 24875#L81-1 assume !(2 == mp_add_~i~0 % 256); 24853#L82-1 assume !(3 == mp_add_~i~0 % 256); 24854#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24843#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; 24844#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24836#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24837#L65-2 [2018-11-28 11:53:18,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 3 times [2018-11-28 11:53:18,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:18,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:18,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:18,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:18,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash -169767625, now seen corresponding path program 1 times [2018-11-28 11:53:18,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:18,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:18,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:18,872 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-11-28 11:53:18,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:18,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:53:18,873 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:18,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:53:18,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:53:18,873 INFO L87 Difference]: Start difference. First operand 1566 states and 1992 transitions. cyclomatic complexity: 441 Second operand 4 states. [2018-11-28 11:53:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:18,928 INFO L93 Difference]: Finished difference Result 2259 states and 2769 transitions. [2018-11-28 11:53:18,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:53:18,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2259 states and 2769 transitions. [2018-11-28 11:53:18,937 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 2138 [2018-11-28 11:53:18,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2259 states to 2259 states and 2769 transitions. [2018-11-28 11:53:18,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2259 [2018-11-28 11:53:18,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2259 [2018-11-28 11:53:18,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2259 states and 2769 transitions. [2018-11-28 11:53:18,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:18,950 INFO L705 BuchiCegarLoop]: Abstraction has 2259 states and 2769 transitions. [2018-11-28 11:53:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states and 2769 transitions. [2018-11-28 11:53:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 1660. [2018-11-28 11:53:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2018-11-28 11:53:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2094 transitions. [2018-11-28 11:53:18,980 INFO L728 BuchiCegarLoop]: Abstraction has 1660 states and 2094 transitions. [2018-11-28 11:53:18,980 INFO L608 BuchiCegarLoop]: Abstraction has 1660 states and 2094 transitions. [2018-11-28 11:53:18,980 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 11:53:18,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1660 states and 2094 transitions. [2018-11-28 11:53:18,984 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 1563 [2018-11-28 11:53:18,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:18,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:18,985 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:18,985 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:18,985 INFO L794 eck$LassoCheckResult]: Stem: 27462#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 27430#L40 assume !(0 == mp_add_~a3~0 % 256); 27431#L40-1 mp_add_~nb~0 := 4; 27453#L50 assume !(0 == mp_add_~b3~0 % 256); 27454#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 28930#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; 28929#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28928#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28847#L65-2 [2018-11-28 11:53:18,985 INFO L796 eck$LassoCheckResult]: Loop: 28847#L65-2 assume !(1 == mp_add_~i~0 % 256); 28927#L66-1 assume !(2 == mp_add_~i~0 % 256); 28926#L67-1 assume !(3 == mp_add_~i~0 % 256); 28925#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28924#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28837#L71-2 assume !(1 == mp_add_~i~0 % 256); 28923#L72-1 assume !(2 == mp_add_~i~0 % 256); 28922#L73-1 assume !(3 == mp_add_~i~0 % 256); 28921#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28920#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 28821#L80-1 assume !(1 == mp_add_~i~0 % 256); 28919#L81-1 assume !(2 == mp_add_~i~0 % 256); 28918#L82-1 assume !(3 == mp_add_~i~0 % 256); 28917#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28916#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; 28915#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28914#L65 assume !(0 == mp_add_~i~0 % 256); 28913#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; 28846#L66-1 assume !(2 == mp_add_~i~0 % 256); 28912#L67-1 assume !(3 == mp_add_~i~0 % 256); 28911#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28910#L71 assume !(0 == mp_add_~i~0 % 256); 28909#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; 28834#L72-1 assume !(2 == mp_add_~i~0 % 256); 28908#L73-1 assume !(3 == mp_add_~i~0 % 256); 28907#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28906#L76-1 assume !(0 == mp_add_~i~0 % 256); 28905#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 28798#L81-1 assume !(2 == mp_add_~i~0 % 256); 28904#L82-1 assume !(3 == mp_add_~i~0 % 256); 28903#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28902#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; 28901#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28900#L65 assume !(0 == mp_add_~i~0 % 256); 28899#L65-2 assume !(1 == mp_add_~i~0 % 256); 28898#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; 28844#L67-1 assume !(3 == mp_add_~i~0 % 256); 28897#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28896#L71 assume !(0 == mp_add_~i~0 % 256); 28895#L71-2 assume !(1 == mp_add_~i~0 % 256); 28894#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; 28831#L73-1 assume !(3 == mp_add_~i~0 % 256); 28893#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28892#L76-1 assume !(0 == mp_add_~i~0 % 256); 28891#L80-1 assume !(1 == mp_add_~i~0 % 256); 28890#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 28792#L82-1 assume !(3 == mp_add_~i~0 % 256); 28889#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28885#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; 28884#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28873#L65 assume !(0 == mp_add_~i~0 % 256); 28872#L65-2 assume !(1 == mp_add_~i~0 % 256); 28870#L66-1 assume !(2 == mp_add_~i~0 % 256); 28868#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; 28841#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28867#L71 assume !(0 == mp_add_~i~0 % 256); 28866#L71-2 assume !(1 == mp_add_~i~0 % 256); 28865#L72-1 assume !(2 == mp_add_~i~0 % 256); 28864#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; 28828#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28862#L76-1 assume !(0 == mp_add_~i~0 % 256); 28861#L80-1 assume !(1 == mp_add_~i~0 % 256); 28860#L81-1 assume !(2 == mp_add_~i~0 % 256); 28858#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 28857#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28842#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; 28839#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28692#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28835#L71 assume !(0 == mp_add_~i~0 % 256); 28832#L71-2 assume !(1 == mp_add_~i~0 % 256); 28829#L72-1 assume !(2 == mp_add_~i~0 % 256); 28826#L73-1 assume !(3 == mp_add_~i~0 % 256); 28822#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 28819#L76-1 assume !(0 == mp_add_~i~0 % 256); 28817#L80-1 assume !(1 == mp_add_~i~0 % 256); 28815#L81-1 assume !(2 == mp_add_~i~0 % 256); 28812#L82-1 assume !(3 == mp_add_~i~0 % 256); 28810#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28808#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; 28805#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 28803#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 28802#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 28801#L76-1 assume !(0 == mp_add_~i~0 % 256); 28799#L80-1 assume !(1 == mp_add_~i~0 % 256); 28800#L81-1 assume !(2 == mp_add_~i~0 % 256); 28787#L82-1 assume !(3 == mp_add_~i~0 % 256); 28786#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28785#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; 28690#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 28691#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 28847#L65-2 [2018-11-28 11:53:18,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,985 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 4 times [2018-11-28 11:53:18,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:18,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:18,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:18,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:18,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2083167059, now seen corresponding path program 2 times [2018-11-28 11:53:18,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:18,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:18,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:18,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:18,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 138 proven. 7 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-28 11:53:19,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:19,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 11:53:19,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 11:53:19,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 11:53:19,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 11:53:19,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 129 proven. 31 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-28 11:53:19,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:53:19,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-28 11:53:19,130 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:19,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 11:53:19,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 11:53:19,131 INFO L87 Difference]: Start difference. First operand 1660 states and 2094 transitions. cyclomatic complexity: 449 Second operand 4 states. [2018-11-28 11:53:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:19,222 INFO L93 Difference]: Finished difference Result 1765 states and 2039 transitions. [2018-11-28 11:53:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 11:53:19,222 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1765 states and 2039 transitions. [2018-11-28 11:53:19,226 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 1154 [2018-11-28 11:53:19,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1765 states to 1765 states and 2039 transitions. [2018-11-28 11:53:19,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1765 [2018-11-28 11:53:19,231 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1765 [2018-11-28 11:53:19,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1765 states and 2039 transitions. [2018-11-28 11:53:19,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:19,233 INFO L705 BuchiCegarLoop]: Abstraction has 1765 states and 2039 transitions. [2018-11-28 11:53:19,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states and 2039 transitions. [2018-11-28 11:53:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1222. [2018-11-28 11:53:19,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2018-11-28 11:53:19,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1440 transitions. [2018-11-28 11:53:19,243 INFO L728 BuchiCegarLoop]: Abstraction has 1222 states and 1440 transitions. [2018-11-28 11:53:19,243 INFO L608 BuchiCegarLoop]: Abstraction has 1222 states and 1440 transitions. [2018-11-28 11:53:19,243 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-28 11:53:19,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1222 states and 1440 transitions. [2018-11-28 11:53:19,245 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 822 [2018-11-28 11:53:19,245 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:19,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:19,246 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:19,246 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 11:53:19,246 INFO L794 eck$LassoCheckResult]: Stem: 31162#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 31132#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 31133#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 31160#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 31166#L40-1 mp_add_~nb~0 := 4; 31221#L50 assume !(0 == mp_add_~b3~0 % 256); 31222#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 31679#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; 31677#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31676#L65 [2018-11-28 11:53:19,246 INFO L796 eck$LassoCheckResult]: Loop: 31676#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 31675#L65-2 assume !(1 == mp_add_~i~0 % 256); 31674#L66-1 assume !(2 == mp_add_~i~0 % 256); 31673#L67-1 assume !(3 == mp_add_~i~0 % 256); 31672#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31671#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 31670#L71-2 assume !(1 == mp_add_~i~0 % 256); 31669#L72-1 assume !(2 == mp_add_~i~0 % 256); 31668#L73-1 assume !(3 == mp_add_~i~0 % 256); 31667#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31666#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 31665#L80-1 assume !(1 == mp_add_~i~0 % 256); 31664#L81-1 assume !(2 == mp_add_~i~0 % 256); 31663#L82-1 assume !(3 == mp_add_~i~0 % 256); 31662#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31661#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; 31660#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31659#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31658#L71 assume !(0 == mp_add_~i~0 % 256); 31657#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; 31612#L72-1 assume !(2 == mp_add_~i~0 % 256); 31656#L73-1 assume !(3 == mp_add_~i~0 % 256); 31655#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31654#L76-1 assume !(0 == mp_add_~i~0 % 256); 31653#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 31594#L81-1 assume !(2 == mp_add_~i~0 % 256); 31640#L82-1 assume !(3 == mp_add_~i~0 % 256); 31637#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31625#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; 31624#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31623#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31622#L71 assume !(0 == mp_add_~i~0 % 256); 31619#L71-2 assume !(1 == mp_add_~i~0 % 256); 31608#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; 31606#L73-1 assume !(3 == mp_add_~i~0 % 256); 31607#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31597#L76-1 assume !(0 == mp_add_~i~0 % 256); 31598#L80-1 assume !(1 == mp_add_~i~0 % 256); 31591#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 31590#L82-1 assume !(3 == mp_add_~i~0 % 256); 31589#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31588#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; 31587#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31585#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 31586#L71 assume !(0 == mp_add_~i~0 % 256); 31596#L71-2 assume !(1 == mp_add_~i~0 % 256); 31592#L72-1 assume !(2 == mp_add_~i~0 % 256); 31583#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; 31584#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31636#L76-1 assume !(0 == mp_add_~i~0 % 256); 31635#L80-1 assume !(1 == mp_add_~i~0 % 256); 31634#L81-1 assume !(2 == mp_add_~i~0 % 256); 31632#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31630#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31628#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; 31620#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 31621#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31686#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31685#L76-1 assume !(0 == mp_add_~i~0 % 256); 31684#L80-1 assume !(1 == mp_add_~i~0 % 256); 31683#L81-1 assume !(2 == mp_add_~i~0 % 256); 31682#L82-1 assume !(3 == mp_add_~i~0 % 256); 31681#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31680#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; 31678#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31676#L65 [2018-11-28 11:53:19,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 6 times [2018-11-28 11:53:19,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:19,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:19,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:19,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1377322413, now seen corresponding path program 1 times [2018-11-28 11:53:19,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:19,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:19,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:19,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:19,349 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 11:53:19,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:19,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:53:19,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:19,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:53:19,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 11:53:19,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-28 11:53:19,511 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:19,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:53:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:53:19,512 INFO L87 Difference]: Start difference. First operand 1222 states and 1440 transitions. cyclomatic complexity: 231 Second operand 14 states. [2018-11-28 11:53:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:20,845 INFO L93 Difference]: Finished difference Result 2065 states and 2336 transitions. [2018-11-28 11:53:20,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-28 11:53:20,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2065 states and 2336 transitions. [2018-11-28 11:53:20,850 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 1132 [2018-11-28 11:53:20,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2065 states to 1986 states and 2214 transitions. [2018-11-28 11:53:20,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1986 [2018-11-28 11:53:20,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1986 [2018-11-28 11:53:20,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1986 states and 2214 transitions. [2018-11-28 11:53:20,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:20,858 INFO L705 BuchiCegarLoop]: Abstraction has 1986 states and 2214 transitions. [2018-11-28 11:53:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states and 2214 transitions. [2018-11-28 11:53:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1221. [2018-11-28 11:53:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2018-11-28 11:53:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1364 transitions. [2018-11-28 11:53:20,876 INFO L728 BuchiCegarLoop]: Abstraction has 1221 states and 1364 transitions. [2018-11-28 11:53:20,876 INFO L608 BuchiCegarLoop]: Abstraction has 1221 states and 1364 transitions. [2018-11-28 11:53:20,876 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-28 11:53:20,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1221 states and 1364 transitions. [2018-11-28 11:53:20,879 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 582 [2018-11-28 11:53:20,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:20,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:20,880 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 11:53:20,880 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:20,880 INFO L794 eck$LassoCheckResult]: Stem: 34725#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 34690#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34691#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34721#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34728#L40-1 mp_add_~nb~0 := 4; 34713#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34715#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34695#L54 assume !(0 == mp_add_~b1~0 % 256); 34696#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34709#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; 35300#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35301#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34692#L65-2 assume !(1 == mp_add_~i~0 % 256); 34693#L66-1 assume !(2 == mp_add_~i~0 % 256); 35643#L67-1 assume !(3 == mp_add_~i~0 % 256); 35644#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35699#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35697#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 35698#L80-1 assume !(1 == mp_add_~i~0 % 256); 35693#L81-1 assume !(2 == mp_add_~i~0 % 256); 35694#L82-1 assume !(3 == mp_add_~i~0 % 256); 35689#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35690#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; 35685#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35686#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35893#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35814#L76-1 [2018-11-28 11:53:20,880 INFO L796 eck$LassoCheckResult]: Loop: 35814#L76-1 assume !(0 == mp_add_~i~0 % 256); 35869#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 35710#L81-1 assume !(2 == mp_add_~i~0 % 256); 35866#L82-1 assume !(3 == mp_add_~i~0 % 256); 35864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35862#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; 35860#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35858#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35805#L71 assume !(0 == mp_add_~i~0 % 256); 35855#L71-2 assume !(1 == mp_add_~i~0 % 256); 35849#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; 35720#L73-1 assume !(3 == mp_add_~i~0 % 256); 35803#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35845#L76-1 assume !(0 == mp_add_~i~0 % 256); 35843#L80-1 assume !(1 == mp_add_~i~0 % 256); 35841#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 35839#L82-1 assume !(3 == mp_add_~i~0 % 256); 35838#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35794#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; 35763#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35764#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35762#L71 assume !(0 == mp_add_~i~0 % 256); 35759#L71-2 assume !(1 == mp_add_~i~0 % 256); 35760#L72-1 assume !(2 == mp_add_~i~0 % 256); 35757#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; 35758#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35753#L76-1 assume !(0 == mp_add_~i~0 % 256); 35754#L80-1 assume !(1 == mp_add_~i~0 % 256); 35750#L81-1 assume !(2 == mp_add_~i~0 % 256); 35747#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 35748#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35472#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; 35473#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35468#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 35467#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35462#L76-1 assume !(0 == mp_add_~i~0 % 256); 35463#L80-1 assume !(1 == mp_add_~i~0 % 256); 35458#L81-1 assume !(2 == mp_add_~i~0 % 256); 35459#L82-1 assume !(3 == mp_add_~i~0 % 256); 35454#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35455#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; 35726#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35727#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35722#L71 assume !(0 == mp_add_~i~0 % 256); 35723#L71-2 assume !(1 == mp_add_~i~0 % 256); 35715#L72-1 assume !(2 == mp_add_~i~0 % 256); 35716#L73-1 assume !(3 == mp_add_~i~0 % 256); 35783#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35784#L76-1 assume !(0 == mp_add_~i~0 % 256); 35779#L80-1 assume !(1 == mp_add_~i~0 % 256); 35780#L81-1 assume !(2 == mp_add_~i~0 % 256); 35707#L82-1 assume !(3 == mp_add_~i~0 % 256); 35166#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35167#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; 35681#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35682#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35498#L71 assume !(0 == mp_add_~i~0 % 256); 35499#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; 35816#L72-1 assume !(2 == mp_add_~i~0 % 256); 35815#L73-1 assume !(3 == mp_add_~i~0 % 256); 35813#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 35814#L76-1 [2018-11-28 11:53:20,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash 225456627, now seen corresponding path program 1 times [2018-11-28 11:53:20,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:20,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:20,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:20,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:20,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:53:20,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:20,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 11:53:20,970 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:53:20,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:20,970 INFO L82 PathProgramCache]: Analyzing trace with hash 642643045, now seen corresponding path program 1 times [2018-11-28 11:53:20,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:20,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:20,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:20,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:20,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-11-28 11:53:21,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:21,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:53:21,083 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:21,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 11:53:21,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 11:53:21,084 INFO L87 Difference]: Start difference. First operand 1221 states and 1364 transitions. cyclomatic complexity: 155 Second operand 8 states. [2018-11-28 11:53:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:21,593 INFO L93 Difference]: Finished difference Result 2045 states and 2238 transitions. [2018-11-28 11:53:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 11:53:21,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2045 states and 2238 transitions. [2018-11-28 11:53:21,597 INFO L131 ngComponentsAnalysis]: Automaton has 23 accepting balls. 912 [2018-11-28 11:53:21,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2045 states to 1861 states and 2045 transitions. [2018-11-28 11:53:21,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1861 [2018-11-28 11:53:21,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1861 [2018-11-28 11:53:21,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1861 states and 2045 transitions. [2018-11-28 11:53:21,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:21,602 INFO L705 BuchiCegarLoop]: Abstraction has 1861 states and 2045 transitions. [2018-11-28 11:53:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1861 states and 2045 transitions. [2018-11-28 11:53:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1861 to 1466. [2018-11-28 11:53:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1466 states. [2018-11-28 11:53:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1466 states to 1466 states and 1628 transitions. [2018-11-28 11:53:21,613 INFO L728 BuchiCegarLoop]: Abstraction has 1466 states and 1628 transitions. [2018-11-28 11:53:21,613 INFO L608 BuchiCegarLoop]: Abstraction has 1466 states and 1628 transitions. [2018-11-28 11:53:21,613 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-28 11:53:21,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1466 states and 1628 transitions. [2018-11-28 11:53:21,616 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 724 [2018-11-28 11:53:21,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:21,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:21,616 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 11:53:21,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:21,616 INFO L794 eck$LassoCheckResult]: Stem: 38013#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 37981#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37983#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38010#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38016#L40-1 mp_add_~nb~0 := 4; 38029#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 38023#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 38025#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 38721#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 38720#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; 38719#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38718#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 38717#L65-2 assume !(1 == mp_add_~i~0 % 256); 38716#L66-1 assume !(2 == mp_add_~i~0 % 256); 38714#L67-1 assume !(3 == mp_add_~i~0 % 256); 38711#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38709#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 38708#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 38706#L80-1 assume !(1 == mp_add_~i~0 % 256); 38704#L81-1 assume !(2 == mp_add_~i~0 % 256); 38702#L82-1 assume !(3 == mp_add_~i~0 % 256); 38700#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38698#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; 38693#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38694#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38697#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38688#L76-1 [2018-11-28 11:53:21,617 INFO L796 eck$LassoCheckResult]: Loop: 38688#L76-1 assume !(0 == mp_add_~i~0 % 256); 38664#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 38663#L81-1 assume !(2 == mp_add_~i~0 % 256); 38661#L82-1 assume !(3 == mp_add_~i~0 % 256); 38662#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38657#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; 38658#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38654#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38653#L71 assume !(0 == mp_add_~i~0 % 256); 38652#L71-2 assume !(1 == mp_add_~i~0 % 256); 38651#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; 38649#L73-1 assume !(3 == mp_add_~i~0 % 256); 38650#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 38644#L76-1 assume !(0 == mp_add_~i~0 % 256); 38645#L80-1 assume !(1 == mp_add_~i~0 % 256); 38640#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 38641#L82-1 assume !(3 == mp_add_~i~0 % 256); 38627#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38628#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; 38619#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38620#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 38629#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38584#L76-1 assume !(0 == mp_add_~i~0 % 256); 38625#L80-1 assume !(1 == mp_add_~i~0 % 256); 38626#L81-1 assume !(2 == mp_add_~i~0 % 256); 38611#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 38610#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38671#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; 38670#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38669#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38560#L71 assume !(0 == mp_add_~i~0 % 256); 38668#L71-2 assume !(1 == mp_add_~i~0 % 256); 38667#L72-1 assume !(2 == mp_add_~i~0 % 256); 38557#L73-1 assume !(3 == mp_add_~i~0 % 256); 38558#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38553#L76-1 assume !(0 == mp_add_~i~0 % 256); 38554#L80-1 assume !(1 == mp_add_~i~0 % 256); 38549#L81-1 assume !(2 == mp_add_~i~0 % 256); 38550#L82-1 assume !(3 == mp_add_~i~0 % 256); 38545#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38546#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; 38605#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38606#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38601#L71 assume !(0 == mp_add_~i~0 % 256); 38602#L71-2 assume !(1 == mp_add_~i~0 % 256); 38592#L72-1 assume !(2 == mp_add_~i~0 % 256); 38593#L73-1 assume !(3 == mp_add_~i~0 % 256); 38345#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38346#L76-1 assume !(0 == mp_add_~i~0 % 256); 38335#L80-1 assume !(1 == mp_add_~i~0 % 256); 38336#L81-1 assume !(2 == mp_add_~i~0 % 256); 38219#L82-1 assume !(3 == mp_add_~i~0 % 256); 38220#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38215#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; 38216#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38539#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38540#L71 assume !(0 == mp_add_~i~0 % 256); 38596#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; 38597#L72-1 assume !(2 == mp_add_~i~0 % 256); 38689#L73-1 assume !(3 == mp_add_~i~0 % 256); 38687#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 38688#L76-1 [2018-11-28 11:53:21,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1914400369, now seen corresponding path program 1 times [2018-11-28 11:53:21,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:21,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 11:53:21,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:21,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 11:53:21,716 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 11:53:21,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:21,716 INFO L82 PathProgramCache]: Analyzing trace with hash -255582207, now seen corresponding path program 1 times [2018-11-28 11:53:21,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:21,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:21,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 92 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 11:53:21,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:21,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:53:21,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:21,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:22,082 WARN L854 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~nb~0 Int)) (and (<= ULTIMATE.start_mp_add_~nb~0 (+ (* 256 (div ULTIMATE.start_mp_add_~nb~0 256)) 3)) (< (mod c_ULTIMATE.start_mp_add_~i~0 256) (mod ULTIMATE.start_mp_add_~nb~0 256)))) is different from true [2018-11-28 11:53:22,767 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 11:53:23,225 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 11:53:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-28 11:53:23,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:53:23,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2018-11-28 11:53:23,249 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 11:53:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 11:53:23,249 INFO L87 Difference]: Start difference. First operand 1466 states and 1628 transitions. cyclomatic complexity: 176 Second operand 9 states. [2018-11-28 11:53:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:23,646 INFO L93 Difference]: Finished difference Result 1308 states and 1410 transitions. [2018-11-28 11:53:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 11:53:23,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1308 states and 1410 transitions. [2018-11-28 11:53:23,648 INFO L131 ngComponentsAnalysis]: Automaton has 17 accepting balls. 498 [2018-11-28 11:53:23,651 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1308 states to 1174 states and 1268 transitions. [2018-11-28 11:53:23,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1174 [2018-11-28 11:53:23,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1174 [2018-11-28 11:53:23,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1174 states and 1268 transitions. [2018-11-28 11:53:23,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:23,653 INFO L705 BuchiCegarLoop]: Abstraction has 1174 states and 1268 transitions. [2018-11-28 11:53:23,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states and 1268 transitions. [2018-11-28 11:53:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1008. [2018-11-28 11:53:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1008 states. [2018-11-28 11:53:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1094 transitions. [2018-11-28 11:53:23,660 INFO L728 BuchiCegarLoop]: Abstraction has 1008 states and 1094 transitions. [2018-11-28 11:53:23,660 INFO L608 BuchiCegarLoop]: Abstraction has 1008 states and 1094 transitions. [2018-11-28 11:53:23,660 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-28 11:53:23,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1008 states and 1094 transitions. [2018-11-28 11:53:23,662 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 436 [2018-11-28 11:53:23,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:23,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:23,663 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, 1, 1, 1] [2018-11-28 11:53:23,663 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:23,663 INFO L794 eck$LassoCheckResult]: Stem: 40998#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 40963#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40965#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40996#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 41003#L40-1 mp_add_~nb~0 := 4; 40988#L50 assume !(0 == mp_add_~b3~0 % 256); 40989#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 41637#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; 41633#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41634#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 41648#L65-2 assume !(1 == mp_add_~i~0 % 256); 41649#L66-1 assume !(2 == mp_add_~i~0 % 256); 41644#L67-1 assume !(3 == mp_add_~i~0 % 256); 41645#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41640#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 41641#L71-2 assume !(1 == mp_add_~i~0 % 256); 41710#L72-1 assume !(2 == mp_add_~i~0 % 256); 41711#L73-1 assume !(3 == mp_add_~i~0 % 256); 41706#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 41707#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 41700#L80-1 assume !(1 == mp_add_~i~0 % 256); 41701#L81-1 assume !(2 == mp_add_~i~0 % 256); 41689#L82-1 assume !(3 == mp_add_~i~0 % 256); 41690#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41677#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; 41678#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41665#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41666#L71 assume !(0 == mp_add_~i~0 % 256); 41651#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; 41652#L72-1 [2018-11-28 11:53:23,663 INFO L796 eck$LassoCheckResult]: Loop: 41652#L72-1 assume !(2 == mp_add_~i~0 % 256); 41869#L73-1 assume !(3 == mp_add_~i~0 % 256); 41868#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41867#L76-1 assume !(0 == mp_add_~i~0 % 256); 41866#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 41722#L81-1 assume !(2 == mp_add_~i~0 % 256); 41865#L82-1 assume !(3 == mp_add_~i~0 % 256); 41864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41863#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; 41862#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41861#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41860#L71 assume !(0 == mp_add_~i~0 % 256); 41859#L71-2 assume !(1 == mp_add_~i~0 % 256); 41858#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; 41771#L73-1 assume !(3 == mp_add_~i~0 % 256); 41857#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41856#L76-1 assume !(0 == mp_add_~i~0 % 256); 41855#L80-1 assume !(1 == mp_add_~i~0 % 256); 41854#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 41853#L82-1 assume !(3 == mp_add_~i~0 % 256); 41852#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41851#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; 41850#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41849#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41848#L71 assume !(0 == mp_add_~i~0 % 256); 41847#L71-2 assume !(1 == mp_add_~i~0 % 256); 41846#L72-1 assume !(2 == mp_add_~i~0 % 256); 41844#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; 41841#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 41839#L76-1 assume !(0 == mp_add_~i~0 % 256); 41837#L80-1 assume !(1 == mp_add_~i~0 % 256); 41835#L81-1 assume !(2 == mp_add_~i~0 % 256); 41833#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 41831#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41830#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; 41828#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41825#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41823#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41822#L76-1 assume !(0 == mp_add_~i~0 % 256); 41821#L80-1 assume !(1 == mp_add_~i~0 % 256); 41820#L81-1 assume !(2 == mp_add_~i~0 % 256); 41819#L82-1 assume !(3 == mp_add_~i~0 % 256); 41818#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41817#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; 41816#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41815#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41814#L71 assume !(0 == mp_add_~i~0 % 256); 41812#L71-2 assume !(1 == mp_add_~i~0 % 256); 41813#L72-1 assume !(2 == mp_add_~i~0 % 256); 41738#L73-1 assume !(3 == mp_add_~i~0 % 256); 41739#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 41728#L76-1 assume !(0 == mp_add_~i~0 % 256); 41729#L80-1 assume !(1 == mp_add_~i~0 % 256); 41717#L81-1 assume !(2 == mp_add_~i~0 % 256); 41691#L82-1 assume !(3 == mp_add_~i~0 % 256); 41692#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41679#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; 41680#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 41667#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41668#L71 assume !(0 == mp_add_~i~0 % 256); 41653#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; 41652#L72-1 [2018-11-28 11:53:23,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash 67958091, now seen corresponding path program 1 times [2018-11-28 11:53:23,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:23,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,681 INFO L82 PathProgramCache]: Analyzing trace with hash 526023181, now seen corresponding path program 2 times [2018-11-28 11:53:23,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:23,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 11:53:23,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:23,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 11:53:23,749 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:23,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 11:53:23,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 11:53:23,749 INFO L87 Difference]: Start difference. First operand 1008 states and 1094 transitions. cyclomatic complexity: 96 Second operand 5 states. [2018-11-28 11:53:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:23,813 INFO L93 Difference]: Finished difference Result 1015 states and 1097 transitions. [2018-11-28 11:53:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 11:53:23,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1015 states and 1097 transitions. [2018-11-28 11:53:23,815 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 412 [2018-11-28 11:53:23,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1015 states to 1015 states and 1097 transitions. [2018-11-28 11:53:23,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1015 [2018-11-28 11:53:23,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1015 [2018-11-28 11:53:23,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 1097 transitions. [2018-11-28 11:53:23,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:23,817 INFO L705 BuchiCegarLoop]: Abstraction has 1015 states and 1097 transitions. [2018-11-28 11:53:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 1097 transitions. [2018-11-28 11:53:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 891. [2018-11-28 11:53:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2018-11-28 11:53:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 966 transitions. [2018-11-28 11:53:23,824 INFO L728 BuchiCegarLoop]: Abstraction has 891 states and 966 transitions. [2018-11-28 11:53:23,824 INFO L608 BuchiCegarLoop]: Abstraction has 891 states and 966 transitions. [2018-11-28 11:53:23,825 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-28 11:53:23,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 891 states and 966 transitions. [2018-11-28 11:53:23,826 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 291 [2018-11-28 11:53:23,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:23,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:23,827 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:23,827 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:23,827 INFO L794 eck$LassoCheckResult]: Stem: 43026#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 42994#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 42996#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 43025#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 43030#L40-1 mp_add_~nb~0 := 4; 43127#L50 assume !(0 == mp_add_~b3~0 % 256); 43016#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 43017#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; 43603#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 43604#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 43679#L65-2 assume !(1 == mp_add_~i~0 % 256); 43680#L66-1 assume !(2 == mp_add_~i~0 % 256); 43675#L67-1 assume !(3 == mp_add_~i~0 % 256); 43676#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43671#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 43672#L71-2 assume !(1 == mp_add_~i~0 % 256); 43706#L72-1 assume !(2 == mp_add_~i~0 % 256); 43707#L73-1 assume !(3 == mp_add_~i~0 % 256); 43702#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 43703#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 43698#L80-1 assume !(1 == mp_add_~i~0 % 256); 43699#L81-1 assume !(2 == mp_add_~i~0 % 256); 43694#L82-1 assume !(3 == mp_add_~i~0 % 256); 43695#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43690#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; 43691#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43686#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43687#L71 assume !(0 == mp_add_~i~0 % 256); 43682#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; 43683#L72-1 assume !(2 == mp_add_~i~0 % 256); 43814#L73-1 assume !(3 == mp_add_~i~0 % 256); 43813#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 43812#L76-1 assume !(0 == mp_add_~i~0 % 256); 43811#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 43810#L81-1 assume !(2 == mp_add_~i~0 % 256); 43809#L82-1 assume !(3 == mp_add_~i~0 % 256); 43808#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43807#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; 43806#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43805#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43804#L71 assume !(0 == mp_add_~i~0 % 256); 43803#L71-2 assume !(1 == mp_add_~i~0 % 256); 43802#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; 43427#L73-1 [2018-11-28 11:53:23,827 INFO L796 eck$LassoCheckResult]: Loop: 43427#L73-1 assume !(3 == mp_add_~i~0 % 256); 43797#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43795#L76-1 assume !(0 == mp_add_~i~0 % 256); 43793#L80-1 assume !(1 == mp_add_~i~0 % 256); 43790#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 43341#L82-1 assume !(3 == mp_add_~i~0 % 256); 43786#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43787#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; 43783#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43782#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43781#L71 assume !(0 == mp_add_~i~0 % 256); 43780#L71-2 assume !(1 == mp_add_~i~0 % 256); 43779#L72-1 assume !(2 == mp_add_~i~0 % 256); 43778#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; 43776#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 43777#L76-1 assume !(0 == mp_add_~i~0 % 256); 43873#L80-1 assume !(1 == mp_add_~i~0 % 256); 43772#L81-1 assume !(2 == mp_add_~i~0 % 256); 43771#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 43020#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43012#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; 43013#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43027#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 42998#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43015#L76-1 assume !(0 == mp_add_~i~0 % 256); 43828#L80-1 assume !(1 == mp_add_~i~0 % 256); 43826#L81-1 assume !(2 == mp_add_~i~0 % 256); 43825#L82-1 assume !(3 == mp_add_~i~0 % 256); 43824#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43823#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; 43822#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43821#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43819#L71 assume !(0 == mp_add_~i~0 % 256); 43817#L71-2 assume !(1 == mp_add_~i~0 % 256); 43815#L72-1 assume !(2 == mp_add_~i~0 % 256); 43799#L73-1 assume !(3 == mp_add_~i~0 % 256); 43798#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 43796#L76-1 assume !(0 == mp_add_~i~0 % 256); 43794#L80-1 assume !(1 == mp_add_~i~0 % 256); 43792#L81-1 assume !(2 == mp_add_~i~0 % 256); 43788#L82-1 assume !(3 == mp_add_~i~0 % 256); 43789#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 43784#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; 43785#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 43820#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 43818#L71 assume !(0 == mp_add_~i~0 % 256); 43816#L71-2 assume !(1 == mp_add_~i~0 % 256); 43800#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; 43427#L73-1 [2018-11-28 11:53:23,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,828 INFO L82 PathProgramCache]: Analyzing trace with hash 479796297, now seen corresponding path program 1 times [2018-11-28 11:53:23,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:23,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:23,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1511836427, now seen corresponding path program 1 times [2018-11-28 11:53:23,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:23,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:23,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:23,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 11:53:23,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:23,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:53:23,935 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:53:23,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:53:23,936 INFO L87 Difference]: Start difference. First operand 891 states and 966 transitions. cyclomatic complexity: 83 Second operand 6 states. [2018-11-28 11:53:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:24,063 INFO L93 Difference]: Finished difference Result 961 states and 1032 transitions. [2018-11-28 11:53:24,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:53:24,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 961 states and 1032 transitions. [2018-11-28 11:53:24,066 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 183 [2018-11-28 11:53:24,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 961 states to 786 states and 848 transitions. [2018-11-28 11:53:24,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 786 [2018-11-28 11:53:24,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 786 [2018-11-28 11:53:24,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 786 states and 848 transitions. [2018-11-28 11:53:24,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:24,068 INFO L705 BuchiCegarLoop]: Abstraction has 786 states and 848 transitions. [2018-11-28 11:53:24,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states and 848 transitions. [2018-11-28 11:53:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 654. [2018-11-28 11:53:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-28 11:53:24,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 709 transitions. [2018-11-28 11:53:24,073 INFO L728 BuchiCegarLoop]: Abstraction has 654 states and 709 transitions. [2018-11-28 11:53:24,073 INFO L608 BuchiCegarLoop]: Abstraction has 654 states and 709 transitions. [2018-11-28 11:53:24,073 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-28 11:53:24,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 654 states and 709 transitions. [2018-11-28 11:53:24,074 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 175 [2018-11-28 11:53:24,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:24,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:24,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:24,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-28 11:53:24,075 INFO L794 eck$LassoCheckResult]: Stem: 44892#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 44858#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 44860#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 44890#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 44896#L40-1 mp_add_~nb~0 := 4; 44883#L50 assume !(0 == mp_add_~b3~0 % 256); 44884#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 45407#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; 45406#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 45355#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 44863#L65-2 assume !(1 == mp_add_~i~0 % 256); 44864#L66-1 assume !(2 == mp_add_~i~0 % 256); 44873#L67-1 assume !(3 == mp_add_~i~0 % 256); 44874#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45490#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 45491#L71-2 assume !(1 == mp_add_~i~0 % 256); 44882#L72-1 assume !(2 == mp_add_~i~0 % 256); 44861#L73-1 assume !(3 == mp_add_~i~0 % 256); 44862#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 44879#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 45485#L80-1 assume !(1 == mp_add_~i~0 % 256); 45483#L81-1 assume !(2 == mp_add_~i~0 % 256); 45481#L82-1 assume !(3 == mp_add_~i~0 % 256); 45479#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45477#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; 45475#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45473#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45471#L71 assume !(0 == mp_add_~i~0 % 256); 45469#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; 45468#L72-1 assume !(2 == mp_add_~i~0 % 256); 45467#L73-1 assume !(3 == mp_add_~i~0 % 256); 45466#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 45464#L76-1 assume !(0 == mp_add_~i~0 % 256); 45462#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 45460#L81-1 assume !(2 == mp_add_~i~0 % 256); 45459#L82-1 assume !(3 == mp_add_~i~0 % 256); 45458#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45453#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; 45451#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45448#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45445#L71 assume !(0 == mp_add_~i~0 % 256); 45442#L71-2 assume !(1 == mp_add_~i~0 % 256); 45438#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; 45233#L73-1 [2018-11-28 11:53:24,075 INFO L796 eck$LassoCheckResult]: Loop: 45233#L73-1 assume !(3 == mp_add_~i~0 % 256); 45435#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45433#L76-1 assume !(0 == mp_add_~i~0 % 256); 45431#L80-1 assume !(1 == mp_add_~i~0 % 256); 45428#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 45227#L82-1 assume !(3 == mp_add_~i~0 % 256); 45455#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45454#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; 45423#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45421#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45420#L71 assume !(0 == mp_add_~i~0 % 256); 45419#L71-2 assume !(1 == mp_add_~i~0 % 256); 45418#L72-1 assume !(2 == mp_add_~i~0 % 256); 45416#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; 45417#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45496#L76-1 assume !(0 == mp_add_~i~0 % 256); 45495#L80-1 assume !(1 == mp_add_~i~0 % 256); 45494#L81-1 assume !(2 == mp_add_~i~0 % 256); 45493#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 45492#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 44876#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; 44877#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45487#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45486#L71 assume !(0 == mp_add_~i~0 % 256); 45484#L71-2 assume !(1 == mp_add_~i~0 % 256); 45482#L72-1 assume !(2 == mp_add_~i~0 % 256); 45480#L73-1 assume !(3 == mp_add_~i~0 % 256); 45478#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45476#L76-1 assume !(0 == mp_add_~i~0 % 256); 45474#L80-1 assume !(1 == mp_add_~i~0 % 256); 45472#L81-1 assume !(2 == mp_add_~i~0 % 256); 45470#L82-1 assume !(3 == mp_add_~i~0 % 256); 45457#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45456#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; 45452#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45450#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45447#L71 assume !(0 == mp_add_~i~0 % 256); 45444#L71-2 assume !(1 == mp_add_~i~0 % 256); 45441#L72-1 assume !(2 == mp_add_~i~0 % 256); 45437#L73-1 assume !(3 == mp_add_~i~0 % 256); 45436#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 45434#L76-1 assume !(0 == mp_add_~i~0 % 256); 45432#L80-1 assume !(1 == mp_add_~i~0 % 256); 45430#L81-1 assume !(2 == mp_add_~i~0 % 256); 45427#L82-1 assume !(3 == mp_add_~i~0 % 256); 45426#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 45424#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; 45425#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 45449#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 45446#L71 assume !(0 == mp_add_~i~0 % 256); 45443#L71-2 assume !(1 == mp_add_~i~0 % 256); 45439#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; 45233#L73-1 [2018-11-28 11:53:24,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:24,075 INFO L82 PathProgramCache]: Analyzing trace with hash 479796297, now seen corresponding path program 2 times [2018-11-28 11:53:24,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:24,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:24,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:24,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:24,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:24,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1158440831, now seen corresponding path program 1 times [2018-11-28 11:53:24,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:24,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:24,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:24,192 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-28 11:53:24,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:24,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 11:53:24,193 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:24,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 11:53:24,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-28 11:53:24,193 INFO L87 Difference]: Start difference. First operand 654 states and 709 transitions. cyclomatic complexity: 61 Second operand 6 states. [2018-11-28 11:53:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:24,334 INFO L93 Difference]: Finished difference Result 659 states and 706 transitions. [2018-11-28 11:53:24,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 11:53:24,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 706 transitions. [2018-11-28 11:53:24,336 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2018-11-28 11:53:24,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 659 states and 706 transitions. [2018-11-28 11:53:24,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2018-11-28 11:53:24,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2018-11-28 11:53:24,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 706 transitions. [2018-11-28 11:53:24,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:24,338 INFO L705 BuchiCegarLoop]: Abstraction has 659 states and 706 transitions. [2018-11-28 11:53:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 706 transitions. [2018-11-28 11:53:24,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 581. [2018-11-28 11:53:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 581 states. [2018-11-28 11:53:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 621 transitions. [2018-11-28 11:53:24,341 INFO L728 BuchiCegarLoop]: Abstraction has 581 states and 621 transitions. [2018-11-28 11:53:24,341 INFO L608 BuchiCegarLoop]: Abstraction has 581 states and 621 transitions. [2018-11-28 11:53:24,341 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-28 11:53:24,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 581 states and 621 transitions. [2018-11-28 11:53:24,342 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 92 [2018-11-28 11:53:24,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:24,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:24,346 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:24,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 11:53:24,347 INFO L794 eck$LassoCheckResult]: Stem: 46214#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 46182#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46183#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 46211#L44 assume !(0 == mp_add_~a1~0 % 256); 46218#L40-1 mp_add_~nb~0 := 4; 46225#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46206#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46208#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 46303#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 46301#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; 46299#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46297#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 46295#L65-2 assume !(1 == mp_add_~i~0 % 256); 46293#L66-1 assume !(2 == mp_add_~i~0 % 256); 46291#L67-1 assume !(3 == mp_add_~i~0 % 256); 46289#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 46287#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 46285#L71-2 assume !(1 == mp_add_~i~0 % 256); 46283#L72-1 assume !(2 == mp_add_~i~0 % 256); 46281#L73-1 assume !(3 == mp_add_~i~0 % 256); 46279#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 46277#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 46275#L80-1 assume !(1 == mp_add_~i~0 % 256); 46273#L81-1 assume !(2 == mp_add_~i~0 % 256); 46271#L82-1 assume !(3 == mp_add_~i~0 % 256); 46269#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46267#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; 46265#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 46263#L65 assume !(0 == mp_add_~i~0 % 256); 46261#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; 46259#L66-1 assume !(2 == mp_add_~i~0 % 256); 46257#L67-1 assume !(3 == mp_add_~i~0 % 256); 46255#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 46252#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 46251#L76-1 assume !(0 == mp_add_~i~0 % 256); 46249#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 46247#L81-1 assume !(2 == mp_add_~i~0 % 256); 46245#L82-1 assume !(3 == mp_add_~i~0 % 256); 46243#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46241#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); 46240#L88-1 assume !!(mp_add_~i~0 % 256 < 4); 46239#L89 assume !(0 == mp_add_~i~0 % 256); 46237#L89-2 assume !(1 == mp_add_~i~0 % 256); 46234#L90-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := 0; 46171#L91-1 assume !(3 == mp_add_~i~0 % 256); 46172#L92-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46200#L88-1 assume !!(mp_add_~i~0 % 256 < 4); 46196#L89 assume !(0 == mp_add_~i~0 % 256); 46192#L89-2 assume !(1 == mp_add_~i~0 % 256); 46193#L90-1 assume !(2 == mp_add_~i~0 % 256); 46221#L91-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := 0; 46226#L92-1 [2018-11-28 11:53:24,347 INFO L796 eck$LassoCheckResult]: Loop: 46226#L92-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 46232#L88-1 assume !!(mp_add_~i~0 % 256 < 4); 46231#L89 assume !(0 == mp_add_~i~0 % 256); 46230#L89-2 assume !(1 == mp_add_~i~0 % 256); 46229#L90-1 assume !(2 == mp_add_~i~0 % 256); 46227#L91-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := 0; 46226#L92-1 [2018-11-28 11:53:24,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1702277999, now seen corresponding path program 1 times [2018-11-28 11:53:24,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:24,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:24,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1745943634, now seen corresponding path program 1 times [2018-11-28 11:53:24,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:24,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:24,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:24,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:24,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1391631586, now seen corresponding path program 2 times [2018-11-28 11:53:24,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:24,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:24,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 11:53:24,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:24,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 11:53:24,468 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:24,468 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:24,468 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:24,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:24,469 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:24,469 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:24,469 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:24,469 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:24,469 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2018-11-28 11:53:24,469 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:24,469 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:24,469 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 11:53:24,477 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 11:53:24,520 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:24,520 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:24,524 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:24,524 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:24,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:24,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:24,662 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:24,663 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:24,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:24,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:24,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:24,664 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:24,664 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:24,664 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:24,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:24,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration22_Loop [2018-11-28 11:53:24,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:24,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:24,664 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 11:53:24,668 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 11:53:24,706 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:24,706 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:24,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:24,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:24,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:24,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,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 11:53:24,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:24,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:24,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,710 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:53:24,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:24,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,711 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:24,712 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:24,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:24,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,714 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:24,714 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:24,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,715 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:53:24,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,716 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:24,716 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:24,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:24,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,719 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:24,719 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:24,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,720 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:53:24,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,721 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:24,721 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:24,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:24,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:24,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,724 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:24,725 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:24,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,725 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:53:24,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,726 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:24,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:24,727 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:24,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:24,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,730 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:24,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:24,731 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:24,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,732 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:53:24,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:24,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,732 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:24,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:24,734 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:24,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,740 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:24,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:24,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:24,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,742 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:53:24,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,743 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:24,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:24,744 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:24,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,753 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:24,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,754 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:24,755 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:24,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,755 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:53:24,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,756 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:24,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,756 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:24,757 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:24,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,761 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,761 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:24,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:24,762 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:24,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,763 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:53:24,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,764 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:24,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,764 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:24,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:24,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:24,774 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:24,775 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:24,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:24,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:24,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:24,775 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:24,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:24,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:24,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:53:24,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:53:24,778 INFO L87 Difference]: Start difference. First operand 581 states and 621 transitions. cyclomatic complexity: 45 Second operand 7 states. [2018-11-28 11:53:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:25,077 INFO L93 Difference]: Finished difference Result 615 states and 652 transitions. [2018-11-28 11:53:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:53:25,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 615 states and 652 transitions. [2018-11-28 11:53:25,079 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 92 [2018-11-28 11:53:25,080 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 615 states to 337 states and 356 transitions. [2018-11-28 11:53:25,080 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 337 [2018-11-28 11:53:25,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 337 [2018-11-28 11:53:25,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 337 states and 356 transitions. [2018-11-28 11:53:25,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:25,080 INFO L705 BuchiCegarLoop]: Abstraction has 337 states and 356 transitions. [2018-11-28 11:53:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states and 356 transitions. [2018-11-28 11:53:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 305. [2018-11-28 11:53:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-28 11:53:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 324 transitions. [2018-11-28 11:53:25,083 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 324 transitions. [2018-11-28 11:53:25,083 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 324 transitions. [2018-11-28 11:53:25,083 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-28 11:53:25,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 324 transitions. [2018-11-28 11:53:25,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2018-11-28 11:53:25,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:25,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:25,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:25,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1] [2018-11-28 11:53:25,085 INFO L794 eck$LassoCheckResult]: Stem: 47402#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 47394#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47396#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47400#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 47407#L40-1 mp_add_~nb~0 := 4; 47526#L50 assume !(0 == mp_add_~b3~0 % 256); 47387#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 47388#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; 47523#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 47410#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 47398#L65-2 assume !(1 == mp_add_~i~0 % 256); 47399#L66-1 assume !(2 == mp_add_~i~0 % 256); 47408#L67-1 assume !(3 == mp_add_~i~0 % 256); 47409#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47625#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 47624#L71-2 assume !(1 == mp_add_~i~0 % 256); 47623#L72-1 assume !(2 == mp_add_~i~0 % 256); 47622#L73-1 assume !(3 == mp_add_~i~0 % 256); 47621#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 47620#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 47619#L80-1 assume !(1 == mp_add_~i~0 % 256); 47618#L81-1 assume !(2 == mp_add_~i~0 % 256); 47617#L82-1 assume !(3 == mp_add_~i~0 % 256); 47616#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47615#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; 47613#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47614#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47609#L71 assume !(0 == mp_add_~i~0 % 256); 47610#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; 47605#L72-1 assume !(2 == mp_add_~i~0 % 256); 47606#L73-1 assume !(3 == mp_add_~i~0 % 256); 47601#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 47602#L76-1 assume !(0 == mp_add_~i~0 % 256); 47597#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 47598#L81-1 assume !(2 == mp_add_~i~0 % 256); 47669#L82-1 assume !(3 == mp_add_~i~0 % 256); 47668#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47591#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; 47592#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47664#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47662#L71 assume !(0 == mp_add_~i~0 % 256); 47661#L71-2 assume !(1 == mp_add_~i~0 % 256); 47660#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; 47659#L73-1 assume !(3 == mp_add_~i~0 % 256); 47658#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 47657#L76-1 assume !(0 == mp_add_~i~0 % 256); 47656#L80-1 assume !(1 == mp_add_~i~0 % 256); 47655#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 47654#L82-1 assume !(3 == mp_add_~i~0 % 256); 47653#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47565#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; 47566#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47652#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47651#L71 assume !(0 == mp_add_~i~0 % 256); 47650#L71-2 assume !(1 == mp_add_~i~0 % 256); 47649#L72-1 assume !(2 == mp_add_~i~0 % 256); 47647#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; 47646#L70 [2018-11-28 11:53:25,085 INFO L796 eck$LassoCheckResult]: Loop: 47646#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 47645#L76-1 assume !(0 == mp_add_~i~0 % 256); 47644#L80-1 assume !(1 == mp_add_~i~0 % 256); 47643#L81-1 assume !(2 == mp_add_~i~0 % 256); 47642#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 47641#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47640#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; 47639#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47638#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47637#L71 assume !(0 == mp_add_~i~0 % 256); 47636#L71-2 assume !(1 == mp_add_~i~0 % 256); 47635#L72-1 assume !(2 == mp_add_~i~0 % 256); 47634#L73-1 assume !(3 == mp_add_~i~0 % 256); 47633#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 47632#L76-1 assume !(0 == mp_add_~i~0 % 256); 47631#L80-1 assume !(1 == mp_add_~i~0 % 256); 47630#L81-1 assume !(2 == mp_add_~i~0 % 256); 47628#L82-1 assume !(3 == mp_add_~i~0 % 256); 47629#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47672#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; 47671#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47670#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47582#L71 assume !(0 == mp_add_~i~0 % 256); 47583#L71-2 assume !(1 == mp_add_~i~0 % 256); 47578#L72-1 assume !(2 == mp_add_~i~0 % 256); 47579#L73-1 assume !(3 == mp_add_~i~0 % 256); 47648#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 47667#L76-1 assume !(0 == mp_add_~i~0 % 256); 47666#L80-1 assume !(1 == mp_add_~i~0 % 256); 47665#L81-1 assume !(2 == mp_add_~i~0 % 256); 47663#L82-1 assume !(3 == mp_add_~i~0 % 256); 47548#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 47549#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; 47544#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 47545#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 47540#L71 assume !(0 == mp_add_~i~0 % 256); 47541#L71-2 assume !(1 == mp_add_~i~0 % 256); 47536#L72-1 assume !(2 == mp_add_~i~0 % 256); 47537#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; 47646#L70 [2018-11-28 11:53:25,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash -62570223, now seen corresponding path program 1 times [2018-11-28 11:53:25,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:25,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:25,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 11:53:25,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:25,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:25,107 INFO L82 PathProgramCache]: Analyzing trace with hash 910661453, now seen corresponding path program 1 times [2018-11-28 11:53:25,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:25,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:25,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:25,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-28 11:53:25,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 11:53:25,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 11:53:25,258 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 11:53:25,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 11:53:25,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-28 11:53:25,258 INFO L87 Difference]: Start difference. First operand 305 states and 324 transitions. cyclomatic complexity: 22 Second operand 7 states. [2018-11-28 11:53:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:25,360 INFO L93 Difference]: Finished difference Result 309 states and 326 transitions. [2018-11-28 11:53:25,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 11:53:25,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 326 transitions. [2018-11-28 11:53:25,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2018-11-28 11:53:25,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 309 states and 326 transitions. [2018-11-28 11:53:25,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 309 [2018-11-28 11:53:25,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 309 [2018-11-28 11:53:25,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 309 states and 326 transitions. [2018-11-28 11:53:25,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:25,363 INFO L705 BuchiCegarLoop]: Abstraction has 309 states and 326 transitions. [2018-11-28 11:53:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 326 transitions. [2018-11-28 11:53:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 204. [2018-11-28 11:53:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-28 11:53:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-11-28 11:53:25,364 INFO L728 BuchiCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-11-28 11:53:25,365 INFO L608 BuchiCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-11-28 11:53:25,365 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-28 11:53:25,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 217 transitions. [2018-11-28 11:53:25,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 11:53:25,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 11:53:25,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 11:53:25,366 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 11:53:25,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 11:53:25,366 INFO L794 eck$LassoCheckResult]: Stem: 48027#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;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; 48019#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 48021#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 48025#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 48032#L40-1 mp_add_~nb~0 := 4; 48079#L50 assume !(0 == mp_add_~b3~0 % 256); 48010#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 48011#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; 48151#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 48150#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 48022#L65-2 assume !(1 == mp_add_~i~0 % 256); 48023#L66-1 assume !(2 == mp_add_~i~0 % 256); 48033#L67-1 assume !(3 == mp_add_~i~0 % 256); 48034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48204#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 48203#L71-2 assume !(1 == mp_add_~i~0 % 256); 48202#L72-1 assume !(2 == mp_add_~i~0 % 256); 48201#L73-1 assume !(3 == mp_add_~i~0 % 256); 48200#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 48199#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 48198#L80-1 assume !(1 == mp_add_~i~0 % 256); 48197#L81-1 assume !(2 == mp_add_~i~0 % 256); 48196#L82-1 assume !(3 == mp_add_~i~0 % 256); 48195#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48194#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; 48193#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48192#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48191#L71 assume !(0 == mp_add_~i~0 % 256); 48190#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; 48189#L72-1 assume !(2 == mp_add_~i~0 % 256); 48188#L73-1 assume !(3 == mp_add_~i~0 % 256); 48187#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 48186#L76-1 assume !(0 == mp_add_~i~0 % 256); 48185#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 48184#L81-1 assume !(2 == mp_add_~i~0 % 256); 48183#L82-1 assume !(3 == mp_add_~i~0 % 256); 48182#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48181#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; 48180#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48179#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48178#L71 assume !(0 == mp_add_~i~0 % 256); 48177#L71-2 assume !(1 == mp_add_~i~0 % 256); 48176#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; 48175#L73-1 assume !(3 == mp_add_~i~0 % 256); 48174#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 48173#L76-1 assume !(0 == mp_add_~i~0 % 256); 48172#L80-1 assume !(1 == mp_add_~i~0 % 256); 48171#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 48170#L82-1 assume !(3 == mp_add_~i~0 % 256); 48169#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48168#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; 48166#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48164#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48163#L71 assume !(0 == mp_add_~i~0 % 256); 48162#L71-2 assume !(1 == mp_add_~i~0 % 256); 48161#L72-1 assume !(2 == mp_add_~i~0 % 256); 48160#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; 48159#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 48158#L76-1 assume !(0 == mp_add_~i~0 % 256); 48157#L80-1 assume !(1 == mp_add_~i~0 % 256); 48156#L81-1 assume !(2 == mp_add_~i~0 % 256); 48155#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 48012#L83-1 [2018-11-28 11:53:25,366 INFO L796 eck$LassoCheckResult]: Loop: 48012#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 48006#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; 48007#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 48024#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 48015#L71 assume !(0 == mp_add_~i~0 % 256); 48003#L71-2 assume !(1 == mp_add_~i~0 % 256); 48004#L72-1 assume !(2 == mp_add_~i~0 % 256); 48016#L73-1 assume !(3 == mp_add_~i~0 % 256); 48008#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 48009#L76-1 assume !(0 == mp_add_~i~0 % 256); 48001#L80-1 assume !(1 == mp_add_~i~0 % 256); 48002#L81-1 assume !(2 == mp_add_~i~0 % 256); 48005#L82-1 assume !(3 == mp_add_~i~0 % 256); 48012#L83-1 [2018-11-28 11:53:25,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash -181276600, now seen corresponding path program 1 times [2018-11-28 11:53:25,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:25,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:25,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:25,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:25,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:25,393 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 1 times [2018-11-28 11:53:25,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:25,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:25,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:25,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 11:53:25,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 11:53:25,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1480807712, now seen corresponding path program 1 times [2018-11-28 11:53:25,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 11:53:25,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 11:53:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:25,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 11:53:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:25,640 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 11:53:25,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 11:53:25,641 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:53:25,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 11:53:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 11:53:25,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 11:53:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-28 11:53:25,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 11:53:25,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2018-11-28 11:53:25,795 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:25,796 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:25,796 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:25,796 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:25,796 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 11:53:25,796 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:25,796 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:25,796 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:25,796 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-28 11:53:25,796 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:25,796 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:25,797 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 11:53:25,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 11:53:25,920 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:25,920 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:25,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:25,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:25,930 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 11:53:25,930 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_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:25,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 11:53:25,947 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f6d8e0cb-744b-4b92-b06e-3730fd4f0ba6/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 11:53:25,998 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 11:53:25,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 11:53:26,566 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 11:53:26,569 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 11:53:26,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 11:53:26,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 11:53:26,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 11:53:26,569 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 11:53:26,569 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 11:53:26,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 11:53:26,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 11:53:26,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_false-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-28 11:53:26,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 11:53:26,570 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 11:53:26,570 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 11:53:26,581 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 11:53:26,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 11:53:26,709 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 11:53:26,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 11:53:26,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:26,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 11:53:26,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 11:53:26,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,713 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-28 11:53:26,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:26,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,713 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:26,714 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:26,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:26,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,715 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:26,715 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:26,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,717 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-28 11:53:26,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:26,718 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:26,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:26,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,719 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:26,720 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:26,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,723 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-28 11:53:26,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,724 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:26,724 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:26,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 11:53:26,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,726 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:26,727 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:26,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,730 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-28 11:53:26,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:26,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,731 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:26,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:26,732 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:26,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,733 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:26,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,734 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-28 11:53:26,734 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-28 11:53:26,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,739 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-28 11:53:26,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of 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 11:53:26,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,740 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:26,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:26,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:26,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,744 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-28 11:53:26,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:26,745 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:26,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,753 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-28 11:53:26,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,754 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:26,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,754 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:26,756 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:26,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,757 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:26,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,758 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-28 11:53:26,760 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-28 11:53:26,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,771 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-28 11:53:26,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,772 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:26,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,772 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:26,773 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:26,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-28 11:53:26,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-28 11:53:26,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 11:53:26,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,781 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-28 11:53:26,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,782 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,782 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:26,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,782 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:26,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 11:53:26,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-28 11:53:26,787 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-28 11:53:26,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 11:53:26,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 11:53:26,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 11:53:26,788 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-28 11:53:26,789 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 11:53:26,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 11:53:26,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 11:53:26,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 11:53:26,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-11-28 11:53:26,798 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. cyclomatic complexity: 14 Second operand 14 states. [2018-11-28 11:53:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 11:53:27,118 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2018-11-28 11:53:27,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 11:53:27,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 217 transitions. [2018-11-28 11:53:27,120 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:27,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 0 states and 0 transitions. [2018-11-28 11:53:27,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 11:53:27,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 11:53:27,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 11:53:27,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 11:53:27,121 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:27,121 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:27,121 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 11:53:27,121 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-28 11:53:27,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 11:53:27,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 11:53:27,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 11:53:27,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:53:27 BoogieIcfgContainer [2018-11-28 11:53:27,129 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 11:53:27,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 11:53:27,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 11:53:27,130 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 11:53:27,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:52:52" (3/4) ... [2018-11-28 11:53:27,133 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 11:53:27,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 11:53:27,134 INFO L168 Benchmark]: Toolchain (without parser) took 35145.30 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 956.0 MB in the beginning and 883.5 MB in the end (delta: 72.5 MB). Peak memory consumption was 376.0 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,135 INFO L168 Benchmark]: CDTParser took 0.11 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 11:53:27,135 INFO L168 Benchmark]: CACSL2BoogieTranslator took 188.31 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,136 INFO L168 Benchmark]: Boogie Preprocessor took 19.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,137 INFO L168 Benchmark]: RCFGBuilder took 280.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,137 INFO L168 Benchmark]: BuchiAutomizer took 34584.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 215.4 MB). Peak memory consumption was 395.8 MB. Max. memory is 11.5 GB. [2018-11-28 11:53:27,137 INFO L168 Benchmark]: Witness Printer took 3.63 ms. Allocated memory is still 1.3 GB. Free memory is still 883.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 11:53:27,142 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 188.31 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 939.9 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 65.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -181.4 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 280.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 34584.90 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 883.5 MB in the end (delta: 215.4 MB). Peak memory consumption was 395.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.63 ms. Allocated memory is still 1.3 GB. Free memory is still 883.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (24 trivial, 0 deterministic, 0 nondeterministic). 24 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.5s and 25 iterations. TraceHistogramMax:6. Analysis of lassos took 23.2s. Construction of modules took 8.0s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 0. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 7042 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1660 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1330 SDtfs, 5071 SDslu, 3207 SDs, 0 SdLazy, 9474 SolverSat, 854 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 8.0s Time LassoAnalysisResults: nont0 unkn0 SFLI13 SFLT0 conc5 concLT0 SILN0 SILU0 SILI6 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital47 mio100 ax100 hnf98 lsp65 ukn100 mio100 lsp100 div631 bol100 ite100 ukn100 eq143 hnf41 smp85 dnf100 smp100 tf102 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 17ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 15.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...