./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 889a23428ce9b0e3800ffce916f37e53fe302b49 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 12:56:48,531 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:56:48,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:56:48,538 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:56:48,538 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:56:48,539 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:56:48,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:56:48,540 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:56:48,541 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:56:48,542 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:56:48,542 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:56:48,542 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:56:48,543 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:56:48,544 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:56:48,544 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:56:48,545 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:56:48,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:56:48,546 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:56:48,547 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:56:48,548 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:56:48,549 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:56:48,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:56:48,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:56:48,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:56:48,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:56:48,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:56:48,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:56:48,553 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:56:48,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:56:48,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:56:48,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:56:48,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:56:48,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:56:48,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:56:48,555 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:56:48,556 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:56:48,556 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 12:56:48,564 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:56:48,564 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:56:48,565 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:56:48,565 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:56:48,565 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 12:56:48,566 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 12:56:48,566 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 12:56:48,566 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 12:56:48,566 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 12:56:48,566 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 12:56:48,566 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 12:56:48,566 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:56:48,566 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 12:56:48,567 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 12:56:48,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:56:48,567 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 12:56:48,567 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:56:48,567 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 12:56:48,567 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 12:56:48,567 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 12:56:48,568 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 12:56:48,568 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:56:48,568 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 12:56:48,568 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:56:48,568 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 12:56:48,568 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:56:48,568 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 12:56:48,568 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 12:56:48,569 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:56:48,569 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 12:56:48,569 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 12:56:48,569 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 12:56:48,569 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_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 889a23428ce9b0e3800ffce916f37e53fe302b49 [2018-12-08 12:56:48,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:56:48,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:56:48,595 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:56:48,596 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:56:48,596 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:56:48,596 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-12-08 12:56:48,631 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/data/d575e5aee/956b7cd24768454bbf84f71f63d641b1/FLAG9b65f4a8b [2018-12-08 12:56:49,079 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:56:49,079 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-12-08 12:56:49,083 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/data/d575e5aee/956b7cd24768454bbf84f71f63d641b1/FLAG9b65f4a8b [2018-12-08 12:56:49,091 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/data/d575e5aee/956b7cd24768454bbf84f71f63d641b1 [2018-12-08 12:56:49,092 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:56:49,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:56:49,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:56:49,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:56:49,096 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:56:49,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd2551a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49, skipping insertion in model container [2018-12-08 12:56:49,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:56:49,113 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:56:49,211 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:56:49,214 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:56:49,232 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:56:49,240 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:56:49,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49 WrapperNode [2018-12-08 12:56:49,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:56:49,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:56:49,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:56:49,242 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:56:49,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:56:49,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:56:49,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:56:49,298 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:56:49,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,308 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,308 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,312 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... [2018-12-08 12:56:49,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:56:49,319 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:56:49,320 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:56:49,320 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:56:49,320 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:56:49,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:56:49,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:56:49,544 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:56:49,544 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-12-08 12:56:49,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:56:49 BoogieIcfgContainer [2018-12-08 12:56:49,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:56:49,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 12:56:49,545 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 12:56:49,548 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 12:56:49,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:56:49,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 12:56:49" (1/3) ... [2018-12-08 12:56:49,550 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bb90e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:56:49, skipping insertion in model container [2018-12-08 12:56:49,550 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:56:49,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:56:49" (2/3) ... [2018-12-08 12:56:49,550 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bb90e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:56:49, skipping insertion in model container [2018-12-08 12:56:49,550 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:56:49,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:56:49" (3/3) ... [2018-12-08 12:56:49,552 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-12-08 12:56:49,590 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 12:56:49,590 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 12:56:49,590 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 12:56:49,590 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 12:56:49,590 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 12:56:49,591 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 12:56:49,591 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 12:56:49,591 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 12:56:49,591 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 12:56:49,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-12-08 12:56:49,612 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-12-08 12:56:49,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:49,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:49,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 12:56:49,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:49,617 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 12:56:49,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-12-08 12:56:49,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-12-08 12:56:49,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:49,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:49,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 12:56:49,620 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:49,624 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L40true assume !(0 == mp_add_~a3~0 % 256); 8#L40-1true mp_add_~nb~0 := 4; 29#L50true assume !(0 == mp_add_~b3~0 % 256); 27#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-2true [2018-12-08 12:56:49,624 INFO L796 eck$LassoCheckResult]: Loop: 23#L61-2true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25#L70true assume !(mp_add_~partial_sum~0 % 65536 > 255); 13#L76-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22#L81-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23#L61-2true [2018-12-08 12:56:49,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:49,628 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2018-12-08 12:56:49,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:49,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:49,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:49,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:49,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:49,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2018-12-08 12:56:49,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:49,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:49,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:49,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:49,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:49,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:49,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:49,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:56:49,754 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:56:49,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:56:49,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:56:49,764 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-08 12:56:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:56:49,873 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2018-12-08 12:56:49,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:56:49,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2018-12-08 12:56:49,877 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-12-08 12:56:49,881 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2018-12-08 12:56:49,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-12-08 12:56:49,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-12-08 12:56:49,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2018-12-08 12:56:49,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:56:49,884 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2018-12-08 12:56:49,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2018-12-08 12:56:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-12-08 12:56:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 12:56:49,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2018-12-08 12:56:49,907 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-12-08 12:56:49,908 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-12-08 12:56:49,908 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 12:56:49,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2018-12-08 12:56:49,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-12-08 12:56:49,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:49,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:49,910 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:49,910 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:49,910 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 123#L40 assume !(0 == mp_add_~a3~0 % 256); 120#L40-1 mp_add_~nb~0 := 4; 121#L50 assume !(0 == mp_add_~b3~0 % 256); 131#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 138#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 139#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 136#L64-1 [2018-12-08 12:56:49,910 INFO L796 eck$LassoCheckResult]: Loop: 136#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 126#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 129#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 112#L80-1 assume !(1 == mp_add_~i~0 % 256); 113#L81-1 assume !(2 == mp_add_~i~0 % 256); 118#L82-1 assume !(3 == mp_add_~i~0 % 256); 119#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 143#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 159#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 160#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 127#L65-2 assume !(1 == mp_add_~i~0 % 256); 128#L66-1 assume !(2 == mp_add_~i~0 % 256); 135#L67-1 assume !(3 == mp_add_~i~0 % 256); 136#L64-1 [2018-12-08 12:56:49,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:49,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2018-12-08 12:56:49,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:49,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:49,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:49,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:50,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:50,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:50,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:56:50,022 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:56:50,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:50,022 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2018-12-08 12:56:50,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:50,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:50,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:50,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:50,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:50,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:56:50,064 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:56:50,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:56:50,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:56:50,064 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-12-08 12:56:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:56:50,477 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2018-12-08 12:56:50,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 12:56:50,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2018-12-08 12:56:50,480 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2018-12-08 12:56:50,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2018-12-08 12:56:50,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2018-12-08 12:56:50,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2018-12-08 12:56:50,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2018-12-08 12:56:50,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:56:50,483 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2018-12-08 12:56:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2018-12-08 12:56:50,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2018-12-08 12:56:50,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-08 12:56:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2018-12-08 12:56:50,490 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-12-08 12:56:50,490 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-12-08 12:56:50,490 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 12:56:50,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2018-12-08 12:56:50,491 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2018-12-08 12:56:50,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:50,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:50,492 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:50,492 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:50,492 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 410#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 412#L42 assume !(0 == mp_add_~a2~0 % 256); 406#L40-1 mp_add_~nb~0 := 4; 407#L50 assume !(0 == mp_add_~b3~0 % 256); 433#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 485#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 488#L64-1 [2018-12-08 12:56:50,492 INFO L796 eck$LassoCheckResult]: Loop: 488#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 492#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 417#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 418#L80-1 assume !(1 == mp_add_~i~0 % 256); 428#L81-1 assume !(2 == mp_add_~i~0 % 256); 404#L82-1 assume !(3 == mp_add_~i~0 % 256); 405#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 438#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 448#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 443#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 415#L65-2 assume !(1 == mp_add_~i~0 % 256); 416#L66-1 assume !(2 == mp_add_~i~0 % 256); 444#L67-1 assume !(3 == mp_add_~i~0 % 256); 488#L64-1 [2018-12-08 12:56:50,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:50,493 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2018-12-08 12:56:50,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:50,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:50,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:50,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:50,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:50,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 12:56:50,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:56:50,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:50,588 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2018-12-08 12:56:50,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:50,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:50,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:50,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:50,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:50,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:50,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:56:50,622 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:56:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:56:50,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:56:50,622 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2018-12-08 12:56:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:56:51,450 INFO L93 Difference]: Finished difference Result 373 states and 546 transitions. [2018-12-08 12:56:51,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 12:56:51,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 546 transitions. [2018-12-08 12:56:51,460 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 255 [2018-12-08 12:56:51,465 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 546 transitions. [2018-12-08 12:56:51,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2018-12-08 12:56:51,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-12-08 12:56:51,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 546 transitions. [2018-12-08 12:56:51,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:56:51,471 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 546 transitions. [2018-12-08 12:56:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 546 transitions. [2018-12-08 12:56:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 201. [2018-12-08 12:56:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-08 12:56:51,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2018-12-08 12:56:51,484 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-12-08 12:56:51,484 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-12-08 12:56:51,484 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 12:56:51,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 289 transitions. [2018-12-08 12:56:51,485 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2018-12-08 12:56:51,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:51,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:51,486 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:51,486 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:51,487 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 937#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 938#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 965#L44 assume !(0 == mp_add_~a1~0 % 256); 969#L40-1 mp_add_~nb~0 := 4; 988#L50 assume !(0 == mp_add_~b3~0 % 256); 985#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 983#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 984#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 951#L64-1 [2018-12-08 12:56:51,487 INFO L796 eck$LassoCheckResult]: Loop: 951#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 940#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 943#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 944#L80-1 assume !(1 == mp_add_~i~0 % 256); 1081#L81-1 assume !(2 == mp_add_~i~0 % 256); 931#L82-1 assume !(3 == mp_add_~i~0 % 256); 932#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 972#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 973#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 968#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 941#L65-2 assume !(1 == mp_add_~i~0 % 256); 942#L66-1 assume !(2 == mp_add_~i~0 % 256); 950#L67-1 assume !(3 == mp_add_~i~0 % 256); 951#L64-1 [2018-12-08 12:56:51,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:51,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1341941206, now seen corresponding path program 1 times [2018-12-08 12:56:51,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:51,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:51,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:56:51,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:51,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:51,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:51,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:56:51,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:56:51,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 3 times [2018-12-08 12:56:51,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:51,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:51,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:51,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:51,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:51,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:56:51,662 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:56:51,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:56:51,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:56:51,662 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. cyclomatic complexity: 93 Second operand 8 states. [2018-12-08 12:56:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:56:52,555 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2018-12-08 12:56:52,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 12:56:52,555 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 616 transitions. [2018-12-08 12:56:52,558 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 306 [2018-12-08 12:56:52,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 616 transitions. [2018-12-08 12:56:52,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2018-12-08 12:56:52,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2018-12-08 12:56:52,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 616 transitions. [2018-12-08 12:56:52,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:56:52,562 INFO L705 BuchiCegarLoop]: Abstraction has 418 states and 616 transitions. [2018-12-08 12:56:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 616 transitions. [2018-12-08 12:56:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2018-12-08 12:56:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-08 12:56:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2018-12-08 12:56:52,572 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-12-08 12:56:52,573 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-12-08 12:56:52,573 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 12:56:52,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 395 transitions. [2018-12-08 12:56:52,574 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2018-12-08 12:56:52,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:52,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:52,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:52,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:52,575 INFO L794 eck$LassoCheckResult]: Stem: 1613#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1581#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1583#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1611#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1617#L40-1 mp_add_~nb~0 := 4; 1625#L50 assume !(0 == mp_add_~b3~0 % 256); 1620#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1621#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1762#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1808#L64-1 [2018-12-08 12:56:52,575 INFO L796 eck$LassoCheckResult]: Loop: 1808#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1585#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1588#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1569#L80-1 assume !(1 == mp_add_~i~0 % 256); 1570#L81-1 assume !(2 == mp_add_~i~0 % 256); 1575#L82-1 assume !(3 == mp_add_~i~0 % 256); 1576#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1622#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1756#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1614#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1586#L65-2 assume !(1 == mp_add_~i~0 % 256); 1587#L66-1 assume !(2 == mp_add_~i~0 % 256); 1815#L67-1 assume !(3 == mp_add_~i~0 % 256); 1808#L64-1 [2018-12-08 12:56:52,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:52,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199508, now seen corresponding path program 1 times [2018-12-08 12:56:52,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:52,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:52,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:56:52,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:52,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:52,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:52,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:56:52,662 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:56:52,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 4 times [2018-12-08 12:56:52,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:52,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:52,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:52,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:52,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:52,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:52,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:52,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:56:52,686 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:56:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:56:52,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:56:52,687 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. cyclomatic complexity: 126 Second operand 8 states. [2018-12-08 12:56:53,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:56:53,435 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2018-12-08 12:56:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-08 12:56:53,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 533 transitions. [2018-12-08 12:56:53,437 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2018-12-08 12:56:53,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 533 transitions. [2018-12-08 12:56:53,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-12-08 12:56:53,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-12-08 12:56:53,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 533 transitions. [2018-12-08 12:56:53,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:56:53,439 INFO L705 BuchiCegarLoop]: Abstraction has 375 states and 533 transitions. [2018-12-08 12:56:53,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 533 transitions. [2018-12-08 12:56:53,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 300. [2018-12-08 12:56:53,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-08 12:56:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 431 transitions. [2018-12-08 12:56:53,444 INFO L728 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-12-08 12:56:53,444 INFO L608 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-12-08 12:56:53,444 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 12:56:53,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 431 transitions. [2018-12-08 12:56:53,446 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-12-08 12:56:53,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:53,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:53,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:53,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:53,446 INFO L794 eck$LassoCheckResult]: Stem: 2298#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2263#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2265#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2294#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2259#L40-1 mp_add_~nb~0 := 4; 2260#L50 assume !(0 == mp_add_~b3~0 % 256); 2271#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2286#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2485#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2018-12-08 12:56:53,447 INFO L796 eck$LassoCheckResult]: Loop: 2272#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2273#L65-2 assume !(1 == mp_add_~i~0 % 256); 2510#L66-1 assume !(2 == mp_add_~i~0 % 256); 2509#L67-1 assume !(3 == mp_add_~i~0 % 256); 2506#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2504#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2503#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2494#L80-1 assume !(1 == mp_add_~i~0 % 256); 2502#L81-1 assume !(2 == mp_add_~i~0 % 256); 2490#L82-1 assume !(3 == mp_add_~i~0 % 256); 2488#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2486#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2487#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2018-12-08 12:56:53,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:53,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 1 times [2018-12-08 12:56:53,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:53,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:53,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:56:53,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:53,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 5 times [2018-12-08 12:56:53,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:53,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:53,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:53,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:53,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:53,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:53,467 INFO L82 PathProgramCache]: Analyzing trace with hash -833715526, now seen corresponding path program 1 times [2018-12-08 12:56:53,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:53,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:53,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:56:53,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:53,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:53,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 12:56:53,577 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:56:53,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:56:53,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:56:53,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:56:53,578 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:56:53,578 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:56:53,578 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:56:53,578 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:56:53,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-12-08 12:56:53,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:56:53,579 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:56:53,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:56:53,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:56:53,742 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:56:53,743 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:56:53,746 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:56:53,746 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:56:53,780 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:56:53,780 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:56:55,252 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:56:55,255 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:56:55,255 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:56:55,255 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:56:55,255 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:56:55,255 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:56:55,255 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:56:55,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:56:55,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:56:55,255 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-12-08 12:56:55,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:56:55,256 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:56:55,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:56:55,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:56:55,415 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:56:55,418 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:56:55,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:56:55,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:56:55,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:56:55,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:56:55,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,431 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:56:55,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,432 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:56:55,433 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:56:55,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,436 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:56:55,437 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:56:55,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,441 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:56:55,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:56:55,444 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:56:55,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,447 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:56:55,449 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:56:55,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,454 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:56:55,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,455 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:56:55,457 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:56:55,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:56:55,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,460 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:56:55,461 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:56:55,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,465 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:56:55,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,466 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,466 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:56:55,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,467 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:56:55,468 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:56:55,468 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,471 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,471 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:56:55,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,472 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:56:55,473 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:56:55,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,481 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 12:56:55,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,482 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,482 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:56:55,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,482 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:56:55,486 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:56:55,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,491 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:56:55,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:56:55,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:56:55,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,504 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 12:56:55,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,504 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:56:55,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,505 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:56:55,508 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:56:55,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:56:55,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,512 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:56:55,514 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:56:55,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,522 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 12:56:55,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,523 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:56:55,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:56:55,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:56:55,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,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-12-08 12:56:55,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,529 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:56:55,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:56:55,530 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:56:55,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,536 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 12:56:55,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,537 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:56:55,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,537 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:56:55,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:56:55,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:56:55,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:56:55,546 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:56:55,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:56:55,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:56:55,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:56:55,547 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:56:55,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:56:55,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:56:55,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:56:55,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:56:55,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:56:55,560 INFO L87 Difference]: Start difference. First operand 300 states and 431 transitions. cyclomatic complexity: 139 Second operand 6 states. [2018-12-08 12:56:55,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:56:55,779 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2018-12-08 12:56:55,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:56:55,779 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 882 transitions. [2018-12-08 12:56:55,782 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 325 [2018-12-08 12:56:55,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 612 states and 882 transitions. [2018-12-08 12:56:55,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2018-12-08 12:56:55,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2018-12-08 12:56:55,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 882 transitions. [2018-12-08 12:56:55,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:56:55,784 INFO L705 BuchiCegarLoop]: Abstraction has 612 states and 882 transitions. [2018-12-08 12:56:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 882 transitions. [2018-12-08 12:56:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 380. [2018-12-08 12:56:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-08 12:56:55,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2018-12-08 12:56:55,791 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-12-08 12:56:55,791 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-12-08 12:56:55,791 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 12:56:55,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 520 transitions. [2018-12-08 12:56:55,792 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-12-08 12:56:55,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:56:55,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:56:55,793 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:55,793 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:56:55,793 INFO L794 eck$LassoCheckResult]: Stem: 3219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3190#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3191#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3217#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3222#L40-1 mp_add_~nb~0 := 4; 3451#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3216#L52 assume !(0 == mp_add_~b2~0 % 256); 3196#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3210#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3525#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2018-12-08 12:56:55,793 INFO L796 eck$LassoCheckResult]: Loop: 3524#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3523#L65-2 assume !(1 == mp_add_~i~0 % 256); 3522#L66-1 assume !(2 == mp_add_~i~0 % 256); 3521#L67-1 assume !(3 == mp_add_~i~0 % 256); 3520#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3189#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3194#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3176#L80-1 assume !(1 == mp_add_~i~0 % 256); 3177#L81-1 assume !(2 == mp_add_~i~0 % 256); 3261#L82-1 assume !(3 == mp_add_~i~0 % 256); 3254#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3245#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3246#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2018-12-08 12:56:55,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:55,793 INFO L82 PathProgramCache]: Analyzing trace with hash -438599534, now seen corresponding path program 1 times [2018-12-08 12:56:55,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:55,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:55,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:55,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:55,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:56:55,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:56:55,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:56:55,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 12:56:55,818 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:56:55,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:56:55,818 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 6 times [2018-12-08 12:56:55,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:56:55,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:56:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:55,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:56:55,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:56:55,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:56:55,864 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:56:55,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:56:55,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:56:55,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:56:55,864 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:56:55,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:56:55,865 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:56:55,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:56:55,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-12-08 12:56:55,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:56:55,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:56:55,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:56:55,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:56:56,021 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:56:56,021 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:56:56,023 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:56:56,024 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:56:56,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:56:56,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:57:08,072 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-08 12:57:08,075 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:57:08,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:57:08,075 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:57:08,075 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:57:08,075 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:57:08,075 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:08,075 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:57:08,075 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:57:08,075 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-12-08 12:57:08,075 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:57:08,075 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:57:08,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:08,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:08,227 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:57:08,227 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:57:08,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:57:08,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:57:08,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:57:08,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:57:08,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,233 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:57:08,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,234 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:08,234 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:08,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,237 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:08,237 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:08,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,238 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:57:08,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,239 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:08,239 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:08,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:08,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:08,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,245 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:57:08,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,246 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:08,247 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:08,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:08,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,251 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:08,252 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:08,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,253 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:57:08,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:08,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:08,255 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:08,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,258 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,258 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:08,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,259 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:08,259 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:08,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,261 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 12:57:08,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,261 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:57:08,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,262 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:08,263 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:08,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,273 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:57:08,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,274 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:08,276 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:08,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,279 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 12:57:08,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,280 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:08,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,281 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:08,283 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:08,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,290 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:08,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,291 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:08,292 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:08,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,294 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 12:57:08,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,294 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:08,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,295 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:08,295 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:08,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,300 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:08,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,300 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:08,301 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:08,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,304 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 12:57:08,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,305 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:08,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,305 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:57:08,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:57:08,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:08,315 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:08,315 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:08,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:08,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:08,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:08,316 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:57:08,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:57:08,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:08,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:08,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:57:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:57:08,323 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. cyclomatic complexity: 148 Second operand 3 states. [2018-12-08 12:57:08,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:08,326 INFO L93 Difference]: Finished difference Result 295 states and 401 transitions. [2018-12-08 12:57:08,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:57:08,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 401 transitions. [2018-12-08 12:57:08,328 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2018-12-08 12:57:08,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 295 states and 401 transitions. [2018-12-08 12:57:08,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2018-12-08 12:57:08,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2018-12-08 12:57:08,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 401 transitions. [2018-12-08 12:57:08,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:08,329 INFO L705 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-12-08 12:57:08,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 401 transitions. [2018-12-08 12:57:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-12-08 12:57:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-12-08 12:57:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2018-12-08 12:57:08,333 INFO L728 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-12-08 12:57:08,333 INFO L608 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-12-08 12:57:08,333 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 12:57:08,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 295 states and 401 transitions. [2018-12-08 12:57:08,334 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2018-12-08 12:57:08,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:08,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:08,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:08,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:08,335 INFO L794 eck$LassoCheckResult]: Stem: 3896#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3871#L40 assume !(0 == mp_add_~a3~0 % 256); 3867#L40-1 mp_add_~nb~0 := 4; 3868#L50 assume !(0 == mp_add_~b3~0 % 256); 3889#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3884#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3885#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3876#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3873#L65-2 assume !(1 == mp_add_~i~0 % 256); 3874#L66-1 assume !(2 == mp_add_~i~0 % 256); 3879#L67-1 assume !(3 == mp_add_~i~0 % 256); 3880#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4136#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4135#L71-2 assume !(1 == mp_add_~i~0 % 256); 4134#L72-1 assume !(2 == mp_add_~i~0 % 256); 4133#L73-1 assume !(3 == mp_add_~i~0 % 256); 4132#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4131#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4130#L80-1 assume !(1 == mp_add_~i~0 % 256); 4129#L81-1 assume !(2 == mp_add_~i~0 % 256); 4128#L82-1 assume !(3 == mp_add_~i~0 % 256); 4127#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4126#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4125#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2018-12-08 12:57:08,335 INFO L796 eck$LassoCheckResult]: Loop: 4112#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4123#L65-2 assume !(1 == mp_add_~i~0 % 256); 4121#L66-1 assume !(2 == mp_add_~i~0 % 256); 4119#L67-1 assume !(3 == mp_add_~i~0 % 256); 4117#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4115#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4113#L71-2 assume !(1 == mp_add_~i~0 % 256); 4110#L72-1 assume !(2 == mp_add_~i~0 % 256); 4091#L73-1 assume !(3 == mp_add_~i~0 % 256); 3888#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3875#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3857#L80-1 assume !(1 == mp_add_~i~0 % 256); 3858#L81-1 assume !(2 == mp_add_~i~0 % 256); 3863#L82-1 assume !(3 == mp_add_~i~0 % 256); 3864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3919#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3920#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2018-12-08 12:57:08,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:08,335 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 1 times [2018-12-08 12:57:08,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:08,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:08,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:08,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:08,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:08,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1235554401, now seen corresponding path program 1 times [2018-12-08 12:57:08,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:08,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:08,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:08,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:08,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash 350902213, now seen corresponding path program 1 times [2018-12-08 12:57:08,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:08,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:08,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:08,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:08,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:57:08,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:57:08,437 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:57:08,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:57:08,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:57:08,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:57:08,437 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:57:08,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:08,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:57:08,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:57:08,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-12-08 12:57:08,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:57:08,438 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:57:08,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:08,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:08,618 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:57:08,618 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:08,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:57:08,620 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:57:08,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:57:08,648 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:57:09,592 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:57:09,594 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:57:09,594 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:57:09,594 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:57:09,594 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:57:09,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:57:09,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:09,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:57:09,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:57:09,595 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-12-08 12:57:09,595 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:57:09,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:57:09,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:09,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:09,797 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:57:09,798 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:57:09,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:57:09,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:57:09,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:57:09,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:57:09,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,803 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:57:09,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,804 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:09,805 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:09,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,843 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:09,844 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:09,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,845 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:57:09,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:09,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:09,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,849 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:09,849 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:09,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,851 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:57:09,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,851 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:09,852 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:09,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:09,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,855 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:09,856 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:09,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,857 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:57:09,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,858 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,858 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:09,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,858 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:09,859 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:09,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,865 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,865 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:09,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:09,866 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:09,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,868 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 12:57:09,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,868 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,868 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:57:09,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,869 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:09,869 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:09,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,878 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:57:09,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:09,880 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:09,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,882 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 12:57:09,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,883 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,883 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:09,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:09,884 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:09,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,892 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,892 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:09,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,892 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:09,895 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:09,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,896 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 12:57:09,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,897 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,897 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:09,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,897 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:09,898 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:09,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,902 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,902 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:09,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,902 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:09,903 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:09,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,906 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 12:57:09,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,907 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:09,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,907 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:57:09,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:57:09,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:09,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:09,914 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:09,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:09,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:09,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:09,915 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:57:09,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:57:09,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:09,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:09,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:57:09,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:57:09,922 INFO L87 Difference]: Start difference. First operand 295 states and 401 transitions. cyclomatic complexity: 113 Second operand 4 states. [2018-12-08 12:57:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:10,015 INFO L93 Difference]: Finished difference Result 404 states and 572 transitions. [2018-12-08 12:57:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:57:10,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 572 transitions. [2018-12-08 12:57:10,017 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 283 [2018-12-08 12:57:10,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 402 states and 570 transitions. [2018-12-08 12:57:10,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2018-12-08 12:57:10,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2018-12-08 12:57:10,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 570 transitions. [2018-12-08 12:57:10,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:10,019 INFO L705 BuchiCegarLoop]: Abstraction has 402 states and 570 transitions. [2018-12-08 12:57:10,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 570 transitions. [2018-12-08 12:57:10,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 364. [2018-12-08 12:57:10,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-12-08 12:57:10,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 507 transitions. [2018-12-08 12:57:10,023 INFO L728 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2018-12-08 12:57:10,023 INFO L608 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2018-12-08 12:57:10,023 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 12:57:10,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 507 transitions. [2018-12-08 12:57:10,025 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 245 [2018-12-08 12:57:10,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:10,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:10,025 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,025 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,026 INFO L794 eck$LassoCheckResult]: Stem: 4602#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4576#L40 assume !(0 == mp_add_~a3~0 % 256); 4573#L40-1 mp_add_~nb~0 := 4; 4574#L50 assume !(0 == mp_add_~b3~0 % 256); 4596#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4597#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4860#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4859#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4858#L65-2 assume !(1 == mp_add_~i~0 % 256); 4857#L66-1 assume !(2 == mp_add_~i~0 % 256); 4856#L67-1 assume !(3 == mp_add_~i~0 % 256); 4855#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4854#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4853#L71-2 assume !(1 == mp_add_~i~0 % 256); 4852#L72-1 assume !(2 == mp_add_~i~0 % 256); 4851#L73-1 assume !(3 == mp_add_~i~0 % 256); 4850#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4848#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4847#L80-1 assume !(1 == mp_add_~i~0 % 256); 4845#L81-1 assume !(2 == mp_add_~i~0 % 256); 4846#L82-1 assume !(3 == mp_add_~i~0 % 256); 4599#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4591#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4592#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2018-12-08 12:57:10,026 INFO L796 eck$LassoCheckResult]: Loop: 4867#L65 assume !(0 == mp_add_~i~0 % 256); 4862#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4605#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 4587#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 4588#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4575#L71 assume !(0 == mp_add_~i~0 % 256); 4569#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 4570#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 4598#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 4863#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4864#L76-1 assume !(0 == mp_add_~i~0 % 256); 4885#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4926#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4571#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 4572#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4619#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4620#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4890#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4865#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4866#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4636#L80-1 assume !(1 == mp_add_~i~0 % 256); 4637#L81-1 assume !(2 == mp_add_~i~0 % 256); 4884#L82-1 assume !(3 == mp_add_~i~0 % 256); 4882#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4611#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4612#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2018-12-08 12:57:10,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,026 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 2 times [2018-12-08 12:57:10,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:10,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash -929180227, now seen corresponding path program 1 times [2018-12-08 12:57:10,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:10,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 12:57:10,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:57:10,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:57:10,048 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:57:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:57:10,048 INFO L87 Difference]: Start difference. First operand 364 states and 507 transitions. cyclomatic complexity: 150 Second operand 3 states. [2018-12-08 12:57:10,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:10,104 INFO L93 Difference]: Finished difference Result 454 states and 625 transitions. [2018-12-08 12:57:10,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:57:10,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 454 states and 625 transitions. [2018-12-08 12:57:10,106 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 329 [2018-12-08 12:57:10,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 454 states to 454 states and 625 transitions. [2018-12-08 12:57:10,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2018-12-08 12:57:10,108 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2018-12-08 12:57:10,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 625 transitions. [2018-12-08 12:57:10,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:10,108 INFO L705 BuchiCegarLoop]: Abstraction has 454 states and 625 transitions. [2018-12-08 12:57:10,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 625 transitions. [2018-12-08 12:57:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2018-12-08 12:57:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-12-08 12:57:10,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 565 transitions. [2018-12-08 12:57:10,113 INFO L728 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2018-12-08 12:57:10,113 INFO L608 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2018-12-08 12:57:10,113 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 12:57:10,113 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 565 transitions. [2018-12-08 12:57:10,115 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 285 [2018-12-08 12:57:10,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:10,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:10,115 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,115 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,115 INFO L794 eck$LassoCheckResult]: Stem: 5434#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 5403#L40 assume !(0 == mp_add_~a3~0 % 256); 5404#L40-1 mp_add_~nb~0 := 4; 5742#L50 assume !(0 == mp_add_~b3~0 % 256); 5741#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5740#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5739#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5738#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5737#L65-2 assume !(1 == mp_add_~i~0 % 256); 5736#L66-1 assume !(2 == mp_add_~i~0 % 256); 5735#L67-1 assume !(3 == mp_add_~i~0 % 256); 5734#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5733#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5732#L71-2 assume !(1 == mp_add_~i~0 % 256); 5731#L72-1 assume !(2 == mp_add_~i~0 % 256); 5730#L73-1 assume !(3 == mp_add_~i~0 % 256); 5729#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5728#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5727#L80-1 assume !(1 == mp_add_~i~0 % 256); 5726#L81-1 assume !(2 == mp_add_~i~0 % 256); 5725#L82-1 assume !(3 == mp_add_~i~0 % 256); 5724#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5723#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5722#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2018-12-08 12:57:10,116 INFO L796 eck$LassoCheckResult]: Loop: 5687#L65 assume !(0 == mp_add_~i~0 % 256); 5721#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 5719#L66-1 assume !(2 == mp_add_~i~0 % 256); 5717#L67-1 assume !(3 == mp_add_~i~0 % 256); 5715#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5714#L71 assume !(0 == mp_add_~i~0 % 256); 5711#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 5709#L72-1 assume !(2 == mp_add_~i~0 % 256); 5707#L73-1 assume !(3 == mp_add_~i~0 % 256); 5681#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5677#L76-1 assume !(0 == mp_add_~i~0 % 256); 5672#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5670#L81-1 assume !(2 == mp_add_~i~0 % 256); 5668#L82-1 assume !(3 == mp_add_~i~0 % 256); 5666#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5665#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5663#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5664#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5679#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5674#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5675#L80-1 assume !(1 == mp_add_~i~0 % 256); 5695#L81-1 assume !(2 == mp_add_~i~0 % 256); 5694#L82-1 assume !(3 == mp_add_~i~0 % 256); 5692#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5689#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5686#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2018-12-08 12:57:10,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,116 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 3 times [2018-12-08 12:57:10,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:10,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,129 INFO L82 PathProgramCache]: Analyzing trace with hash 440290813, now seen corresponding path program 1 times [2018-12-08 12:57:10,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:10,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:10,154 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:10,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:10,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:57:10,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:10,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:10,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:10,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-12-08 12:57:10,239 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:10,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 12:57:10,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 12:57:10,239 INFO L87 Difference]: Start difference. First operand 407 states and 565 transitions. cyclomatic complexity: 164 Second operand 6 states. [2018-12-08 12:57:10,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:10,427 INFO L93 Difference]: Finished difference Result 482 states and 628 transitions. [2018-12-08 12:57:10,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:57:10,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 628 transitions. [2018-12-08 12:57:10,429 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 341 [2018-12-08 12:57:10,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 476 states and 619 transitions. [2018-12-08 12:57:10,430 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2018-12-08 12:57:10,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2018-12-08 12:57:10,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 476 states and 619 transitions. [2018-12-08 12:57:10,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:10,431 INFO L705 BuchiCegarLoop]: Abstraction has 476 states and 619 transitions. [2018-12-08 12:57:10,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states and 619 transitions. [2018-12-08 12:57:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 372. [2018-12-08 12:57:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-12-08 12:57:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 477 transitions. [2018-12-08 12:57:10,434 INFO L728 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2018-12-08 12:57:10,434 INFO L608 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2018-12-08 12:57:10,434 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 12:57:10,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 477 transitions. [2018-12-08 12:57:10,435 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 241 [2018-12-08 12:57:10,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:10,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:10,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,436 INFO L794 eck$LassoCheckResult]: Stem: 6416#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6383#L40 assume !(0 == mp_add_~a3~0 % 256); 6379#L40-1 mp_add_~nb~0 := 4; 6380#L50 assume !(0 == mp_add_~b3~0 % 256); 6404#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6405#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6632#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6633#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6628#L65-2 assume !(1 == mp_add_~i~0 % 256); 6629#L66-1 assume !(2 == mp_add_~i~0 % 256); 6624#L67-1 assume !(3 == mp_add_~i~0 % 256); 6625#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6620#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6621#L71-2 assume !(1 == mp_add_~i~0 % 256); 6616#L72-1 assume !(2 == mp_add_~i~0 % 256); 6617#L73-1 assume !(3 == mp_add_~i~0 % 256); 6612#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6613#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6734#L80-1 assume !(1 == mp_add_~i~0 % 256); 6733#L81-1 assume !(2 == mp_add_~i~0 % 256); 6732#L82-1 assume !(3 == mp_add_~i~0 % 256); 6731#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6730#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6729#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2018-12-08 12:57:10,436 INFO L796 eck$LassoCheckResult]: Loop: 6390#L65 assume !(0 == mp_add_~i~0 % 256); 6391#L65-2 assume !(1 == mp_add_~i~0 % 256); 6727#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 6725#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 6723#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6721#L71 assume !(0 == mp_add_~i~0 % 256); 6651#L71-2 assume !(1 == mp_add_~i~0 % 256); 6647#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 6644#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 6643#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6641#L76-1 assume !(0 == mp_add_~i~0 % 256); 6642#L80-1 assume !(1 == mp_add_~i~0 % 256); 6637#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 6638#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6546#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6547#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6674#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6668#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6669#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6663#L71-2 assume !(1 == mp_add_~i~0 % 256); 6664#L72-1 assume !(2 == mp_add_~i~0 % 256); 6659#L73-1 assume !(3 == mp_add_~i~0 % 256); 6660#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6655#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6656#L80-1 assume !(1 == mp_add_~i~0 % 256); 6684#L81-1 assume !(2 == mp_add_~i~0 % 256); 6685#L82-1 assume !(3 == mp_add_~i~0 % 256); 6677#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6678#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6671#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2018-12-08 12:57:10,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 4 times [2018-12-08 12:57:10,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:10,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,447 INFO L82 PathProgramCache]: Analyzing trace with hash 293037747, now seen corresponding path program 1 times [2018-12-08 12:57:10,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 12:57:10,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:57:10,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:57:10,453 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:10,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:57:10,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:57:10,453 INFO L87 Difference]: Start difference. First operand 372 states and 477 transitions. cyclomatic complexity: 111 Second operand 3 states. [2018-12-08 12:57:10,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:10,510 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2018-12-08 12:57:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:57:10,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 422 states and 539 transitions. [2018-12-08 12:57:10,512 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 289 [2018-12-08 12:57:10,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 422 states to 422 states and 539 transitions. [2018-12-08 12:57:10,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 422 [2018-12-08 12:57:10,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2018-12-08 12:57:10,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 422 states and 539 transitions. [2018-12-08 12:57:10,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:10,515 INFO L705 BuchiCegarLoop]: Abstraction has 422 states and 539 transitions. [2018-12-08 12:57:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states and 539 transitions. [2018-12-08 12:57:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 375. [2018-12-08 12:57:10,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-08 12:57:10,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 483 transitions. [2018-12-08 12:57:10,521 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2018-12-08 12:57:10,521 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2018-12-08 12:57:10,521 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 12:57:10,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 483 transitions. [2018-12-08 12:57:10,522 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 247 [2018-12-08 12:57:10,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:10,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:10,523 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,523 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,523 INFO L794 eck$LassoCheckResult]: Stem: 7208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7179#L40 assume !(0 == mp_add_~a3~0 % 256); 7180#L40-1 mp_add_~nb~0 := 4; 7436#L50 assume !(0 == mp_add_~b3~0 % 256); 7435#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7433#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7432#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7431#L65-2 assume !(1 == mp_add_~i~0 % 256); 7429#L66-1 assume !(2 == mp_add_~i~0 % 256); 7427#L67-1 assume !(3 == mp_add_~i~0 % 256); 7424#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7421#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7419#L71-2 assume !(1 == mp_add_~i~0 % 256); 7417#L72-1 assume !(2 == mp_add_~i~0 % 256); 7415#L73-1 assume !(3 == mp_add_~i~0 % 256); 7413#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7411#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7409#L80-1 assume !(1 == mp_add_~i~0 % 256); 7407#L81-1 assume !(2 == mp_add_~i~0 % 256); 7405#L82-1 assume !(3 == mp_add_~i~0 % 256); 7403#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7400#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2018-12-08 12:57:10,523 INFO L796 eck$LassoCheckResult]: Loop: 7393#L65 assume !(0 == mp_add_~i~0 % 256); 7389#L65-2 assume !(1 == mp_add_~i~0 % 256); 7387#L66-1 assume !(2 == mp_add_~i~0 % 256); 7383#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 7384#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7460#L71 assume !(0 == mp_add_~i~0 % 256); 7457#L71-2 assume !(1 == mp_add_~i~0 % 256); 7455#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 7456#L73-1 assume !(3 == mp_add_~i~0 % 256); 7469#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7466#L76-1 assume !(0 == mp_add_~i~0 % 256); 7463#L80-1 assume !(1 == mp_add_~i~0 % 256); 7461#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7450#L82-1 assume !(3 == mp_add_~i~0 % 256); 7402#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7399#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7394#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7395#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7423#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7420#L71-2 assume !(1 == mp_add_~i~0 % 256); 7418#L72-1 assume !(2 == mp_add_~i~0 % 256); 7416#L73-1 assume !(3 == mp_add_~i~0 % 256); 7414#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7412#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7410#L80-1 assume !(1 == mp_add_~i~0 % 256); 7408#L81-1 assume !(2 == mp_add_~i~0 % 256); 7406#L82-1 assume !(3 == mp_add_~i~0 % 256); 7404#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7401#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7397#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2018-12-08 12:57:10,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,523 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 5 times [2018-12-08 12:57:10,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:10,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1585928527, now seen corresponding path program 1 times [2018-12-08 12:57:10,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 12:57:10,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:57:10,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:57:10,547 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:10,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 12:57:10,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 12:57:10,547 INFO L87 Difference]: Start difference. First operand 375 states and 483 transitions. cyclomatic complexity: 113 Second operand 3 states. [2018-12-08 12:57:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:10,601 INFO L93 Difference]: Finished difference Result 419 states and 534 transitions. [2018-12-08 12:57:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 12:57:10,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 534 transitions. [2018-12-08 12:57:10,604 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 289 [2018-12-08 12:57:10,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 534 transitions. [2018-12-08 12:57:10,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2018-12-08 12:57:10,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2018-12-08 12:57:10,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 534 transitions. [2018-12-08 12:57:10,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:10,606 INFO L705 BuchiCegarLoop]: Abstraction has 419 states and 534 transitions. [2018-12-08 12:57:10,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 534 transitions. [2018-12-08 12:57:10,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 398. [2018-12-08 12:57:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-12-08 12:57:10,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2018-12-08 12:57:10,612 INFO L728 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2018-12-08 12:57:10,612 INFO L608 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2018-12-08 12:57:10,612 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-08 12:57:10,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 511 transitions. [2018-12-08 12:57:10,614 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 268 [2018-12-08 12:57:10,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:10,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:10,614 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,614 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:10,615 INFO L794 eck$LassoCheckResult]: Stem: 8008#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7979#L40 assume !(0 == mp_add_~a3~0 % 256); 7976#L40-1 mp_add_~nb~0 := 4; 7977#L50 assume !(0 == mp_add_~b3~0 % 256); 8000#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8001#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8040#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8041#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8141#L65-2 assume !(1 == mp_add_~i~0 % 256); 8142#L66-1 assume !(2 == mp_add_~i~0 % 256); 8137#L67-1 assume !(3 == mp_add_~i~0 % 256); 8138#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8133#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8134#L71-2 assume !(1 == mp_add_~i~0 % 256); 8129#L72-1 assume !(2 == mp_add_~i~0 % 256); 8130#L73-1 assume !(3 == mp_add_~i~0 % 256); 8126#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8125#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8124#L80-1 assume !(1 == mp_add_~i~0 % 256); 8123#L81-1 assume !(2 == mp_add_~i~0 % 256); 8039#L82-1 assume !(3 == mp_add_~i~0 % 256); 8004#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7996#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7997#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2018-12-08 12:57:10,615 INFO L796 eck$LassoCheckResult]: Loop: 8276#L65 assume !(0 == mp_add_~i~0 % 256); 8274#L65-2 assume !(1 == mp_add_~i~0 % 256); 8272#L66-1 assume !(2 == mp_add_~i~0 % 256); 8273#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 8280#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8279#L71 assume !(0 == mp_add_~i~0 % 256); 8278#L71-2 assume !(1 == mp_add_~i~0 % 256); 8243#L72-1 assume !(2 == mp_add_~i~0 % 256); 8244#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 8324#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8156#L76-1 assume !(0 == mp_add_~i~0 % 256); 8157#L80-1 assume !(1 == mp_add_~i~0 % 256); 8144#L81-1 assume !(2 == mp_add_~i~0 % 256); 8145#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 8037#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8038#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8032#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8165#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8121#L71-2 assume !(1 == mp_add_~i~0 % 256); 8120#L72-1 assume !(2 == mp_add_~i~0 % 256); 8119#L73-1 assume !(3 == mp_add_~i~0 % 256); 8118#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8117#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8116#L80-1 assume !(1 == mp_add_~i~0 % 256); 8115#L81-1 assume !(2 == mp_add_~i~0 % 256); 8113#L82-1 assume !(3 == mp_add_~i~0 % 256); 8114#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8023#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8024#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2018-12-08 12:57:10,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,615 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 6 times [2018-12-08 12:57:10,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:10,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:10,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash 278948913, now seen corresponding path program 1 times [2018-12-08 12:57:10,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:10,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:10,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:10,674 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:10,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:10,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:57:10,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:10,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:10,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 12:57:10,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-12-08 12:57:10,731 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:10,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 12:57:10,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 12:57:10,731 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. cyclomatic complexity: 118 Second operand 7 states. [2018-12-08 12:57:11,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:11,156 INFO L93 Difference]: Finished difference Result 1137 states and 1501 transitions. [2018-12-08 12:57:11,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-08 12:57:11,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1501 transitions. [2018-12-08 12:57:11,161 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 988 [2018-12-08 12:57:11,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 1137 states and 1501 transitions. [2018-12-08 12:57:11,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1137 [2018-12-08 12:57:11,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2018-12-08 12:57:11,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1137 states and 1501 transitions. [2018-12-08 12:57:11,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:11,167 INFO L705 BuchiCegarLoop]: Abstraction has 1137 states and 1501 transitions. [2018-12-08 12:57:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states and 1501 transitions. [2018-12-08 12:57:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 516. [2018-12-08 12:57:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-12-08 12:57:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 669 transitions. [2018-12-08 12:57:11,178 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2018-12-08 12:57:11,178 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2018-12-08 12:57:11,178 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-08 12:57:11,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 669 transitions. [2018-12-08 12:57:11,179 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 386 [2018-12-08 12:57:11,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:11,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:11,180 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:11,180 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:11,180 INFO L794 eck$LassoCheckResult]: Stem: 9679#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 9648#L40 assume !(0 == mp_add_~a3~0 % 256); 9649#L40-1 mp_add_~nb~0 := 4; 9866#L50 assume !(0 == mp_add_~b3~0 % 256); 9865#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9864#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9863#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9862#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9861#L65-2 assume !(1 == mp_add_~i~0 % 256); 9860#L66-1 assume !(2 == mp_add_~i~0 % 256); 9859#L67-1 assume !(3 == mp_add_~i~0 % 256); 9858#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9857#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9856#L71-2 assume !(1 == mp_add_~i~0 % 256); 9855#L72-1 assume !(2 == mp_add_~i~0 % 256); 9854#L73-1 assume !(3 == mp_add_~i~0 % 256); 9853#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9852#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9851#L80-1 assume !(1 == mp_add_~i~0 % 256); 9850#L81-1 assume !(2 == mp_add_~i~0 % 256); 9849#L82-1 assume !(3 == mp_add_~i~0 % 256); 9848#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9847#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9844#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2018-12-08 12:57:11,180 INFO L796 eck$LassoCheckResult]: Loop: 9837#L65 assume !(0 == mp_add_~i~0 % 256); 9835#L65-2 assume !(1 == mp_add_~i~0 % 256); 9833#L66-1 assume !(2 == mp_add_~i~0 % 256); 9832#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 9830#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9828#L71 assume !(0 == mp_add_~i~0 % 256); 9826#L71-2 assume !(1 == mp_add_~i~0 % 256); 9824#L72-1 assume !(2 == mp_add_~i~0 % 256); 9821#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 9819#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 9820#L76-1 assume !(0 == mp_add_~i~0 % 256); 9815#L80-1 assume !(1 == mp_add_~i~0 % 256); 9816#L81-1 assume !(2 == mp_add_~i~0 % 256); 9810#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 9811#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9845#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9846#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2018-12-08 12:57:11,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:11,181 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 7 times [2018-12-08 12:57:11,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:11,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:11,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:11,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:11,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash -459730205, now seen corresponding path program 1 times [2018-12-08 12:57:11,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:11,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:11,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:11,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1126726409, now seen corresponding path program 1 times [2018-12-08 12:57:11,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:11,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:11,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:11,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:11,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:11,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:11,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:57:11,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:11,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:11,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 12:57:11,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 12:57:11,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-12-08 12:57:11,371 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:57:11,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:57:11,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:57:11,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:57:11,371 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:57:11,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:11,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:57:11,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:57:11,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2018-12-08 12:57:11,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:57:11,372 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:57:11,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:11,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:11,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:57:11,554 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:11,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:57:11,557 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:11,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:57:11,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:57:12,185 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:57:12,188 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:57:12,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:57:12,188 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:57:12,188 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:57:12,188 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:57:12,188 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:12,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:57:12,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:57:12,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2018-12-08 12:57:12,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:57:12,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:57:12,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:12,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:12,380 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:57:12,380 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:57:12,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:57:12,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:57:12,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:57:12,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:57:12,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,384 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:57:12,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,385 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:12,385 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:12,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,387 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:12,388 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:12,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,389 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:57:12,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,389 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:12,390 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:12,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:12,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:12,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,394 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:57:12,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,395 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:12,396 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:12,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:57:12,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,399 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:12,400 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:12,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,401 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:57:12,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,401 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:12,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,401 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:12,402 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:12,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,407 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,407 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:12,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:57:12,408 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:57:12,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,410 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 12:57:12,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,410 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:57:12,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:12,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:12,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,420 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:57:12,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:12,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:12,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,424 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 12:57:12,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,424 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:12,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,424 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:12,426 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:12,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,432 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:12,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,433 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:57:12,435 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:57:12,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,436 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 12:57:12,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,436 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,436 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:12,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:12,437 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:12,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,441 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:57:12,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:57:12,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:57:12,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,446 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 12:57:12,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,446 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,446 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:12,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,447 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:57:12,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:57:12,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:57:12,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:57:12,457 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:57:12,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:57:12,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:57:12,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:57:12,457 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:57:12,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:57:12,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:57:12,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:57:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:57:12,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:57:12,464 INFO L87 Difference]: Start difference. First operand 516 states and 669 transitions. cyclomatic complexity: 159 Second operand 8 states. [2018-12-08 12:57:12,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:12,713 INFO L93 Difference]: Finished difference Result 656 states and 821 transitions. [2018-12-08 12:57:12,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 12:57:12,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 821 transitions. [2018-12-08 12:57:12,715 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 514 [2018-12-08 12:57:12,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 647 states and 808 transitions. [2018-12-08 12:57:12,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2018-12-08 12:57:12,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 647 [2018-12-08 12:57:12,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 808 transitions. [2018-12-08 12:57:12,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:12,717 INFO L705 BuchiCegarLoop]: Abstraction has 647 states and 808 transitions. [2018-12-08 12:57:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 808 transitions. [2018-12-08 12:57:12,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 574. [2018-12-08 12:57:12,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-12-08 12:57:12,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 729 transitions. [2018-12-08 12:57:12,725 INFO L728 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2018-12-08 12:57:12,725 INFO L608 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2018-12-08 12:57:12,725 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-08 12:57:12,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 729 transitions. [2018-12-08 12:57:12,727 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 447 [2018-12-08 12:57:12,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:12,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:12,728 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-12-08 12:57:12,728 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:12,728 INFO L794 eck$LassoCheckResult]: Stem: 10990#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10959#L40 assume !(0 == mp_add_~a3~0 % 256); 10960#L40-1 mp_add_~nb~0 := 4; 11140#L50 assume !(0 == mp_add_~b3~0 % 256); 11139#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11138#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11137#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11136#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11135#L65-2 assume !(1 == mp_add_~i~0 % 256); 11134#L66-1 assume !(2 == mp_add_~i~0 % 256); 11133#L67-1 assume !(3 == mp_add_~i~0 % 256); 11132#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11131#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11130#L71-2 assume !(1 == mp_add_~i~0 % 256); 11129#L72-1 assume !(2 == mp_add_~i~0 % 256); 11128#L73-1 assume !(3 == mp_add_~i~0 % 256); 11127#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11126#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11125#L80-1 assume !(1 == mp_add_~i~0 % 256); 11124#L81-1 assume !(2 == mp_add_~i~0 % 256); 11123#L82-1 assume !(3 == mp_add_~i~0 % 256); 11122#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11121#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11120#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11119#L65 assume !(0 == mp_add_~i~0 % 256); 11118#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11051#L66-1 [2018-12-08 12:57:12,728 INFO L796 eck$LassoCheckResult]: Loop: 11051#L66-1 assume !(2 == mp_add_~i~0 % 256); 11117#L67-1 assume !(3 == mp_add_~i~0 % 256); 11116#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11115#L71 assume !(0 == mp_add_~i~0 % 256); 11114#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 11113#L72-1 assume !(2 == mp_add_~i~0 % 256); 11112#L73-1 assume !(3 == mp_add_~i~0 % 256); 11111#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11110#L76-1 assume !(0 == mp_add_~i~0 % 256); 11108#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11107#L81-1 assume !(2 == mp_add_~i~0 % 256); 11052#L82-1 assume !(3 == mp_add_~i~0 % 256); 11043#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11044#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11039#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11040#L65 assume !(0 == mp_add_~i~0 % 256); 11050#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11051#L66-1 [2018-12-08 12:57:12,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:12,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 1 times [2018-12-08 12:57:12,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:12,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:12,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:12,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:12,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:12,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1434173717, now seen corresponding path program 1 times [2018-12-08 12:57:12,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:12,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:12,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:12,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:57:12,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:57:12,773 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:12,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 12:57:12,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 12:57:12,773 INFO L87 Difference]: Start difference. First operand 574 states and 729 transitions. cyclomatic complexity: 163 Second operand 5 states. [2018-12-08 12:57:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:12,864 INFO L93 Difference]: Finished difference Result 896 states and 1144 transitions. [2018-12-08 12:57:12,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:57:12,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 896 states and 1144 transitions. [2018-12-08 12:57:12,866 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 763 [2018-12-08 12:57:12,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 896 states to 896 states and 1144 transitions. [2018-12-08 12:57:12,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2018-12-08 12:57:12,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 896 [2018-12-08 12:57:12,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 896 states and 1144 transitions. [2018-12-08 12:57:12,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:12,869 INFO L705 BuchiCegarLoop]: Abstraction has 896 states and 1144 transitions. [2018-12-08 12:57:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states and 1144 transitions. [2018-12-08 12:57:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 644. [2018-12-08 12:57:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-12-08 12:57:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 817 transitions. [2018-12-08 12:57:12,874 INFO L728 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2018-12-08 12:57:12,875 INFO L608 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2018-12-08 12:57:12,875 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-08 12:57:12,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 644 states and 817 transitions. [2018-12-08 12:57:12,876 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 523 [2018-12-08 12:57:12,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:12,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:12,876 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-12-08 12:57:12,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:12,876 INFO L794 eck$LassoCheckResult]: Stem: 12469#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 12438#L40 assume !(0 == mp_add_~a3~0 % 256); 12439#L40-1 mp_add_~nb~0 := 4; 12708#L50 assume !(0 == mp_add_~b3~0 % 256); 12707#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12706#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12705#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12704#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12703#L65-2 assume !(1 == mp_add_~i~0 % 256); 12702#L66-1 assume !(2 == mp_add_~i~0 % 256); 12701#L67-1 assume !(3 == mp_add_~i~0 % 256); 12700#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12699#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12698#L71-2 assume !(1 == mp_add_~i~0 % 256); 12697#L72-1 assume !(2 == mp_add_~i~0 % 256); 12696#L73-1 assume !(3 == mp_add_~i~0 % 256); 12695#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12694#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12693#L80-1 assume !(1 == mp_add_~i~0 % 256); 12692#L81-1 assume !(2 == mp_add_~i~0 % 256); 12691#L82-1 assume !(3 == mp_add_~i~0 % 256); 12690#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12689#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12688#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12687#L65 assume !(0 == mp_add_~i~0 % 256); 12686#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12685#L66-1 [2018-12-08 12:57:12,876 INFO L796 eck$LassoCheckResult]: Loop: 12685#L66-1 assume !(2 == mp_add_~i~0 % 256); 12684#L67-1 assume !(3 == mp_add_~i~0 % 256); 12683#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12682#L71 assume !(0 == mp_add_~i~0 % 256); 12681#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 12680#L72-1 assume !(2 == mp_add_~i~0 % 256); 12679#L73-1 assume !(3 == mp_add_~i~0 % 256); 12678#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12677#L76-1 assume !(0 == mp_add_~i~0 % 256); 12676#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12675#L81-1 assume !(2 == mp_add_~i~0 % 256); 12674#L82-1 assume !(3 == mp_add_~i~0 % 256); 12673#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12621#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12622#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12611#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12613#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12606#L76-1 assume !(0 == mp_add_~i~0 % 256); 12521#L80-1 assume !(1 == mp_add_~i~0 % 256); 12522#L81-1 assume !(2 == mp_add_~i~0 % 256); 12517#L82-1 assume !(3 == mp_add_~i~0 % 256); 12512#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12510#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12511#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12615#L65 assume !(0 == mp_add_~i~0 % 256); 12655#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12685#L66-1 [2018-12-08 12:57:12,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:12,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 2 times [2018-12-08 12:57:12,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:12,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:12,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:12,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:12,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1615640065, now seen corresponding path program 1 times [2018-12-08 12:57:12,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:12,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:12,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:12,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:12,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:57:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:12,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:13,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:57:13,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:13,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-12-08 12:57:13,377 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:13,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 12:57:13,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=104, Unknown=1, NotChecked=0, Total=132 [2018-12-08 12:57:13,377 INFO L87 Difference]: Start difference. First operand 644 states and 817 transitions. cyclomatic complexity: 181 Second operand 12 states. [2018-12-08 12:57:14,634 WARN L180 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-08 12:57:15,212 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-12-08 12:57:17,153 WARN L180 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-12-08 12:57:19,195 WARN L180 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-12-08 12:57:20,641 WARN L180 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-12-08 12:57:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:39,417 INFO L93 Difference]: Finished difference Result 1620 states and 1999 transitions. [2018-12-08 12:57:39,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-08 12:57:39,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1620 states and 1999 transitions. [2018-12-08 12:57:39,421 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1446 [2018-12-08 12:57:39,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1620 states to 1585 states and 1936 transitions. [2018-12-08 12:57:39,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1585 [2018-12-08 12:57:39,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1585 [2018-12-08 12:57:39,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1585 states and 1936 transitions. [2018-12-08 12:57:39,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:39,425 INFO L705 BuchiCegarLoop]: Abstraction has 1585 states and 1936 transitions. [2018-12-08 12:57:39,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states and 1936 transitions. [2018-12-08 12:57:39,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1070. [2018-12-08 12:57:39,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2018-12-08 12:57:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1345 transitions. [2018-12-08 12:57:39,433 INFO L728 BuchiCegarLoop]: Abstraction has 1070 states and 1345 transitions. [2018-12-08 12:57:39,433 INFO L608 BuchiCegarLoop]: Abstraction has 1070 states and 1345 transitions. [2018-12-08 12:57:39,433 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-08 12:57:39,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1070 states and 1345 transitions. [2018-12-08 12:57:39,435 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 987 [2018-12-08 12:57:39,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:39,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:39,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:39,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:39,436 INFO L794 eck$LassoCheckResult]: Stem: 14871#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 14841#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14843#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14869#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14838#L40-1 mp_add_~nb~0 := 4; 14839#L50 assume !(0 == mp_add_~b3~0 % 256); 14865#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14866#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; 15526#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14849#L65 [2018-12-08 12:57:39,436 INFO L796 eck$LassoCheckResult]: Loop: 14849#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14850#L65-2 assume !(1 == mp_add_~i~0 % 256); 15798#L66-1 assume !(2 == mp_add_~i~0 % 256); 15797#L67-1 assume !(3 == mp_add_~i~0 % 256); 15796#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15795#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15794#L71-2 assume !(1 == mp_add_~i~0 % 256); 15793#L72-1 assume !(2 == mp_add_~i~0 % 256); 15792#L73-1 assume !(3 == mp_add_~i~0 % 256); 15791#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15790#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15789#L80-1 assume !(1 == mp_add_~i~0 % 256); 15788#L81-1 assume !(2 == mp_add_~i~0 % 256); 15787#L82-1 assume !(3 == mp_add_~i~0 % 256); 15786#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15785#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; 15784#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15783#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15782#L71 assume !(0 == mp_add_~i~0 % 256); 15774#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; 15685#L72-1 assume !(2 == mp_add_~i~0 % 256); 15773#L73-1 assume !(3 == mp_add_~i~0 % 256); 15772#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15771#L76-1 assume !(0 == mp_add_~i~0 % 256); 15758#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15741#L81-1 assume !(2 == mp_add_~i~0 % 256); 15740#L82-1 assume !(3 == mp_add_~i~0 % 256); 15739#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14907#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; 14908#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15299#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15716#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15715#L76-1 assume !(0 == mp_add_~i~0 % 256); 15714#L80-1 assume !(1 == mp_add_~i~0 % 256); 15284#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15283#L82-1 assume !(3 == mp_add_~i~0 % 256); 14910#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14911#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; 15711#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15709#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15707#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15705#L76-1 assume !(0 == mp_add_~i~0 % 256); 15702#L80-1 assume !(1 == mp_add_~i~0 % 256); 15698#L81-1 assume !(2 == mp_add_~i~0 % 256); 15695#L82-1 assume !(3 == mp_add_~i~0 % 256); 15696#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15671#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; 15672#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14849#L65 [2018-12-08 12:57:39,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 2 times [2018-12-08 12:57:39,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:39,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:39,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:39,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:39,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2024966345, now seen corresponding path program 1 times [2018-12-08 12:57:39,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:39,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:39,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:39,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:57:39,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:39,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:57:39,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:39,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:39,525 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 12:57:39,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 12:57:39,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-12-08 12:57:39,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:39,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:57:39,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:57:39,540 INFO L87 Difference]: Start difference. First operand 1070 states and 1345 transitions. cyclomatic complexity: 283 Second operand 8 states. [2018-12-08 12:57:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:39,636 INFO L93 Difference]: Finished difference Result 1780 states and 2149 transitions. [2018-12-08 12:57:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 12:57:39,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1780 states and 2149 transitions. [2018-12-08 12:57:39,640 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1682 [2018-12-08 12:57:39,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1780 states to 1780 states and 2149 transitions. [2018-12-08 12:57:39,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1780 [2018-12-08 12:57:39,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1780 [2018-12-08 12:57:39,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1780 states and 2149 transitions. [2018-12-08 12:57:39,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:39,645 INFO L705 BuchiCegarLoop]: Abstraction has 1780 states and 2149 transitions. [2018-12-08 12:57:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states and 2149 transitions. [2018-12-08 12:57:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1555. [2018-12-08 12:57:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-12-08 12:57:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1905 transitions. [2018-12-08 12:57:39,682 INFO L728 BuchiCegarLoop]: Abstraction has 1555 states and 1905 transitions. [2018-12-08 12:57:39,682 INFO L608 BuchiCegarLoop]: Abstraction has 1555 states and 1905 transitions. [2018-12-08 12:57:39,682 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-08 12:57:39,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1555 states and 1905 transitions. [2018-12-08 12:57:39,684 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1472 [2018-12-08 12:57:39,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:39,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:39,685 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:39,685 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:39,685 INFO L794 eck$LassoCheckResult]: Stem: 17879#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 17846#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17848#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17876#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17842#L40-1 mp_add_~nb~0 := 4; 17843#L50 assume !(0 == mp_add_~b3~0 % 256); 17867#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17868#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; 18467#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18468#L65 [2018-12-08 12:57:39,685 INFO L796 eck$LassoCheckResult]: Loop: 18468#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 19212#L65-2 assume !(1 == mp_add_~i~0 % 256); 19210#L66-1 assume !(2 == mp_add_~i~0 % 256); 17856#L67-1 assume !(3 == mp_add_~i~0 % 256); 17857#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19232#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 19231#L71-2 assume !(1 == mp_add_~i~0 % 256); 19230#L72-1 assume !(2 == mp_add_~i~0 % 256); 19229#L73-1 assume !(3 == mp_add_~i~0 % 256); 19228#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19227#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 19226#L80-1 assume !(1 == mp_add_~i~0 % 256); 19225#L81-1 assume !(2 == mp_add_~i~0 % 256); 19224#L82-1 assume !(3 == mp_add_~i~0 % 256); 19223#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19222#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; 19221#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19220#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19203#L71 assume !(0 == mp_add_~i~0 % 256); 19200#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; 19038#L72-1 assume !(2 == mp_add_~i~0 % 256); 19197#L73-1 assume !(3 == mp_add_~i~0 % 256); 19193#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19191#L76-1 assume !(0 == mp_add_~i~0 % 256); 19188#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 19189#L81-1 assume !(2 == mp_add_~i~0 % 256); 19219#L82-1 assume !(3 == mp_add_~i~0 % 256); 19218#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19178#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; 19175#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19176#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19168#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19169#L76-1 assume !(0 == mp_add_~i~0 % 256); 19167#L80-1 assume !(1 == mp_add_~i~0 % 256); 19165#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 19161#L82-1 assume !(3 == mp_add_~i~0 % 256); 19128#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19129#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; 19122#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19123#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19147#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19130#L76-1 assume !(0 == mp_add_~i~0 % 256); 19131#L80-1 assume !(1 == mp_add_~i~0 % 256); 19111#L81-1 assume !(2 == mp_add_~i~0 % 256); 19080#L82-1 assume !(3 == mp_add_~i~0 % 256); 19070#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19097#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; 19095#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18468#L65 [2018-12-08 12:57:39,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:39,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 3 times [2018-12-08 12:57:39,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:39,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:39,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:39,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:39,691 INFO L82 PathProgramCache]: Analyzing trace with hash 310688569, now seen corresponding path program 1 times [2018-12-08 12:57:39,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:39,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 12:57:39,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:57:39,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 12:57:39,716 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:57:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:57:39,716 INFO L87 Difference]: Start difference. First operand 1555 states and 1905 transitions. cyclomatic complexity: 358 Second operand 4 states. [2018-12-08 12:57:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:39,751 INFO L93 Difference]: Finished difference Result 1925 states and 2297 transitions. [2018-12-08 12:57:39,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 12:57:39,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2297 transitions. [2018-12-08 12:57:39,755 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1827 [2018-12-08 12:57:39,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1925 states and 2297 transitions. [2018-12-08 12:57:39,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1925 [2018-12-08 12:57:39,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1925 [2018-12-08 12:57:39,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1925 states and 2297 transitions. [2018-12-08 12:57:39,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:39,760 INFO L705 BuchiCegarLoop]: Abstraction has 1925 states and 2297 transitions. [2018-12-08 12:57:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states and 2297 transitions. [2018-12-08 12:57:39,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1624. [2018-12-08 12:57:39,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2018-12-08 12:57:39,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1958 transitions. [2018-12-08 12:57:39,770 INFO L728 BuchiCegarLoop]: Abstraction has 1624 states and 1958 transitions. [2018-12-08 12:57:39,770 INFO L608 BuchiCegarLoop]: Abstraction has 1624 states and 1958 transitions. [2018-12-08 12:57:39,770 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-08 12:57:39,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1624 states and 1958 transitions. [2018-12-08 12:57:39,773 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1541 [2018-12-08 12:57:39,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:39,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:39,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:39,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:39,773 INFO L794 eck$LassoCheckResult]: Stem: 21364#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 21332#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21334#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21361#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21367#L40-1 mp_add_~nb~0 := 4; 21357#L50 assume !(0 == mp_add_~b3~0 % 256); 21358#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22576#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; 22545#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22544#L65 [2018-12-08 12:57:39,773 INFO L796 eck$LassoCheckResult]: Loop: 22544#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22543#L65-2 assume !(1 == mp_add_~i~0 % 256); 22542#L66-1 assume !(2 == mp_add_~i~0 % 256); 22541#L67-1 assume !(3 == mp_add_~i~0 % 256); 22540#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22539#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22538#L71-2 assume !(1 == mp_add_~i~0 % 256); 22537#L72-1 assume !(2 == mp_add_~i~0 % 256); 22536#L73-1 assume !(3 == mp_add_~i~0 % 256); 22535#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22533#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22531#L80-1 assume !(1 == mp_add_~i~0 % 256); 22529#L81-1 assume !(2 == mp_add_~i~0 % 256); 22527#L82-1 assume !(3 == mp_add_~i~0 % 256); 22525#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22523#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; 22518#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22516#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22514#L71 assume !(0 == mp_add_~i~0 % 256); 22513#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; 22380#L72-1 assume !(2 == mp_add_~i~0 % 256); 22512#L73-1 assume !(3 == mp_add_~i~0 % 256); 22511#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22509#L76-1 assume !(0 == mp_add_~i~0 % 256); 22507#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22505#L81-1 assume !(2 == mp_add_~i~0 % 256); 22503#L82-1 assume !(3 == mp_add_~i~0 % 256); 22501#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22498#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; 22499#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22477#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22475#L71 assume !(0 == mp_add_~i~0 % 256); 22473#L71-2 assume !(1 == mp_add_~i~0 % 256); 22469#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; 22468#L73-1 assume !(3 == mp_add_~i~0 % 256); 22466#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22465#L76-1 assume !(0 == mp_add_~i~0 % 256); 22464#L80-1 assume !(1 == mp_add_~i~0 % 256); 22463#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22393#L82-1 assume !(3 == mp_add_~i~0 % 256); 22462#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22461#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; 22459#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22456#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22453#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22450#L76-1 assume !(0 == mp_add_~i~0 % 256); 22445#L80-1 assume !(1 == mp_add_~i~0 % 256); 22411#L81-1 assume !(2 == mp_add_~i~0 % 256); 22408#L82-1 assume !(3 == mp_add_~i~0 % 256); 22409#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22571#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; 22572#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22544#L65 [2018-12-08 12:57:39,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:39,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 4 times [2018-12-08 12:57:39,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:39,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:39,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:39,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:39,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash 982437249, now seen corresponding path program 1 times [2018-12-08 12:57:39,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:39,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:39,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-08 12:57:39,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:39,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:57:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:39,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 12:57:39,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:39,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-12-08 12:57:39,975 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:39,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 12:57:39,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-08 12:57:39,975 INFO L87 Difference]: Start difference. First operand 1624 states and 1958 transitions. cyclomatic complexity: 342 Second operand 10 states. [2018-12-08 12:57:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:40,783 INFO L93 Difference]: Finished difference Result 2110 states and 2374 transitions. [2018-12-08 12:57:40,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-08 12:57:40,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2110 states and 2374 transitions. [2018-12-08 12:57:40,786 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1482 [2018-12-08 12:57:40,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2110 states to 2036 states and 2293 transitions. [2018-12-08 12:57:40,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2036 [2018-12-08 12:57:40,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2036 [2018-12-08 12:57:40,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2036 states and 2293 transitions. [2018-12-08 12:57:40,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:40,791 INFO L705 BuchiCegarLoop]: Abstraction has 2036 states and 2293 transitions. [2018-12-08 12:57:40,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states and 2293 transitions. [2018-12-08 12:57:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1155. [2018-12-08 12:57:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-12-08 12:57:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1341 transitions. [2018-12-08 12:57:40,799 INFO L728 BuchiCegarLoop]: Abstraction has 1155 states and 1341 transitions. [2018-12-08 12:57:40,799 INFO L608 BuchiCegarLoop]: Abstraction has 1155 states and 1341 transitions. [2018-12-08 12:57:40,799 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-08 12:57:40,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1155 states and 1341 transitions. [2018-12-08 12:57:40,800 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 890 [2018-12-08 12:57:40,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:40,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:40,801 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:40,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:40,801 INFO L794 eck$LassoCheckResult]: Stem: 25333#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 25307#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25308#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25331#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25335#L40-1 mp_add_~nb~0 := 4; 25586#L50 assume !(0 == mp_add_~b3~0 % 256); 25583#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25584#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; 25580#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25579#L65 [2018-12-08 12:57:40,801 INFO L796 eck$LassoCheckResult]: Loop: 25579#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25578#L65-2 assume !(1 == mp_add_~i~0 % 256); 25577#L66-1 assume !(2 == mp_add_~i~0 % 256); 25576#L67-1 assume !(3 == mp_add_~i~0 % 256); 25575#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25574#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25573#L71-2 assume !(1 == mp_add_~i~0 % 256); 25572#L72-1 assume !(2 == mp_add_~i~0 % 256); 25571#L73-1 assume !(3 == mp_add_~i~0 % 256); 25569#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25568#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 25567#L80-1 assume !(1 == mp_add_~i~0 % 256); 25566#L81-1 assume !(2 == mp_add_~i~0 % 256); 25565#L82-1 assume !(3 == mp_add_~i~0 % 256); 25562#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25560#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; 25558#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25556#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25554#L71 assume !(0 == mp_add_~i~0 % 256); 25552#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; 25550#L72-1 assume !(2 == mp_add_~i~0 % 256); 25548#L73-1 assume !(3 == mp_add_~i~0 % 256); 25544#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25542#L76-1 assume !(0 == mp_add_~i~0 % 256); 25539#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25540#L81-1 assume !(2 == mp_add_~i~0 % 256); 25535#L82-1 assume !(3 == mp_add_~i~0 % 256); 25536#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25531#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; 25532#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25526#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25527#L71 assume !(0 == mp_add_~i~0 % 256); 25457#L71-2 assume !(1 == mp_add_~i~0 % 256); 25458#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; 25453#L73-1 assume !(3 == mp_add_~i~0 % 256); 25454#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25448#L76-1 assume !(0 == mp_add_~i~0 % 256); 25449#L80-1 assume !(1 == mp_add_~i~0 % 256); 25444#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25445#L82-1 assume !(3 == mp_add_~i~0 % 256); 25440#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25441#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; 25436#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25437#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25522#L71 assume !(0 == mp_add_~i~0 % 256); 25603#L71-2 assume !(1 == mp_add_~i~0 % 256); 25602#L72-1 assume !(2 == mp_add_~i~0 % 256); 25601#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; 25600#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25599#L76-1 assume !(0 == mp_add_~i~0 % 256); 25598#L80-1 assume !(1 == mp_add_~i~0 % 256); 25597#L81-1 assume !(2 == mp_add_~i~0 % 256); 25596#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25595#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25594#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; 25593#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25592#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25591#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25590#L76-1 assume !(0 == mp_add_~i~0 % 256); 25589#L80-1 assume !(1 == mp_add_~i~0 % 256); 25588#L81-1 assume !(2 == mp_add_~i~0 % 256); 25587#L82-1 assume !(3 == mp_add_~i~0 % 256); 25585#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25581#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; 25582#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25579#L65 [2018-12-08 12:57:40,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 5 times [2018-12-08 12:57:40,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:40,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:40,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:40,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:40,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:40,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:40,807 INFO L82 PathProgramCache]: Analyzing trace with hash -2060926355, now seen corresponding path program 1 times [2018-12-08 12:57:40,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:40,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:40,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 12:57:40,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:40,865 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:57:40,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:40,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:40,993 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 12:57:41,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:41,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-08 12:57:41,008 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:41,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-08 12:57:41,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-08 12:57:41,008 INFO L87 Difference]: Start difference. First operand 1155 states and 1341 transitions. cyclomatic complexity: 193 Second operand 14 states. [2018-12-08 12:57:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:42,612 INFO L93 Difference]: Finished difference Result 2314 states and 2592 transitions. [2018-12-08 12:57:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-08 12:57:42,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2314 states and 2592 transitions. [2018-12-08 12:57:42,616 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1068 [2018-12-08 12:57:42,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2314 states to 2279 states and 2529 transitions. [2018-12-08 12:57:42,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2279 [2018-12-08 12:57:42,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2279 [2018-12-08 12:57:42,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2279 states and 2529 transitions. [2018-12-08 12:57:42,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:42,621 INFO L705 BuchiCegarLoop]: Abstraction has 2279 states and 2529 transitions. [2018-12-08 12:57:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states and 2529 transitions. [2018-12-08 12:57:42,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1142. [2018-12-08 12:57:42,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-12-08 12:57:42,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1333 transitions. [2018-12-08 12:57:42,629 INFO L728 BuchiCegarLoop]: Abstraction has 1142 states and 1333 transitions. [2018-12-08 12:57:42,629 INFO L608 BuchiCegarLoop]: Abstraction has 1142 states and 1333 transitions. [2018-12-08 12:57:42,629 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-08 12:57:42,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1142 states and 1333 transitions. [2018-12-08 12:57:42,630 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 811 [2018-12-08 12:57:42,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:42,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:42,631 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:42,631 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:42,631 INFO L794 eck$LassoCheckResult]: Stem: 29066#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 29043#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 29045#L42 assume !(0 == mp_add_~a2~0 % 256); 29065#L40-1 mp_add_~nb~0 := 4; 29469#L50 assume !(0 == mp_add_~b3~0 % 256); 29466#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29464#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; 29465#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29459#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29460#L65-2 assume !(1 == mp_add_~i~0 % 256); 29455#L66-1 assume !(2 == mp_add_~i~0 % 256); 29456#L67-1 assume !(3 == mp_add_~i~0 % 256); 29451#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29452#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 29447#L71-2 assume !(1 == mp_add_~i~0 % 256); 29448#L72-1 assume !(2 == mp_add_~i~0 % 256); 29443#L73-1 assume !(3 == mp_add_~i~0 % 256); 29444#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29439#L76-1 [2018-12-08 12:57:42,631 INFO L796 eck$LassoCheckResult]: Loop: 29439#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 29440#L80-1 assume !(1 == mp_add_~i~0 % 256); 29435#L81-1 assume !(2 == mp_add_~i~0 % 256); 29436#L82-1 assume !(3 == mp_add_~i~0 % 256); 29431#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29432#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; 30109#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29299#L65 assume !(0 == mp_add_~i~0 % 256); 29138#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; 29139#L66-1 assume !(2 == mp_add_~i~0 % 256); 29132#L67-1 assume !(3 == mp_add_~i~0 % 256); 29133#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29126#L71 assume !(0 == mp_add_~i~0 % 256); 29127#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; 29119#L72-1 assume !(2 == mp_add_~i~0 % 256); 29120#L73-1 assume !(3 == mp_add_~i~0 % 256); 29110#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29111#L76-1 assume !(0 == mp_add_~i~0 % 256); 29341#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 29339#L81-1 assume !(2 == mp_add_~i~0 % 256); 29337#L82-1 assume !(3 == mp_add_~i~0 % 256); 29335#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29333#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; 29329#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29328#L65 assume !(0 == mp_add_~i~0 % 256); 29326#L65-2 assume !(1 == mp_add_~i~0 % 256); 29325#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; 29324#L67-1 assume !(3 == mp_add_~i~0 % 256); 29322#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29319#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29318#L76-1 assume !(0 == mp_add_~i~0 % 256); 29317#L80-1 assume !(1 == mp_add_~i~0 % 256); 29316#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 29311#L82-1 assume !(3 == mp_add_~i~0 % 256); 29315#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29314#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; 29306#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29301#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29300#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29297#L76-1 assume !(0 == mp_add_~i~0 % 256); 29294#L80-1 assume !(1 == mp_add_~i~0 % 256); 29224#L81-1 assume !(2 == mp_add_~i~0 % 256); 29223#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 29222#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29221#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; 29220#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29219#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29218#L71 assume !(0 == mp_add_~i~0 % 256); 29217#L71-2 assume !(1 == mp_add_~i~0 % 256); 29216#L72-1 assume !(2 == mp_add_~i~0 % 256); 29215#L73-1 assume !(3 == mp_add_~i~0 % 256); 29214#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29213#L76-1 assume !(0 == mp_add_~i~0 % 256); 29212#L80-1 assume !(1 == mp_add_~i~0 % 256); 29211#L81-1 assume !(2 == mp_add_~i~0 % 256); 29209#L82-1 assume !(3 == mp_add_~i~0 % 256); 29208#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29207#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; 29205#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29206#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29198#L71 assume !(0 == mp_add_~i~0 % 256); 29199#L71-2 assume !(1 == mp_add_~i~0 % 256); 29190#L72-1 assume !(2 == mp_add_~i~0 % 256); 29186#L73-1 assume !(3 == mp_add_~i~0 % 256); 29184#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29182#L76-1 assume !(0 == mp_add_~i~0 % 256); 29180#L80-1 assume !(1 == mp_add_~i~0 % 256); 29176#L81-1 assume !(2 == mp_add_~i~0 % 256); 29177#L82-1 assume !(3 == mp_add_~i~0 % 256); 29095#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29096#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; 29144#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29145#L65 assume !(0 == mp_add_~i~0 % 256); 29161#L65-2 assume !(1 == mp_add_~i~0 % 256); 29159#L66-1 assume !(2 == mp_add_~i~0 % 256); 29160#L67-1 assume !(3 == mp_add_~i~0 % 256); 29204#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29474#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29473#L76-1 assume !(0 == mp_add_~i~0 % 256); 29472#L80-1 assume !(1 == mp_add_~i~0 % 256); 29471#L81-1 assume !(2 == mp_add_~i~0 % 256); 29470#L82-1 assume !(3 == mp_add_~i~0 % 256); 29467#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29468#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; 29461#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29462#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29457#L65-2 assume !(1 == mp_add_~i~0 % 256); 29458#L66-1 assume !(2 == mp_add_~i~0 % 256); 29453#L67-1 assume !(3 == mp_add_~i~0 % 256); 29454#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29449#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 29450#L71-2 assume !(1 == mp_add_~i~0 % 256); 29445#L72-1 assume !(2 == mp_add_~i~0 % 256); 29446#L73-1 assume !(3 == mp_add_~i~0 % 256); 29441#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29439#L76-1 [2018-12-08 12:57:42,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:42,631 INFO L82 PathProgramCache]: Analyzing trace with hash 149431148, now seen corresponding path program 1 times [2018-12-08 12:57:42,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:42,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:42,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:42,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:42,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:42,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:42,646 INFO L82 PathProgramCache]: Analyzing trace with hash 989628977, now seen corresponding path program 1 times [2018-12-08 12:57:42,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:42,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:42,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:42,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:42,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:42,700 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 181 proven. 7 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-08 12:57:42,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:42,700 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/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-12-08 12:57:42,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:42,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 173 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-12-08 12:57:42,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:42,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-08 12:57:42,776 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:57:42,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:57:42,776 INFO L87 Difference]: Start difference. First operand 1142 states and 1333 transitions. cyclomatic complexity: 199 Second operand 8 states. [2018-12-08 12:57:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:43,408 INFO L93 Difference]: Finished difference Result 1313 states and 1500 transitions. [2018-12-08 12:57:43,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 12:57:43,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1313 states and 1500 transitions. [2018-12-08 12:57:43,410 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 673 [2018-12-08 12:57:43,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1313 states to 1303 states and 1490 transitions. [2018-12-08 12:57:43,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1303 [2018-12-08 12:57:43,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1303 [2018-12-08 12:57:43,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1303 states and 1490 transitions. [2018-12-08 12:57:43,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:43,413 INFO L705 BuchiCegarLoop]: Abstraction has 1303 states and 1490 transitions. [2018-12-08 12:57:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states and 1490 transitions. [2018-12-08 12:57:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1046. [2018-12-08 12:57:43,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2018-12-08 12:57:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1220 transitions. [2018-12-08 12:57:43,418 INFO L728 BuchiCegarLoop]: Abstraction has 1046 states and 1220 transitions. [2018-12-08 12:57:43,418 INFO L608 BuchiCegarLoop]: Abstraction has 1046 states and 1220 transitions. [2018-12-08 12:57:43,418 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-08 12:57:43,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1046 states and 1220 transitions. [2018-12-08 12:57:43,420 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 586 [2018-12-08 12:57:43,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:43,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:43,420 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:43,420 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:43,420 INFO L794 eck$LassoCheckResult]: Stem: 31828#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 31800#L40 assume !(0 == mp_add_~a3~0 % 256); 31801#L40-1 mp_add_~nb~0 := 4; 31822#L50 assume !(0 == mp_add_~b3~0 % 256); 31823#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 32425#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; 32426#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32421#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32419#L65-2 assume !(1 == mp_add_~i~0 % 256); 32420#L66-1 assume !(2 == mp_add_~i~0 % 256); 32415#L67-1 assume !(3 == mp_add_~i~0 % 256); 32416#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32411#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32412#L71-2 assume !(1 == mp_add_~i~0 % 256); 32407#L72-1 assume !(2 == mp_add_~i~0 % 256); 32408#L73-1 assume !(3 == mp_add_~i~0 % 256); 32403#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32404#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32796#L80-1 assume !(1 == mp_add_~i~0 % 256); 32328#L81-1 assume !(2 == mp_add_~i~0 % 256); 32329#L82-1 assume !(3 == mp_add_~i~0 % 256); 32320#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32321#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; 32281#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32278#L65 [2018-12-08 12:57:43,420 INFO L796 eck$LassoCheckResult]: Loop: 32278#L65 assume !(0 == mp_add_~i~0 % 256); 32277#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; 32232#L66-1 assume !(2 == mp_add_~i~0 % 256); 32276#L67-1 assume !(3 == mp_add_~i~0 % 256); 32275#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32274#L71 assume !(0 == mp_add_~i~0 % 256); 32273#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; 32272#L72-1 assume !(2 == mp_add_~i~0 % 256); 32271#L73-1 assume !(3 == mp_add_~i~0 % 256); 32269#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32265#L76-1 assume !(0 == mp_add_~i~0 % 256); 32266#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 32301#L81-1 assume !(2 == mp_add_~i~0 % 256); 32302#L82-1 assume !(3 == mp_add_~i~0 % 256); 32297#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32298#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; 32238#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32239#L65 assume !(0 == mp_add_~i~0 % 256); 32230#L65-2 assume !(1 == mp_add_~i~0 % 256); 32226#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; 32227#L67-1 assume !(3 == mp_add_~i~0 % 256); 32466#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32465#L71 assume !(0 == mp_add_~i~0 % 256); 32464#L71-2 assume !(1 == mp_add_~i~0 % 256); 32463#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; 32462#L73-1 assume !(3 == mp_add_~i~0 % 256); 32460#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32393#L76-1 assume !(0 == mp_add_~i~0 % 256); 32391#L80-1 assume !(1 == mp_add_~i~0 % 256); 32392#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 32368#L82-1 assume !(3 == mp_add_~i~0 % 256); 32387#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32379#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; 32380#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32451#L65 assume !(0 == mp_add_~i~0 % 256); 32450#L65-2 assume !(1 == mp_add_~i~0 % 256); 32449#L66-1 assume !(2 == mp_add_~i~0 % 256); 32229#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; 32334#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32448#L71 assume !(0 == mp_add_~i~0 % 256); 32447#L71-2 assume !(1 == mp_add_~i~0 % 256); 32446#L72-1 assume !(2 == mp_add_~i~0 % 256); 32445#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; 32443#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32442#L76-1 assume !(0 == mp_add_~i~0 % 256); 32441#L80-1 assume !(1 == mp_add_~i~0 % 256); 32440#L81-1 assume !(2 == mp_add_~i~0 % 256); 32439#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 32438#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32437#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; 32436#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32434#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32433#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32432#L76-1 assume !(0 == mp_add_~i~0 % 256); 32431#L80-1 assume !(1 == mp_add_~i~0 % 256); 32430#L81-1 assume !(2 == mp_add_~i~0 % 256); 32429#L82-1 assume !(3 == mp_add_~i~0 % 256); 32427#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32428#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; 32422#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32423#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32476#L65-2 assume !(1 == mp_add_~i~0 % 256); 32417#L66-1 assume !(2 == mp_add_~i~0 % 256); 32418#L67-1 assume !(3 == mp_add_~i~0 % 256); 32413#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32414#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32409#L71-2 assume !(1 == mp_add_~i~0 % 256); 32410#L72-1 assume !(2 == mp_add_~i~0 % 256); 32405#L73-1 assume !(3 == mp_add_~i~0 % 256); 32406#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32772#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32770#L80-1 assume !(1 == mp_add_~i~0 % 256); 32768#L81-1 assume !(2 == mp_add_~i~0 % 256); 32766#L82-1 assume !(3 == mp_add_~i~0 % 256); 32764#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32754#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; 32747#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32278#L65 [2018-12-08 12:57:43,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 8 times [2018-12-08 12:57:43,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:43,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:43,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:43,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:43,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:43,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash -872206489, now seen corresponding path program 1 times [2018-12-08 12:57:43,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:43,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:43,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:43,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:43,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:43,473 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:57:43,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:43,473 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:57:43,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:43,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:43,548 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:57:43,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:43,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-12-08 12:57:43,563 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:43,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 12:57:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 12:57:43,563 INFO L87 Difference]: Start difference. First operand 1046 states and 1220 transitions. cyclomatic complexity: 184 Second operand 8 states. [2018-12-08 12:57:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:44,885 INFO L93 Difference]: Finished difference Result 1367 states and 1526 transitions. [2018-12-08 12:57:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 12:57:44,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1367 states and 1526 transitions. [2018-12-08 12:57:44,887 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 647 [2018-12-08 12:57:44,889 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1367 states to 1287 states and 1426 transitions. [2018-12-08 12:57:44,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1287 [2018-12-08 12:57:44,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1287 [2018-12-08 12:57:44,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1287 states and 1426 transitions. [2018-12-08 12:57:44,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:44,890 INFO L705 BuchiCegarLoop]: Abstraction has 1287 states and 1426 transitions. [2018-12-08 12:57:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states and 1426 transitions. [2018-12-08 12:57:44,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 870. [2018-12-08 12:57:44,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-12-08 12:57:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 971 transitions. [2018-12-08 12:57:44,896 INFO L728 BuchiCegarLoop]: Abstraction has 870 states and 971 transitions. [2018-12-08 12:57:44,896 INFO L608 BuchiCegarLoop]: Abstraction has 870 states and 971 transitions. [2018-12-08 12:57:44,896 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-08 12:57:44,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 870 states and 971 transitions. [2018-12-08 12:57:44,897 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 479 [2018-12-08 12:57:44,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:44,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:44,897 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-12-08 12:57:44,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:44,897 INFO L794 eck$LassoCheckResult]: Stem: 34479#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 34472#L40 assume !(0 == mp_add_~a3~0 % 256); 34473#L40-1 mp_add_~nb~0 := 4; 34470#L50 assume !(0 == mp_add_~b3~0 % 256); 34471#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34539#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; 34540#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34527#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34528#L65-2 assume !(1 == mp_add_~i~0 % 256); 34523#L66-1 assume !(2 == mp_add_~i~0 % 256); 34524#L67-1 assume !(3 == mp_add_~i~0 % 256); 34519#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34520#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34515#L71-2 assume !(1 == mp_add_~i~0 % 256); 34516#L72-1 assume !(2 == mp_add_~i~0 % 256); 34511#L73-1 assume !(3 == mp_add_~i~0 % 256); 34512#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34940#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 34939#L80-1 assume !(1 == mp_add_~i~0 % 256); 34938#L81-1 assume !(2 == mp_add_~i~0 % 256); 34937#L82-1 assume !(3 == mp_add_~i~0 % 256); 34936#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34935#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; 34934#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34933#L65 assume !(0 == mp_add_~i~0 % 256); 34486#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; 34487#L66-1 [2018-12-08 12:57:44,897 INFO L796 eck$LassoCheckResult]: Loop: 34487#L66-1 assume !(2 == mp_add_~i~0 % 256); 34863#L67-1 assume !(3 == mp_add_~i~0 % 256); 34862#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34861#L71 assume !(0 == mp_add_~i~0 % 256); 34860#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; 34859#L72-1 assume !(2 == mp_add_~i~0 % 256); 34858#L73-1 assume !(3 == mp_add_~i~0 % 256); 34856#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34855#L76-1 assume !(0 == mp_add_~i~0 % 256); 34854#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 34853#L81-1 assume !(2 == mp_add_~i~0 % 256); 34852#L82-1 assume !(3 == mp_add_~i~0 % 256); 34851#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34849#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; 34850#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34917#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34945#L71 assume !(0 == mp_add_~i~0 % 256); 34914#L71-2 assume !(1 == mp_add_~i~0 % 256); 34913#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; 34912#L73-1 assume !(3 == mp_add_~i~0 % 256); 34910#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34909#L76-1 assume !(0 == mp_add_~i~0 % 256); 34908#L80-1 assume !(1 == mp_add_~i~0 % 256); 34907#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 34906#L82-1 assume !(3 == mp_add_~i~0 % 256); 34905#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34811#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; 34812#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34806#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34808#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34802#L76-1 assume !(0 == mp_add_~i~0 % 256); 34803#L80-1 assume !(1 == mp_add_~i~0 % 256); 34798#L81-1 assume !(2 == mp_add_~i~0 % 256); 34799#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 34794#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34795#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; 34790#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34791#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34786#L71 assume !(0 == mp_add_~i~0 % 256); 34787#L71-2 assume !(1 == mp_add_~i~0 % 256); 34782#L72-1 assume !(2 == mp_add_~i~0 % 256); 34783#L73-1 assume !(3 == mp_add_~i~0 % 256); 34778#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34779#L76-1 assume !(0 == mp_add_~i~0 % 256); 34774#L80-1 assume !(1 == mp_add_~i~0 % 256); 34775#L81-1 assume !(2 == mp_add_~i~0 % 256); 34770#L82-1 assume !(3 == mp_add_~i~0 % 256); 34771#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34766#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; 34767#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34762#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34763#L71 assume !(0 == mp_add_~i~0 % 256); 34758#L71-2 assume !(1 == mp_add_~i~0 % 256); 34759#L72-1 assume !(2 == mp_add_~i~0 % 256); 34754#L73-1 assume !(3 == mp_add_~i~0 % 256); 34755#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34750#L76-1 assume !(0 == mp_add_~i~0 % 256); 34751#L80-1 assume !(1 == mp_add_~i~0 % 256); 34746#L81-1 assume !(2 == mp_add_~i~0 % 256); 34747#L82-1 assume !(3 == mp_add_~i~0 % 256); 34742#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34743#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34737#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34739#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35134#L71 assume !(0 == mp_add_~i~0 % 256); 35133#L71-2 assume !(1 == mp_add_~i~0 % 256); 34951#L72-1 assume !(2 == mp_add_~i~0 % 256); 34953#L73-1 assume !(3 == mp_add_~i~0 % 256); 34949#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34950#L76-1 assume !(0 == mp_add_~i~0 % 256); 35126#L80-1 assume !(1 == mp_add_~i~0 % 256); 35125#L81-1 assume !(2 == mp_add_~i~0 % 256); 34902#L82-1 assume !(3 == mp_add_~i~0 % 256); 34714#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34715#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34709#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34710#L65 assume !(0 == mp_add_~i~0 % 256); 34819#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; 34487#L66-1 [2018-12-08 12:57:44,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 3 times [2018-12-08 12:57:44,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:44,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:44,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:44,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:44,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1984374623, now seen corresponding path program 1 times [2018-12-08 12:57:44,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:44,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:44,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:57:44,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-08 12:57:44,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:44,989 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:57:44,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:45,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:45,633 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-08 12:57:45,937 WARN L854 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~i~0 Int) (ULTIMATE.start_mp_add_~nb~0 Int)) (let ((.cse0 (mod ULTIMATE.start_mp_add_~i~0 256))) (and (<= (mod c_ULTIMATE.start_mp_add_~na~0 256) .cse0) (<= ULTIMATE.start_mp_add_~nb~0 (+ (* 256 (div ULTIMATE.start_mp_add_~nb~0 256)) 3)) (< .cse0 (mod ULTIMATE.start_mp_add_~nb~0 256)) (not (= 2 .cse0))))) is different from true [2018-12-08 12:57:47,110 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 32 not checked. [2018-12-08 12:57:47,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:47,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-12-08 12:57:47,125 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:57:47,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 12:57:47,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=89, Unknown=2, NotChecked=20, Total=156 [2018-12-08 12:57:47,125 INFO L87 Difference]: Start difference. First operand 870 states and 971 transitions. cyclomatic complexity: 109 Second operand 13 states. [2018-12-08 12:57:47,956 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-08 12:57:48,465 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-12-08 12:57:48,973 WARN L180 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-12-08 12:57:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:57:48,986 INFO L93 Difference]: Finished difference Result 645 states and 679 transitions. [2018-12-08 12:57:48,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-08 12:57:48,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 645 states and 679 transitions. [2018-12-08 12:57:48,987 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2018-12-08 12:57:48,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 645 states to 522 states and 553 transitions. [2018-12-08 12:57:48,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2018-12-08 12:57:48,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2018-12-08 12:57:48,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 553 transitions. [2018-12-08 12:57:48,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:57:48,989 INFO L705 BuchiCegarLoop]: Abstraction has 522 states and 553 transitions. [2018-12-08 12:57:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 553 transitions. [2018-12-08 12:57:48,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 472. [2018-12-08 12:57:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-12-08 12:57:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 502 transitions. [2018-12-08 12:57:48,991 INFO L728 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2018-12-08 12:57:48,991 INFO L608 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2018-12-08 12:57:48,991 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-08 12:57:48,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 472 states and 502 transitions. [2018-12-08 12:57:48,992 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2018-12-08 12:57:48,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:57:48,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:57:48,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:48,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:57:48,992 INFO L794 eck$LassoCheckResult]: Stem: 36256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 36249#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36251#L42 assume !(0 == mp_add_~a2~0 % 256); 36244#L40-1 mp_add_~nb~0 := 4; 36245#L50 assume !(0 == mp_add_~b3~0 % 256); 36240#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 36241#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; 36265#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36266#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 36304#L65-2 assume !(1 == mp_add_~i~0 % 256); 36305#L66-1 assume !(2 == mp_add_~i~0 % 256); 36300#L67-1 assume !(3 == mp_add_~i~0 % 256); 36301#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36296#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 36297#L71-2 assume !(1 == mp_add_~i~0 % 256); 36292#L72-1 assume !(2 == mp_add_~i~0 % 256); 36293#L73-1 assume !(3 == mp_add_~i~0 % 256); 36287#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 36289#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36283#L80-1 assume !(1 == mp_add_~i~0 % 256); 36284#L81-1 assume !(2 == mp_add_~i~0 % 256); 36279#L82-1 assume !(3 == mp_add_~i~0 % 256); 36280#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36665#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; 36660#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36658#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36656#L71 assume !(0 == mp_add_~i~0 % 256); 36654#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; 36652#L72-1 assume !(2 == mp_add_~i~0 % 256); 36650#L73-1 assume !(3 == mp_add_~i~0 % 256); 36648#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36645#L76-1 assume !(0 == mp_add_~i~0 % 256); 36643#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 36641#L81-1 assume !(2 == mp_add_~i~0 % 256); 36639#L82-1 assume !(3 == mp_add_~i~0 % 256); 36637#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36635#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; 36633#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36631#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36629#L71 assume !(0 == mp_add_~i~0 % 256); 36627#L71-2 assume !(1 == mp_add_~i~0 % 256); 36625#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; 36623#L73-1 assume !(3 == mp_add_~i~0 % 256); 36620#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36621#L76-1 assume !(0 == mp_add_~i~0 % 256); 36700#L80-1 assume !(1 == mp_add_~i~0 % 256); 36699#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 36698#L82-1 assume !(3 == mp_add_~i~0 % 256); 36697#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36696#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; 36695#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36694#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36693#L71 assume !(0 == mp_add_~i~0 % 256); 36692#L71-2 assume !(1 == mp_add_~i~0 % 256); 36691#L72-1 assume !(2 == mp_add_~i~0 % 256); 36690#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; 36236#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36237#L76-1 assume !(0 == mp_add_~i~0 % 256); 36229#L80-1 assume !(1 == mp_add_~i~0 % 256); 36230#L81-1 assume !(2 == mp_add_~i~0 % 256); 36233#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 36239#L83-1 [2018-12-08 12:57:48,992 INFO L796 eck$LassoCheckResult]: Loop: 36239#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36234#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; 36235#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36252#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36242#L71 assume !(0 == mp_add_~i~0 % 256); 36231#L71-2 assume !(1 == mp_add_~i~0 % 256); 36232#L72-1 assume !(2 == mp_add_~i~0 % 256); 36243#L73-1 assume !(3 == mp_add_~i~0 % 256); 36248#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36689#L76-1 assume !(0 == mp_add_~i~0 % 256); 36688#L80-1 assume !(1 == mp_add_~i~0 % 256); 36687#L81-1 assume !(2 == mp_add_~i~0 % 256); 36238#L82-1 assume !(3 == mp_add_~i~0 % 256); 36239#L83-1 [2018-12-08 12:57:48,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:48,992 INFO L82 PathProgramCache]: Analyzing trace with hash -959140882, now seen corresponding path program 1 times [2018-12-08 12:57:48,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:48,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:48,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:48,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 12:57:49,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:57:49,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:57:49,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:57:49,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:57:49,150 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-12-08 12:57:49,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:57:49,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-12-08 12:57:49,176 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 12:57:49,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:57:49,176 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 1 times [2018-12-08 12:57:49,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:57:49,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:57:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:49,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:57:49,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:57:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:57:49,226 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:57:49,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:57:49,226 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:57:49,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:57:49,226 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:57:49,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:49,226 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:57:49,226 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:57:49,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-12-08 12:57:49,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:57:49,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:57:49,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:49,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:57:49,365 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:57:49,366 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:49,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:57:49,367 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:57:49,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 12:57:49,373 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_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:49,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:57:49,397 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:57:49,438 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:57:49,438 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:58:00,417 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:58:00,419 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:58:00,419 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:58:00,419 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:58:00,419 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:58:00,419 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:58:00,419 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:58:00,420 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:58:00,420 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:58:00,420 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-12-08 12:58:00,420 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:58:00,420 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:58:00,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:58:00,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:58:00,547 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:58:00,547 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:58:00,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:58:00,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:58:00,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:58:00,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:58:00,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,552 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:58:00,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,553 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:00,553 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:00,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,554 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:00,555 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:00,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,557 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:58:00,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,558 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:00,558 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:00,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,560 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:00,560 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:00,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,563 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:58:00,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-12-08 12:58:00,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,564 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:00,564 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:00,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:00,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,565 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:00,566 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:00,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,569 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:58:00,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,569 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:00,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,570 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:00,570 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:00,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:00,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,572 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:00,572 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:00,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,575 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 12:58:00,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,576 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:58:00,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,576 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:00,576 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:00,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,578 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:58:00,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:00,579 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:00,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,583 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 12:58:00,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,584 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:00,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,584 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:00,585 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:00,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,586 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:00,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,586 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:00,587 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:00,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,595 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 12:58:00,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,595 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:00,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,596 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:00,596 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:00,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,598 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:00,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:00,598 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:00,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,601 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 12:58:00,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,601 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,601 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:00,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,602 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:58:00,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:58:00,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:00,605 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:00,605 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:00,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:00,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:00,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:00,605 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:58:00,606 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:58:00,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:00,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-08 12:58:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-08 12:58:00,612 INFO L87 Difference]: Start difference. First operand 472 states and 502 transitions. cyclomatic complexity: 34 Second operand 12 states. [2018-12-08 12:58:01,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:58:01,067 INFO L93 Difference]: Finished difference Result 580 states and 608 transitions. [2018-12-08 12:58:01,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 12:58:01,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 608 transitions. [2018-12-08 12:58:01,069 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 123 [2018-12-08 12:58:01,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 561 states and 589 transitions. [2018-12-08 12:58:01,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2018-12-08 12:58:01,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2018-12-08 12:58:01,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 589 transitions. [2018-12-08 12:58:01,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:58:01,071 INFO L705 BuchiCegarLoop]: Abstraction has 561 states and 589 transitions. [2018-12-08 12:58:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 589 transitions. [2018-12-08 12:58:01,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 425. [2018-12-08 12:58:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-08 12:58:01,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 449 transitions. [2018-12-08 12:58:01,075 INFO L728 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2018-12-08 12:58:01,075 INFO L608 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2018-12-08 12:58:01,075 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-08 12:58:01,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 449 transitions. [2018-12-08 12:58:01,076 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2018-12-08 12:58:01,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:58:01,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:58:01,077 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-12-08 12:58:01,077 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:58:01,077 INFO L794 eck$LassoCheckResult]: Stem: 37509#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 37502#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37504#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37508#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37514#L40-1 mp_add_~nb~0 := 4; 37555#L50 assume !(0 == mp_add_~b3~0 % 256); 37493#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 37494#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; 37558#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37556#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 37557#L65-2 assume !(1 == mp_add_~i~0 % 256); 37512#L66-1 assume !(2 == mp_add_~i~0 % 256); 37513#L67-1 assume !(3 == mp_add_~i~0 % 256); 37516#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37906#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 37904#L71-2 assume !(1 == mp_add_~i~0 % 256); 37902#L72-1 assume !(2 == mp_add_~i~0 % 256); 37900#L73-1 assume !(3 == mp_add_~i~0 % 256); 37898#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37897#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 37896#L80-1 assume !(1 == mp_add_~i~0 % 256); 37895#L81-1 assume !(2 == mp_add_~i~0 % 256); 37894#L82-1 assume !(3 == mp_add_~i~0 % 256); 37893#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37892#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; 37890#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37888#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37886#L71 assume !(0 == mp_add_~i~0 % 256); 37884#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; 37882#L72-1 assume !(2 == mp_add_~i~0 % 256); 37880#L73-1 assume !(3 == mp_add_~i~0 % 256); 37878#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37876#L76-1 assume !(0 == mp_add_~i~0 % 256); 37874#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 37872#L81-1 assume !(2 == mp_add_~i~0 % 256); 37870#L82-1 assume !(3 == mp_add_~i~0 % 256); 37868#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37866#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; 37864#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37862#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37860#L71 assume !(0 == mp_add_~i~0 % 256); 37858#L71-2 assume !(1 == mp_add_~i~0 % 256); 37856#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; 37854#L73-1 assume !(3 == mp_add_~i~0 % 256); 37852#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37850#L76-1 assume !(0 == mp_add_~i~0 % 256); 37848#L80-1 assume !(1 == mp_add_~i~0 % 256); 37846#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 37844#L82-1 assume !(3 == mp_add_~i~0 % 256); 37842#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37840#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; 37838#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37836#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37834#L71 assume !(0 == mp_add_~i~0 % 256); 37832#L71-2 assume !(1 == mp_add_~i~0 % 256); 37830#L72-1 assume !(2 == mp_add_~i~0 % 256); 37828#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; 37826#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37825#L76-1 assume !(0 == mp_add_~i~0 % 256); 37824#L80-1 assume !(1 == mp_add_~i~0 % 256); 37823#L81-1 assume !(2 == mp_add_~i~0 % 256); 37822#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 37495#L83-1 [2018-12-08 12:58:01,077 INFO L796 eck$LassoCheckResult]: Loop: 37495#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37489#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; 37490#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37507#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37498#L71 assume !(0 == mp_add_~i~0 % 256); 37486#L71-2 assume !(1 == mp_add_~i~0 % 256); 37487#L72-1 assume !(2 == mp_add_~i~0 % 256); 37499#L73-1 assume !(3 == mp_add_~i~0 % 256); 37491#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37492#L76-1 assume !(0 == mp_add_~i~0 % 256); 37484#L80-1 assume !(1 == mp_add_~i~0 % 256); 37485#L81-1 assume !(2 == mp_add_~i~0 % 256); 37488#L82-1 assume !(3 == mp_add_~i~0 % 256); 37495#L83-1 [2018-12-08 12:58:01,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:58:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash 773605064, now seen corresponding path program 1 times [2018-12-08 12:58:01,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:58:01,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:58:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:58:01,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:58:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:58:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:58:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:58:01,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:58:01,096 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 2 times [2018-12-08 12:58:01,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:58:01,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:58:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:58:01,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:58:01,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:58:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:58:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:58:01,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:58:01,100 INFO L82 PathProgramCache]: Analyzing trace with hash -600207712, now seen corresponding path program 2 times [2018-12-08 12:58:01,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:58:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:58:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:58:01,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:58:01,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:58:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:58:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-08 12:58:01,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 12:58:01,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 12:58:01,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 12:58:01,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-08 12:58:01,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 12:58:01,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:58:01,386 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-12-08 12:58:01,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 12:58:01,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-12-08 12:58:01,439 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:58:01,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:58:01,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:58:01,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:58:01,439 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 12:58:01,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:58:01,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:58:01,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:58:01,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-12-08 12:58:01,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:58:01,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:58:01,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-12-08 12:58:01,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:58:01,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:58:01,545 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:58:01,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 12:58:01,549 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f7d4cbd-ed75-4756-86e7-b0133565cb24/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:58:01,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 12:58:01,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 12:58:09,261 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 12:58:09,264 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:58:09,264 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:58:09,264 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:58:09,264 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:58:09,264 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:58:09,264 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:58:09,264 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:58:09,264 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:58:09,264 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-12-08 12:58:09,264 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:58:09,264 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:58:09,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:58:09,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:58:09,402 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:58:09,402 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:58:09,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:58:09,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:58:09,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:58:09,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:58:09,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,405 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:58:09,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,405 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:09,405 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:09,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:09,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:09,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,408 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:58:09,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,408 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:09,409 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:09,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,411 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:09,411 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:09,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,411 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:58:09,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,412 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:09,412 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:09,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:58:09,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,415 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:09,415 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:09,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,416 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:58:09,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,416 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:09,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:09,417 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:09,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,421 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:09,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:58:09,421 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:58:09,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,422 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 12:58:09,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,422 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,422 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:58:09,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,422 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:09,423 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:09,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,427 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 12:58:09,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:09,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:09,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,428 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 12:58:09,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,429 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:09,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,429 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:09,430 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:09,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:09,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,436 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:58:09,436 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:58:09,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,437 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 12:58:09,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,437 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,438 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:09,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,438 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:09,438 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:09,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,441 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,441 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:58:09,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:58:09,442 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:58:09,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,443 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 12:58:09,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,444 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:09,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,444 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:58:09,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:58:09,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:58:09,449 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:58:09,449 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 12:58:09,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:58:09,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:58:09,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:58:09,450 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 12:58:09,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:58:09,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:58:09,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:58:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-08 12:58:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-08 12:58:09,453 INFO L87 Difference]: Start difference. First operand 425 states and 449 transitions. cyclomatic complexity: 28 Second operand 16 states. [2018-12-08 12:58:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:58:09,814 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2018-12-08 12:58:09,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 12:58:09,814 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 366 transitions. [2018-12-08 12:58:09,815 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:58:09,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 0 states and 0 transitions. [2018-12-08 12:58:09,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 12:58:09,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 12:58:09,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 12:58:09,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:58:09,815 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:58:09,815 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:58:09,815 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:58:09,816 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-12-08 12:58:09,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 12:58:09,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:58:09,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 12:58:09,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 12:58:09 BoogieIcfgContainer [2018-12-08 12:58:09,820 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 12:58:09,820 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:58:09,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:58:09,820 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:58:09,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:56:49" (3/4) ... [2018-12-08 12:58:09,824 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 12:58:09,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:58:09,825 INFO L168 Benchmark]: Toolchain (without parser) took 80731.98 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 299.9 MB). Free memory was 961.3 MB in the beginning and 745.8 MB in the end (delta: 215.5 MB). Peak memory consumption was 515.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:58:09,825 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:58:09,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 147.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 945.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 12:58:09,826 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-08 12:58:09,826 INFO L168 Benchmark]: Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 12:58:09,827 INFO L168 Benchmark]: RCFGBuilder took 225.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:58:09,827 INFO L168 Benchmark]: BuchiAutomizer took 80274.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 201.3 MB). Free memory was 1.1 GB in the beginning and 745.8 MB in the end (delta: 325.2 MB). Peak memory consumption was 526.6 MB. Max. memory is 11.5 GB. [2018-12-08 12:58:09,827 INFO L168 Benchmark]: Witness Printer took 3.90 ms. Allocated memory is still 1.3 GB. Free memory is still 745.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:58:09,830 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 147.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.3 MB in the beginning and 945.2 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 56.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 945.2 MB in the beginning and 1.1 GB in the end (delta: -148.0 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 80274.71 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 201.3 MB). Free memory was 1.1 GB in the beginning and 745.8 MB in the end (delta: 325.2 MB). Peak memory consumption was 526.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.90 ms. Allocated memory is still 1.3 GB. Free memory is still 745.8 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 25 terminating modules (25 trivial, 0 deterministic, 0 nondeterministic). 25 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 80.2s and 26 iterations. TraceHistogramMax:7. Analysis of lassos took 42.1s. Construction of modules took 30.5s. Büchi inclusion checks took 7.0s. Highest rank in rank-based complementation 0. Minimization of det autom 25. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 5831 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1624 states and ocurred in iteration 18. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1047 SDtfs, 4961 SDslu, 2034 SDs, 0 SdLazy, 8995 SolverSat, 816 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 30.5s Time LassoAnalysisResults: nont0 unkn0 SFLI15 SFLT0 conc4 concLT0 SILN0 SILU2 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf98 lsp64 ukn100 mio100 lsp100 div580 bol100 ite100 ukn100 eq143 hnf42 smp84 dnf100 smp100 tf102 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 9ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 33.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...