./Ultimate.py --spec ../../sv-benchmarks/c/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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/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_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/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-5842f4b [2018-11-18 15:41:01,358 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 15:41:01,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 15:41:01,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 15:41:01,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 15:41:01,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 15:41:01,369 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 15:41:01,370 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 15:41:01,371 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 15:41:01,372 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 15:41:01,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 15:41:01,373 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 15:41:01,373 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 15:41:01,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 15:41:01,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 15:41:01,375 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 15:41:01,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 15:41:01,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 15:41:01,378 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 15:41:01,379 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 15:41:01,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 15:41:01,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 15:41:01,383 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 15:41:01,383 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 15:41:01,383 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 15:41:01,384 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 15:41:01,384 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 15:41:01,385 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 15:41:01,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 15:41:01,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 15:41:01,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 15:41:01,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 15:41:01,387 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 15:41:01,387 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 15:41:01,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 15:41:01,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 15:41:01,389 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 15:41:01,400 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 15:41:01,400 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 15:41:01,401 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 15:41:01,401 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 15:41:01,401 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 15:41:01,401 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 15:41:01,402 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 15:41:01,402 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 15:41:01,402 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 15:41:01,402 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 15:41:01,402 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 15:41:01,402 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 15:41:01,402 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 15:41:01,402 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 15:41:01,403 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 15:41:01,404 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 15:41:01,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 15:41:01,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 15:41:01,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 15:41:01,404 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 15:41:01,404 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 15:41:01,404 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 15:41:01,404 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 15:41:01,405 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 15:41:01,405 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_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 889a23428ce9b0e3800ffce916f37e53fe302b49 [2018-11-18 15:41:01,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 15:41:01,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 15:41:01,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 15:41:01,438 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 15:41:01,438 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 15:41:01,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-18 15:41:01,474 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/data/8a0385664/ab575e9d168b462a9ff01cf359b05772/FLAGa9e67f2c9 [2018-11-18 15:41:01,796 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 15:41:01,796 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-18 15:41:01,802 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/data/8a0385664/ab575e9d168b462a9ff01cf359b05772/FLAGa9e67f2c9 [2018-11-18 15:41:01,811 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/data/8a0385664/ab575e9d168b462a9ff01cf359b05772 [2018-11-18 15:41:01,814 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 15:41:01,815 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 15:41:01,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 15:41:01,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 15:41:01,818 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 15:41:01,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:41:01" (1/1) ... [2018-11-18 15:41:01,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b4915a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:01, skipping insertion in model container [2018-11-18 15:41:01,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 03:41:01" (1/1) ... [2018-11-18 15:41:01,827 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 15:41:01,844 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 15:41:01,978 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:41:01,980 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 15:41:02,002 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 15:41:02,012 INFO L195 MainTranslator]: Completed translation [2018-11-18 15:41:02,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02 WrapperNode [2018-11-18 15:41:02,012 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 15:41:02,013 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 15:41:02,013 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 15:41:02,013 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 15:41:02,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,023 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 15:41:02,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 15:41:02,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 15:41:02,076 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 15:41:02,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... [2018-11-18 15:41:02,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 15:41:02,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 15:41:02,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 15:41:02,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 15:41:02,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:02,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 15:41:02,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 15:41:02,333 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 15:41:02,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:41:02 BoogieIcfgContainer [2018-11-18 15:41:02,334 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 15:41:02,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 15:41:02,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 15:41:02,337 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 15:41:02,337 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:41:02,337 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 03:41:01" (1/3) ... [2018-11-18 15:41:02,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d50727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:41:02, skipping insertion in model container [2018-11-18 15:41:02,338 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:41:02,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 03:41:02" (2/3) ... [2018-11-18 15:41:02,338 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d50727a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 03:41:02, skipping insertion in model container [2018-11-18 15:41:02,339 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 15:41:02,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:41:02" (3/3) ... [2018-11-18 15:41:02,340 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-18 15:41:02,374 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 15:41:02,374 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 15:41:02,375 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 15:41:02,375 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 15:41:02,375 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 15:41:02,375 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 15:41:02,375 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 15:41:02,375 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 15:41:02,375 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 15:41:02,385 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 15:41:02,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 15:41:02,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:02,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:02,406 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:41:02,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:02,406 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 15:41:02,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states. [2018-11-18 15:41:02,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2018-11-18 15:41:02,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:02,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:02,410 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 15:41:02,410 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:02,415 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~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;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L40true assume !(0 == mp_add_~a3~0 % 256); 8#L40-1true mp_add_~nb~0 := 4; 31#L50true assume !(0 == mp_add_~b3~0 % 256); 28#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-3true [2018-11-18 15:41:02,415 INFO L796 eck$LassoCheckResult]: Loop: 23#L61-3true assume true; 29#L61-1true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 35#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26#L70true assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14#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; 24#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; 33#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23#L61-3true [2018-11-18 15:41:02,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:02,419 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2018-11-18 15:41:02,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:02,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:02,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:02,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:02,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:02,523 INFO L82 PathProgramCache]: Analyzing trace with hash -486457291, now seen corresponding path program 1 times [2018-11-18 15:41:02,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:02,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:02,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:02,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:02,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:02,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:02,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:02,586 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:02,601 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 3 states. [2018-11-18 15:41:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:02,813 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2018-11-18 15:41:02,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:02,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 98 transitions. [2018-11-18 15:41:02,818 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 43 [2018-11-18 15:41:02,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 60 states and 90 transitions. [2018-11-18 15:41:02,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-18 15:41:02,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-18 15:41:02,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 90 transitions. [2018-11-18 15:41:02,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:02,824 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 90 transitions. [2018-11-18 15:41:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 90 transitions. [2018-11-18 15:41:02,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-18 15:41:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-18 15:41:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 88 transitions. [2018-11-18 15:41:02,852 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-18 15:41:02,852 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 88 transitions. [2018-11-18 15:41:02,852 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 15:41:02,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 88 transitions. [2018-11-18 15:41:02,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 15:41:02,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:02,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:02,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:02,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:02,855 INFO L794 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 131#L40 assume !(0 == mp_add_~a3~0 % 256); 128#L40-1 mp_add_~nb~0 := 4; 129#L50 assume !(0 == mp_add_~b3~0 % 256); 140#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 147#L61-3 assume true; 148#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 151#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 145#L64-1 [2018-11-18 15:41:02,855 INFO L796 eck$LassoCheckResult]: Loop: 145#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 134#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 138#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 120#L80-1 assume !(1 == mp_add_~i~0 % 256); 121#L81-1 assume !(2 == mp_add_~i~0 % 256); 126#L82-1 assume !(3 == mp_add_~i~0 % 256); 127#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 153#L61-3 assume true; 170#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 167#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 168#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 136#L65-2 assume !(1 == mp_add_~i~0 % 256); 137#L66-1 assume !(2 == mp_add_~i~0 % 256); 144#L67-1 assume !(3 == mp_add_~i~0 % 256); 145#L64-1 [2018-11-18 15:41:02,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:02,855 INFO L82 PathProgramCache]: Analyzing trace with hash -685617854, now seen corresponding path program 1 times [2018-11-18 15:41:02,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:02,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:02,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:02,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:03,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:03,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:41:03,017 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:03,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:03,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 1 times [2018-11-18 15:41:03,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:03,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:03,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:03,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:03,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:03,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:41:03,080 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:03,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:03,081 INFO L87 Difference]: Start difference. First operand 58 states and 88 transitions. cyclomatic complexity: 32 Second operand 5 states. [2018-11-18 15:41:03,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:03,341 INFO L93 Difference]: Finished difference Result 153 states and 226 transitions. [2018-11-18 15:41:03,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:03,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 226 transitions. [2018-11-18 15:41:03,344 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-18 15:41:03,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 153 states and 226 transitions. [2018-11-18 15:41:03,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 153 [2018-11-18 15:41:03,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 153 [2018-11-18 15:41:03,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 153 states and 226 transitions. [2018-11-18 15:41:03,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:03,346 INFO L705 BuchiCegarLoop]: Abstraction has 153 states and 226 transitions. [2018-11-18 15:41:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states and 226 transitions. [2018-11-18 15:41:03,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2018-11-18 15:41:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 15:41:03,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 119 transitions. [2018-11-18 15:41:03,350 INFO L728 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-18 15:41:03,350 INFO L608 BuchiCegarLoop]: Abstraction has 84 states and 119 transitions. [2018-11-18 15:41:03,350 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 15:41:03,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 119 transitions. [2018-11-18 15:41:03,351 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-18 15:41:03,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:03,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:03,352 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:03,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:03,352 INFO L794 eck$LassoCheckResult]: Stem: 389#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 363#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 359#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 360#L42 assume !(0 == mp_add_~a2~0 % 256); 386#L40-1 mp_add_~nb~0 := 4; 383#L50 assume !(0 == mp_add_~b3~0 % 256); 366#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 401#L61-3 assume true; 399#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 400#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 385#L64-1 [2018-11-18 15:41:03,353 INFO L796 eck$LassoCheckResult]: Loop: 385#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 358#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; 364#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 345#L80-1 assume !(1 == mp_add_~i~0 % 256); 346#L81-1 assume !(2 == mp_add_~i~0 % 256); 351#L82-1 assume !(3 == mp_add_~i~0 % 256); 352#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 375#L61-3 assume true; 376#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 388#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 368#L65-2 assume !(1 == mp_add_~i~0 % 256); 391#L66-1 assume !(2 == mp_add_~i~0 % 256); 392#L67-1 assume !(3 == mp_add_~i~0 % 256); 385#L64-1 [2018-11-18 15:41:03,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 959922624, now seen corresponding path program 1 times [2018-11-18 15:41:03,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:03,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:03,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:03,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:03,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:03,420 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:03,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1349007875, now seen corresponding path program 2 times [2018-11-18 15:41:03,421 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:03,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:03,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:03,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:03,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:03,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:41:03,478 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:03,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:41:03,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:41:03,479 INFO L87 Difference]: Start difference. First operand 84 states and 119 transitions. cyclomatic complexity: 37 Second operand 6 states. [2018-11-18 15:41:03,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:03,830 INFO L93 Difference]: Finished difference Result 251 states and 375 transitions. [2018-11-18 15:41:03,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 15:41:03,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 375 transitions. [2018-11-18 15:41:03,833 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 197 [2018-11-18 15:41:03,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 251 states and 375 transitions. [2018-11-18 15:41:03,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 251 [2018-11-18 15:41:03,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 251 [2018-11-18 15:41:03,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 251 states and 375 transitions. [2018-11-18 15:41:03,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:03,836 INFO L705 BuchiCegarLoop]: Abstraction has 251 states and 375 transitions. [2018-11-18 15:41:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states and 375 transitions. [2018-11-18 15:41:03,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 176. [2018-11-18 15:41:03,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 15:41:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 268 transitions. [2018-11-18 15:41:03,847 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 268 transitions. [2018-11-18 15:41:03,847 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 268 transitions. [2018-11-18 15:41:03,847 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 15:41:03,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 268 transitions. [2018-11-18 15:41:03,848 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 141 [2018-11-18 15:41:03,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:03,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:03,849 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:03,849 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:03,849 INFO L794 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 715#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 710#L40 assume !(0 == mp_add_~a3~0 % 256); 711#L40-1 mp_add_~nb~0 := 4; 735#L50 assume !(0 == mp_add_~b3~0 % 256); 718#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 823#L61-3 assume true; 822#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 821#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 820#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 790#L65-2 [2018-11-18 15:41:03,850 INFO L796 eck$LassoCheckResult]: Loop: 790#L65-2 assume !(1 == mp_add_~i~0 % 256); 819#L66-1 assume !(2 == mp_add_~i~0 % 256); 818#L67-1 assume !(3 == mp_add_~i~0 % 256); 815#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 813#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; 812#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 779#L80-1 assume !(1 == mp_add_~i~0 % 256); 777#L81-1 assume !(2 == mp_add_~i~0 % 256); 798#L82-1 assume !(3 == mp_add_~i~0 % 256); 797#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 796#L61-3 assume true; 794#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 791#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 786#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 790#L65-2 [2018-11-18 15:41:03,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 1 times [2018-11-18 15:41:03,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:03,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:03,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:03,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:03,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1892987967, now seen corresponding path program 3 times [2018-11-18 15:41:03,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:03,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:03,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:03,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:03,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:03,935 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:41:03,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:41:03,935 INFO L87 Difference]: Start difference. First operand 176 states and 268 transitions. cyclomatic complexity: 97 Second operand 4 states. [2018-11-18 15:41:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:04,052 INFO L93 Difference]: Finished difference Result 274 states and 419 transitions. [2018-11-18 15:41:04,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:41:04,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 419 transitions. [2018-11-18 15:41:04,054 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 239 [2018-11-18 15:41:04,056 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 274 states and 419 transitions. [2018-11-18 15:41:04,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 274 [2018-11-18 15:41:04,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 274 [2018-11-18 15:41:04,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 419 transitions. [2018-11-18 15:41:04,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:04,058 INFO L705 BuchiCegarLoop]: Abstraction has 274 states and 419 transitions. [2018-11-18 15:41:04,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 419 transitions. [2018-11-18 15:41:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 245. [2018-11-18 15:41:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 15:41:04,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 371 transitions. [2018-11-18 15:41:04,066 INFO L728 BuchiCegarLoop]: Abstraction has 245 states and 371 transitions. [2018-11-18 15:41:04,066 INFO L608 BuchiCegarLoop]: Abstraction has 245 states and 371 transitions. [2018-11-18 15:41:04,066 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 15:41:04,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 245 states and 371 transitions. [2018-11-18 15:41:04,067 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 210 [2018-11-18 15:41:04,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:04,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:04,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,068 INFO L794 eck$LassoCheckResult]: Stem: 1202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1167#L40 assume !(0 == mp_add_~a3~0 % 256); 1163#L40-1 mp_add_~nb~0 := 4; 1164#L50 assume !(0 == mp_add_~b3~0 % 256); 1188#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1189#L61-3 assume true; 1190#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1191#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1201#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1169#L65-2 [2018-11-18 15:41:04,068 INFO L796 eck$LassoCheckResult]: Loop: 1169#L65-2 assume !(1 == mp_add_~i~0 % 256); 1170#L66-1 assume !(2 == mp_add_~i~0 % 256); 1394#L67-1 assume !(3 == mp_add_~i~0 % 256); 1389#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1386#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; 1379#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1378#L80-1 assume !(1 == mp_add_~i~0 % 256); 1377#L81-1 assume !(2 == mp_add_~i~0 % 256); 1376#L82-1 assume !(3 == mp_add_~i~0 % 256); 1285#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1286#L61-3 assume true; 1281#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1282#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1278#L65 assume !(0 == mp_add_~i~0 % 256); 1279#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; 1205#L66-1 assume !(2 == mp_add_~i~0 % 256); 1179#L67-1 assume !(3 == mp_add_~i~0 % 256); 1180#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1166#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; 1187#L76-1 assume !(0 == mp_add_~i~0 % 256); 1384#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1184#L81-1 assume !(2 == mp_add_~i~0 % 256); 1185#L82-1 assume !(3 == mp_add_~i~0 % 256); 1287#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1283#L61-3 assume true; 1284#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1280#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1269#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1169#L65-2 [2018-11-18 15:41:04,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,068 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 2 times [2018-11-18 15:41:04,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,087 INFO L82 PathProgramCache]: Analyzing trace with hash 826534277, now seen corresponding path program 1 times [2018-11-18 15:41:04,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:04,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 15:41:04,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:04,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:04,140 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:04,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:41:04,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:41:04,140 INFO L87 Difference]: Start difference. First operand 245 states and 371 transitions. cyclomatic complexity: 131 Second operand 4 states. [2018-11-18 15:41:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:04,289 INFO L93 Difference]: Finished difference Result 431 states and 634 transitions. [2018-11-18 15:41:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:04,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 431 states and 634 transitions. [2018-11-18 15:41:04,293 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 396 [2018-11-18 15:41:04,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 431 states to 431 states and 634 transitions. [2018-11-18 15:41:04,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 431 [2018-11-18 15:41:04,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2018-11-18 15:41:04,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 431 states and 634 transitions. [2018-11-18 15:41:04,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:04,298 INFO L705 BuchiCegarLoop]: Abstraction has 431 states and 634 transitions. [2018-11-18 15:41:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states and 634 transitions. [2018-11-18 15:41:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 270. [2018-11-18 15:41:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-18 15:41:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 409 transitions. [2018-11-18 15:41:04,305 INFO L728 BuchiCegarLoop]: Abstraction has 270 states and 409 transitions. [2018-11-18 15:41:04,305 INFO L608 BuchiCegarLoop]: Abstraction has 270 states and 409 transitions. [2018-11-18 15:41:04,306 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 15:41:04,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 409 transitions. [2018-11-18 15:41:04,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 235 [2018-11-18 15:41:04,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:04,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:04,308 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,308 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] [2018-11-18 15:41:04,308 INFO L794 eck$LassoCheckResult]: Stem: 1883#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1856#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1851#L40 assume !(0 == mp_add_~a3~0 % 256); 1852#L40-1 mp_add_~nb~0 := 4; 1876#L50 assume !(0 == mp_add_~b3~0 % 256); 1862#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1989#L61-3 assume true; 1988#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1987#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1986#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1940#L65-2 [2018-11-18 15:41:04,308 INFO L796 eck$LassoCheckResult]: Loop: 1940#L65-2 assume !(1 == mp_add_~i~0 % 256); 1985#L66-1 assume !(2 == mp_add_~i~0 % 256); 1984#L67-1 assume !(3 == mp_add_~i~0 % 256); 1981#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1979#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; 1978#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1921#L80-1 assume !(1 == mp_add_~i~0 % 256); 1918#L81-1 assume !(2 == mp_add_~i~0 % 256); 1915#L82-1 assume !(3 == mp_add_~i~0 % 256); 1916#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1975#L61-3 assume true; 1974#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1973#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1972#L65 assume !(0 == mp_add_~i~0 % 256); 1971#L65-2 assume !(1 == mp_add_~i~0 % 256); 1970#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; 1966#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; 1961#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1956#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; 1952#L76-1 assume !(0 == mp_add_~i~0 % 256); 1950#L80-1 assume !(1 == mp_add_~i~0 % 256); 1949#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1948#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 1945#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1944#L61-3 assume true; 1943#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1942#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1939#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1940#L65-2 [2018-11-18 15:41:04,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 3 times [2018-11-18 15:41:04,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:04,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1797412609, now seen corresponding path program 1 times [2018-11-18 15:41:04,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:04,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:41:04,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:04,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:04,356 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:04,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:04,356 INFO L87 Difference]: Start difference. First operand 270 states and 409 transitions. cyclomatic complexity: 143 Second operand 3 states. [2018-11-18 15:41:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:04,410 INFO L93 Difference]: Finished difference Result 322 states and 471 transitions. [2018-11-18 15:41:04,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:04,411 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 322 states and 471 transitions. [2018-11-18 15:41:04,412 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 287 [2018-11-18 15:41:04,414 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 322 states to 322 states and 471 transitions. [2018-11-18 15:41:04,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 322 [2018-11-18 15:41:04,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 322 [2018-11-18 15:41:04,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 322 states and 471 transitions. [2018-11-18 15:41:04,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:04,415 INFO L705 BuchiCegarLoop]: Abstraction has 322 states and 471 transitions. [2018-11-18 15:41:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states and 471 transitions. [2018-11-18 15:41:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 299. [2018-11-18 15:41:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-11-18 15:41:04,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 443 transitions. [2018-11-18 15:41:04,424 INFO L728 BuchiCegarLoop]: Abstraction has 299 states and 443 transitions. [2018-11-18 15:41:04,424 INFO L608 BuchiCegarLoop]: Abstraction has 299 states and 443 transitions. [2018-11-18 15:41:04,424 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 15:41:04,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 299 states and 443 transitions. [2018-11-18 15:41:04,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 264 [2018-11-18 15:41:04,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:04,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:04,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,427 INFO L794 eck$LassoCheckResult]: Stem: 2477#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2454#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2449#L40 assume !(0 == mp_add_~a3~0 % 256); 2450#L40-1 mp_add_~nb~0 := 4; 2733#L50 assume !(0 == mp_add_~b3~0 % 256); 2730#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2729#L61-3 assume true; 2728#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2727#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2725#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2674#L65-2 [2018-11-18 15:41:04,427 INFO L796 eck$LassoCheckResult]: Loop: 2674#L65-2 assume !(1 == mp_add_~i~0 % 256); 2724#L66-1 assume !(2 == mp_add_~i~0 % 256); 2723#L67-1 assume !(3 == mp_add_~i~0 % 256); 2720#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2692#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; 2693#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2657#L80-1 assume !(1 == mp_add_~i~0 % 256); 2656#L81-1 assume !(2 == mp_add_~i~0 % 256); 2649#L82-1 assume !(3 == mp_add_~i~0 % 256); 2650#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2718#L61-3 assume true; 2717#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2712#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2711#L65 assume !(0 == mp_add_~i~0 % 256); 2710#L65-2 assume !(1 == mp_add_~i~0 % 256); 2707#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; 2463#L67-1 assume !(3 == mp_add_~i~0 % 256); 2464#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2453#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; 2457#L76-1 assume !(0 == mp_add_~i~0 % 256); 2438#L80-1 assume !(1 == mp_add_~i~0 % 256); 2439#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 2444#L82-1 assume !(3 == mp_add_~i~0 % 256); 2445#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2585#L61-3 assume true; 2495#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2496#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2673#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2674#L65-2 [2018-11-18 15:41:04,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 4 times [2018-11-18 15:41:04,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:04,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2112836349, now seen corresponding path program 1 times [2018-11-18 15:41:04,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:04,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:04,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 15:41:04,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:04,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:41:04,512 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:04,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:04,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:04,512 INFO L87 Difference]: Start difference. First operand 299 states and 443 transitions. cyclomatic complexity: 148 Second operand 5 states. [2018-11-18 15:41:04,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:04,674 INFO L93 Difference]: Finished difference Result 455 states and 660 transitions. [2018-11-18 15:41:04,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:41:04,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455 states and 660 transitions. [2018-11-18 15:41:04,676 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 414 [2018-11-18 15:41:04,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455 states to 449 states and 654 transitions. [2018-11-18 15:41:04,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2018-11-18 15:41:04,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2018-11-18 15:41:04,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 449 states and 654 transitions. [2018-11-18 15:41:04,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:04,679 INFO L705 BuchiCegarLoop]: Abstraction has 449 states and 654 transitions. [2018-11-18 15:41:04,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states and 654 transitions. [2018-11-18 15:41:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 300. [2018-11-18 15:41:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-18 15:41:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 446 transitions. [2018-11-18 15:41:04,684 INFO L728 BuchiCegarLoop]: Abstraction has 300 states and 446 transitions. [2018-11-18 15:41:04,684 INFO L608 BuchiCegarLoop]: Abstraction has 300 states and 446 transitions. [2018-11-18 15:41:04,684 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 15:41:04,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 446 transitions. [2018-11-18 15:41:04,685 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 265 [2018-11-18 15:41:04,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:04,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:04,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,687 INFO L794 eck$LassoCheckResult]: Stem: 3249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3225#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3220#L40 assume !(0 == mp_add_~a3~0 % 256); 3216#L40-1 mp_add_~nb~0 := 4; 3217#L50 assume !(0 == mp_add_~b3~0 % 256); 3241#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3242#L61-3 assume true; 3459#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3458#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3456#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3454#L65-2 [2018-11-18 15:41:04,687 INFO L796 eck$LassoCheckResult]: Loop: 3454#L65-2 assume !(1 == mp_add_~i~0 % 256); 3451#L66-1 assume !(2 == mp_add_~i~0 % 256); 3448#L67-1 assume !(3 == mp_add_~i~0 % 256); 3444#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3438#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; 3435#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3433#L80-1 assume !(1 == mp_add_~i~0 % 256); 3239#L81-1 assume !(2 == mp_add_~i~0 % 256); 3212#L82-1 assume !(3 == mp_add_~i~0 % 256); 3213#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3237#L61-3 assume true; 3238#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3243#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3230#L65 assume !(0 == mp_add_~i~0 % 256); 3222#L65-2 assume !(1 == mp_add_~i~0 % 256); 3223#L66-1 assume !(2 == mp_add_~i~0 % 256); 3478#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; 3472#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3395#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; 3295#L76-1 assume !(0 == mp_add_~i~0 % 256); 3282#L80-1 assume !(1 == mp_add_~i~0 % 256); 3283#L81-1 assume !(2 == mp_add_~i~0 % 256); 3277#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 3272#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3270#L61-3 assume true; 3261#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3262#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3455#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3454#L65-2 [2018-11-18 15:41:04,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,687 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 5 times [2018-11-18 15:41:04,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:04,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1309353339, now seen corresponding path program 1 times [2018-11-18 15:41:04,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:04,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 15:41:04,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:04,749 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:04,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:41:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:41:04,749 INFO L87 Difference]: Start difference. First operand 300 states and 446 transitions. cyclomatic complexity: 150 Second operand 4 states. [2018-11-18 15:41:04,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:04,856 INFO L93 Difference]: Finished difference Result 512 states and 781 transitions. [2018-11-18 15:41:04,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:04,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 512 states and 781 transitions. [2018-11-18 15:41:04,858 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 466 [2018-11-18 15:41:04,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 512 states to 512 states and 781 transitions. [2018-11-18 15:41:04,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 512 [2018-11-18 15:41:04,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 512 [2018-11-18 15:41:04,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 512 states and 781 transitions. [2018-11-18 15:41:04,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:04,862 INFO L705 BuchiCegarLoop]: Abstraction has 512 states and 781 transitions. [2018-11-18 15:41:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states and 781 transitions. [2018-11-18 15:41:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 409. [2018-11-18 15:41:04,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-11-18 15:41:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 627 transitions. [2018-11-18 15:41:04,869 INFO L728 BuchiCegarLoop]: Abstraction has 409 states and 627 transitions. [2018-11-18 15:41:04,869 INFO L608 BuchiCegarLoop]: Abstraction has 409 states and 627 transitions. [2018-11-18 15:41:04,870 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 15:41:04,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 409 states and 627 transitions. [2018-11-18 15:41:04,871 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 370 [2018-11-18 15:41:04,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:04,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:04,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:04,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 15:41:04,872 INFO L794 eck$LassoCheckResult]: Stem: 4078#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4044#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4039#L40 assume !(0 == mp_add_~a3~0 % 256); 4040#L40-1 mp_add_~nb~0 := 4; 4071#L50 assume !(0 == mp_add_~b3~0 % 256); 4050#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4214#L61-3 assume true; 4213#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4212#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4211#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4146#L65-2 [2018-11-18 15:41:04,873 INFO L796 eck$LassoCheckResult]: Loop: 4146#L65-2 assume !(1 == mp_add_~i~0 % 256); 4209#L66-1 assume !(2 == mp_add_~i~0 % 256); 4208#L67-1 assume !(3 == mp_add_~i~0 % 256); 4206#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4205#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; 4200#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4113#L80-1 assume !(1 == mp_add_~i~0 % 256); 4111#L81-1 assume !(2 == mp_add_~i~0 % 256); 4109#L82-1 assume !(3 == mp_add_~i~0 % 256); 4110#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4197#L61-3 assume true; 4196#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4195#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4188#L65 assume !(0 == mp_add_~i~0 % 256); 4191#L65-2 assume !(1 == mp_add_~i~0 % 256); 4189#L66-1 assume !(2 == mp_add_~i~0 % 256); 4185#L67-1 assume !(3 == mp_add_~i~0 % 256); 4180#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4177#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; 4170#L76-1 assume !(0 == mp_add_~i~0 % 256); 4164#L80-1 assume !(1 == mp_add_~i~0 % 256); 4159#L81-1 assume !(2 == mp_add_~i~0 % 256); 4157#L82-1 assume !(3 == mp_add_~i~0 % 256); 4156#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4154#L61-3 assume true; 4152#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4149#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4145#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4146#L65-2 [2018-11-18 15:41:04,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,873 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 6 times [2018-11-18 15:41:04,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:04,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:04,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:04,888 INFO L82 PathProgramCache]: Analyzing trace with hash -993929599, now seen corresponding path program 1 times [2018-11-18 15:41:04,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:04,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:04,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:04,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:04,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 15:41:04,931 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:04,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 15:41:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 15:41:04,931 INFO L87 Difference]: Start difference. First operand 409 states and 627 transitions. cyclomatic complexity: 222 Second operand 4 states. [2018-11-18 15:41:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:04,985 INFO L93 Difference]: Finished difference Result 701 states and 1065 transitions. [2018-11-18 15:41:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 15:41:04,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 701 states and 1065 transitions. [2018-11-18 15:41:04,991 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 658 [2018-11-18 15:41:04,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 701 states to 701 states and 1065 transitions. [2018-11-18 15:41:04,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 701 [2018-11-18 15:41:04,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 701 [2018-11-18 15:41:04,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 701 states and 1065 transitions. [2018-11-18 15:41:04,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:04,995 INFO L705 BuchiCegarLoop]: Abstraction has 701 states and 1065 transitions. [2018-11-18 15:41:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states and 1065 transitions. [2018-11-18 15:41:05,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 623. [2018-11-18 15:41:05,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-11-18 15:41:05,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 958 transitions. [2018-11-18 15:41:05,002 INFO L728 BuchiCegarLoop]: Abstraction has 623 states and 958 transitions. [2018-11-18 15:41:05,002 INFO L608 BuchiCegarLoop]: Abstraction has 623 states and 958 transitions. [2018-11-18 15:41:05,002 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 15:41:05,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 623 states and 958 transitions. [2018-11-18 15:41:05,003 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 584 [2018-11-18 15:41:05,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:05,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:05,004 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:05,004 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 15:41:05,004 INFO L794 eck$LassoCheckResult]: Stem: 5191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5161#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 5159#L40 assume !(0 == mp_add_~a3~0 % 256); 5155#L40-1 mp_add_~nb~0 := 4; 5156#L50 assume !(0 == mp_add_~b3~0 % 256); 5180#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5181#L61-3 assume true; 5685#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5684#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5680#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5679#L65-2 [2018-11-18 15:41:05,004 INFO L796 eck$LassoCheckResult]: Loop: 5679#L65-2 assume !(1 == mp_add_~i~0 % 256); 5195#L66-1 assume !(2 == mp_add_~i~0 % 256); 5196#L67-1 assume !(3 == mp_add_~i~0 % 256); 5186#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5188#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5165#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5145#L80-1 assume !(1 == mp_add_~i~0 % 256); 5146#L81-1 assume !(2 == mp_add_~i~0 % 256); 5151#L82-1 assume !(3 == mp_add_~i~0 % 256); 5152#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5175#L61-3 assume true; 5176#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5182#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5192#L65 assume !(0 == mp_add_~i~0 % 256); 5162#L65-2 assume !(1 == mp_add_~i~0 % 256); 5163#L66-1 assume !(2 == mp_add_~i~0 % 256); 5557#L67-1 assume !(3 == mp_add_~i~0 % 256); 5762#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5699#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5264#L76-1 assume !(0 == mp_add_~i~0 % 256); 5225#L80-1 assume !(1 == mp_add_~i~0 % 256); 5223#L81-1 assume !(2 == mp_add_~i~0 % 256); 5220#L82-1 assume !(3 == mp_add_~i~0 % 256); 5222#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5217#L61-3 assume true; 5215#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5216#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5683#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5679#L65-2 [2018-11-18 15:41:05,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:05,005 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 7 times [2018-11-18 15:41:05,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:05,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:05,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:05,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:05,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1520970115, now seen corresponding path program 1 times [2018-11-18 15:41:05,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:05,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:05,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 15:41:05,090 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:05,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 15:41:05,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 15:41:05,090 INFO L87 Difference]: Start difference. First operand 623 states and 958 transitions. cyclomatic complexity: 339 Second operand 5 states. [2018-11-18 15:41:05,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:05,218 INFO L93 Difference]: Finished difference Result 796 states and 1149 transitions. [2018-11-18 15:41:05,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 15:41:05,220 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 796 states and 1149 transitions. [2018-11-18 15:41:05,222 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 686 [2018-11-18 15:41:05,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 796 states to 796 states and 1149 transitions. [2018-11-18 15:41:05,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 796 [2018-11-18 15:41:05,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 796 [2018-11-18 15:41:05,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 796 states and 1149 transitions. [2018-11-18 15:41:05,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:05,226 INFO L705 BuchiCegarLoop]: Abstraction has 796 states and 1149 transitions. [2018-11-18 15:41:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states and 1149 transitions. [2018-11-18 15:41:05,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 646. [2018-11-18 15:41:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-11-18 15:41:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 985 transitions. [2018-11-18 15:41:05,233 INFO L728 BuchiCegarLoop]: Abstraction has 646 states and 985 transitions. [2018-11-18 15:41:05,233 INFO L608 BuchiCegarLoop]: Abstraction has 646 states and 985 transitions. [2018-11-18 15:41:05,233 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 15:41:05,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 646 states and 985 transitions. [2018-11-18 15:41:05,235 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 600 [2018-11-18 15:41:05,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:05,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:05,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:05,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 15:41:05,236 INFO L794 eck$LassoCheckResult]: Stem: 6620#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 6593#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6589#L40 assume !(0 == mp_add_~a3~0 % 256); 6585#L40-1 mp_add_~nb~0 := 4; 6586#L50 assume !(0 == mp_add_~b3~0 % 256); 6608#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6609#L61-3 assume true; 7180#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7179#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7178#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7120#L65-2 [2018-11-18 15:41:05,236 INFO L796 eck$LassoCheckResult]: Loop: 7120#L65-2 assume !(1 == mp_add_~i~0 % 256); 7169#L66-1 assume !(2 == mp_add_~i~0 % 256); 7167#L67-1 assume !(3 == mp_add_~i~0 % 256); 6616#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6588#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; 6594#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6575#L80-1 assume !(1 == mp_add_~i~0 % 256); 6576#L81-1 assume !(2 == mp_add_~i~0 % 256); 6581#L82-1 assume !(3 == mp_add_~i~0 % 256); 6582#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6604#L61-3 assume true; 6605#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6610#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6597#L65 assume !(0 == mp_add_~i~0 % 256); 6591#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; 6592#L66-1 assume !(2 == mp_add_~i~0 % 256); 6600#L67-1 assume !(3 == mp_add_~i~0 % 256); 6601#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7140#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; 7197#L76-1 assume !(0 == mp_add_~i~0 % 256); 7170#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7132#L81-1 assume !(2 == mp_add_~i~0 % 256); 7168#L82-1 assume !(3 == mp_add_~i~0 % 256); 7166#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7165#L61-3 assume true; 7164#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7163#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7149#L65 assume !(0 == mp_add_~i~0 % 256); 7155#L65-2 assume !(1 == mp_add_~i~0 % 256); 7156#L66-1 assume !(2 == mp_add_~i~0 % 256); 7208#L67-1 assume !(3 == mp_add_~i~0 % 256); 7150#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6935#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6907#L76-1 assume !(0 == mp_add_~i~0 % 256); 6665#L80-1 assume !(1 == mp_add_~i~0 % 256); 6667#L81-1 assume !(2 == mp_add_~i~0 % 256); 6660#L82-1 assume !(3 == mp_add_~i~0 % 256); 6658#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6659#L61-3 assume true; 6644#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6645#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7119#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7120#L65-2 [2018-11-18 15:41:05,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:05,236 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 8 times [2018-11-18 15:41:05,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:05,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:05,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:05,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:05,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash 2122464133, now seen corresponding path program 1 times [2018-11-18 15:41:05,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:05,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:05,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:05,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:05,374 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 15:41:05,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:05,374 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:05,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:05,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:05,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-18 15:41:05,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:05,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2018-11-18 15:41:05,562 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:05,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:41:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:41:05,562 INFO L87 Difference]: Start difference. First operand 646 states and 985 transitions. cyclomatic complexity: 343 Second operand 8 states. [2018-11-18 15:41:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:05,889 INFO L93 Difference]: Finished difference Result 887 states and 1236 transitions. [2018-11-18 15:41:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:41:05,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 887 states and 1236 transitions. [2018-11-18 15:41:05,895 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 781 [2018-11-18 15:41:05,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 887 states to 887 states and 1236 transitions. [2018-11-18 15:41:05,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 887 [2018-11-18 15:41:05,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 887 [2018-11-18 15:41:05,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 887 states and 1236 transitions. [2018-11-18 15:41:05,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:05,900 INFO L705 BuchiCegarLoop]: Abstraction has 887 states and 1236 transitions. [2018-11-18 15:41:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states and 1236 transitions. [2018-11-18 15:41:05,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 535. [2018-11-18 15:41:05,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-11-18 15:41:05,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 803 transitions. [2018-11-18 15:41:05,910 INFO L728 BuchiCegarLoop]: Abstraction has 535 states and 803 transitions. [2018-11-18 15:41:05,910 INFO L608 BuchiCegarLoop]: Abstraction has 535 states and 803 transitions. [2018-11-18 15:41:05,910 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 15:41:05,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 535 states and 803 transitions. [2018-11-18 15:41:05,912 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 489 [2018-11-18 15:41:05,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:05,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:05,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:05,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:05,913 INFO L794 eck$LassoCheckResult]: Stem: 8288#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8264#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 8261#L40 assume !(0 == mp_add_~a3~0 % 256); 8262#L40-1 mp_add_~nb~0 := 4; 8780#L50 assume !(0 == mp_add_~b3~0 % 256); 8283#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8284#L61-3 assume true; 8677#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8289#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8271#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8272#L65-2 [2018-11-18 15:41:05,913 INFO L796 eck$LassoCheckResult]: Loop: 8272#L65-2 assume !(1 == mp_add_~i~0 % 256); 8772#L66-1 assume !(2 == mp_add_~i~0 % 256); 8770#L67-1 assume !(3 == mp_add_~i~0 % 256); 8765#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8760#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; 8687#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8686#L80-1 assume !(1 == mp_add_~i~0 % 256); 8682#L81-1 assume !(2 == mp_add_~i~0 % 256); 8683#L82-1 assume !(3 == mp_add_~i~0 % 256); 8678#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8679#L61-3 assume true; 8674#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8675#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8777#L65 assume !(0 == mp_add_~i~0 % 256); 8265#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; 8266#L66-1 assume !(2 == mp_add_~i~0 % 256); 8275#L67-1 assume !(3 == mp_add_~i~0 % 256); 8276#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8260#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; 8267#L76-1 assume !(0 == mp_add_~i~0 % 256); 8268#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8322#L81-1 assume !(2 == mp_add_~i~0 % 256); 8676#L82-1 assume !(3 == mp_add_~i~0 % 256); 8672#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8671#L61-3 assume true; 8670#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8669#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8668#L65 assume !(0 == mp_add_~i~0 % 256); 8667#L65-2 assume !(1 == mp_add_~i~0 % 256); 8619#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; 8620#L67-1 assume !(3 == mp_add_~i~0 % 256); 8636#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8634#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8633#L76-1 assume !(0 == mp_add_~i~0 % 256); 8632#L80-1 assume !(1 == mp_add_~i~0 % 256); 8594#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8393#L82-1 assume !(3 == mp_add_~i~0 % 256); 8317#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8520#L61-3 assume true; 8521#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8564#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8535#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8534#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8516#L76-1 assume !(0 == mp_add_~i~0 % 256); 8321#L80-1 assume !(1 == mp_add_~i~0 % 256); 8323#L81-1 assume !(2 == mp_add_~i~0 % 256); 8316#L82-1 assume !(3 == mp_add_~i~0 % 256); 8315#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8313#L61-3 assume true; 8314#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8627#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8713#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8272#L65-2 [2018-11-18 15:41:05,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:05,913 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 9 times [2018-11-18 15:41:05,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:05,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:05,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:05,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:05,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 73654067, now seen corresponding path program 1 times [2018-11-18 15:41:05,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:05,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:05,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 15:41:05,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:05,991 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:06,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:06,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 15:41:06,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:41:06,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-18 15:41:06,086 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:41:06,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:41:06,087 INFO L87 Difference]: Start difference. First operand 535 states and 803 transitions. cyclomatic complexity: 272 Second operand 8 states. [2018-11-18 15:41:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:06,287 INFO L93 Difference]: Finished difference Result 789 states and 1128 transitions. [2018-11-18 15:41:06,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:41:06,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 789 states and 1128 transitions. [2018-11-18 15:41:06,292 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 742 [2018-11-18 15:41:06,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 789 states to 789 states and 1128 transitions. [2018-11-18 15:41:06,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 789 [2018-11-18 15:41:06,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 789 [2018-11-18 15:41:06,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 789 states and 1128 transitions. [2018-11-18 15:41:06,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:06,297 INFO L705 BuchiCegarLoop]: Abstraction has 789 states and 1128 transitions. [2018-11-18 15:41:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states and 1128 transitions. [2018-11-18 15:41:06,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 542. [2018-11-18 15:41:06,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-18 15:41:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-11-18 15:41:06,309 INFO L728 BuchiCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-18 15:41:06,309 INFO L608 BuchiCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-11-18 15:41:06,309 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 15:41:06,309 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 807 transitions. [2018-11-18 15:41:06,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 495 [2018-11-18 15:41:06,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:06,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:06,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:06,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:06,312 INFO L794 eck$LassoCheckResult]: Stem: 9782#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9753#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 9748#L40 assume !(0 == mp_add_~a3~0 % 256); 9749#L40-1 mp_add_~nb~0 := 4; 10274#L50 assume !(0 == mp_add_~b3~0 % 256); 10271#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 10270#L61-3 assume true; 10269#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10268#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10267#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10056#L65-2 [2018-11-18 15:41:06,312 INFO L796 eck$LassoCheckResult]: Loop: 10056#L65-2 assume !(1 == mp_add_~i~0 % 256); 10266#L66-1 assume !(2 == mp_add_~i~0 % 256); 10265#L67-1 assume !(3 == mp_add_~i~0 % 256); 9779#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 9752#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; 10261#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10260#L80-1 assume !(1 == mp_add_~i~0 % 256); 10037#L81-1 assume !(2 == mp_add_~i~0 % 256); 10035#L82-1 assume !(3 == mp_add_~i~0 % 256); 10033#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10032#L61-3 assume true; 10031#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10030#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10029#L65 assume !(0 == mp_add_~i~0 % 256); 10028#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; 9925#L66-1 assume !(2 == mp_add_~i~0 % 256); 10026#L67-1 assume !(3 == mp_add_~i~0 % 256); 10024#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10022#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; 10021#L76-1 assume !(0 == mp_add_~i~0 % 256); 10019#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 9858#L81-1 assume !(2 == mp_add_~i~0 % 256); 9999#L82-1 assume !(3 == mp_add_~i~0 % 256); 9993#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9992#L61-3 assume true; 9991#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9990#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9989#L65 assume !(0 == mp_add_~i~0 % 256); 9988#L65-2 assume !(1 == mp_add_~i~0 % 256); 9987#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; 9918#L67-1 assume !(3 == mp_add_~i~0 % 256); 9983#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 9981#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; 9980#L76-1 assume !(0 == mp_add_~i~0 % 256); 9979#L80-1 assume !(1 == mp_add_~i~0 % 256); 9978#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 9975#L82-1 assume !(3 == mp_add_~i~0 % 256); 9965#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9966#L61-3 assume true; 9957#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9958#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 9908#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10247#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 10004#L76-1 assume !(0 == mp_add_~i~0 % 256); 10005#L80-1 assume !(1 == mp_add_~i~0 % 256); 10020#L81-1 assume !(2 == mp_add_~i~0 % 256); 9848#L82-1 assume !(3 == mp_add_~i~0 % 256); 9850#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9829#L61-3 assume true; 9830#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9959#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10055#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10056#L65-2 [2018-11-18 15:41:06,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 10 times [2018-11-18 15:41:06,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:06,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:06,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:06,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:06,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:06,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash 891302517, now seen corresponding path program 2 times [2018-11-18 15:41:06,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:06,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:06,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:06,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 15:41:06,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:06,552 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:06,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:41:06,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 15:41:06,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:41:06,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 53 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 15:41:06,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:06,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-18 15:41:06,712 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:06,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:41:06,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:41:06,713 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. cyclomatic complexity: 269 Second operand 12 states. [2018-11-18 15:41:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:07,517 INFO L93 Difference]: Finished difference Result 1208 states and 1610 transitions. [2018-11-18 15:41:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 15:41:07,518 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1208 states and 1610 transitions. [2018-11-18 15:41:07,521 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1073 [2018-11-18 15:41:07,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1208 states to 1208 states and 1610 transitions. [2018-11-18 15:41:07,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1208 [2018-11-18 15:41:07,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1208 [2018-11-18 15:41:07,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1208 states and 1610 transitions. [2018-11-18 15:41:07,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:07,526 INFO L705 BuchiCegarLoop]: Abstraction has 1208 states and 1610 transitions. [2018-11-18 15:41:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states and 1610 transitions. [2018-11-18 15:41:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 631. [2018-11-18 15:41:07,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-11-18 15:41:07,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 913 transitions. [2018-11-18 15:41:07,534 INFO L728 BuchiCegarLoop]: Abstraction has 631 states and 913 transitions. [2018-11-18 15:41:07,534 INFO L608 BuchiCegarLoop]: Abstraction has 631 states and 913 transitions. [2018-11-18 15:41:07,534 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 15:41:07,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 631 states and 913 transitions. [2018-11-18 15:41:07,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 584 [2018-11-18 15:41:07,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:07,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:07,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:07,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:07,536 INFO L794 eck$LassoCheckResult]: Stem: 11723#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11697#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 11693#L40 assume !(0 == mp_add_~a3~0 % 256); 11690#L40-1 mp_add_~nb~0 := 4; 11691#L50 assume !(0 == mp_add_~b3~0 % 256); 11714#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11715#L61-3 assume true; 12238#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12237#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12236#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12234#L65-2 [2018-11-18 15:41:07,536 INFO L796 eck$LassoCheckResult]: Loop: 12234#L65-2 assume !(1 == mp_add_~i~0 % 256); 11727#L66-1 assume !(2 == mp_add_~i~0 % 256); 11728#L67-1 assume !(3 == mp_add_~i~0 % 256); 12304#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12301#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; 12286#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12285#L80-1 assume !(1 == mp_add_~i~0 % 256); 12283#L81-1 assume !(2 == mp_add_~i~0 % 256); 12282#L82-1 assume !(3 == mp_add_~i~0 % 256); 12281#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12280#L61-3 assume true; 12279#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12278#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11703#L65 assume !(0 == mp_add_~i~0 % 256); 11698#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; 11699#L66-1 assume !(2 == mp_add_~i~0 % 256); 11706#L67-1 assume !(3 == mp_add_~i~0 % 256); 11707#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 11696#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; 12302#L76-1 assume !(0 == mp_add_~i~0 % 256); 12213#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11806#L81-1 assume !(2 == mp_add_~i~0 % 256); 12212#L82-1 assume !(3 == mp_add_~i~0 % 256); 12210#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12209#L61-3 assume true; 12208#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12207#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12206#L65 assume !(0 == mp_add_~i~0 % 256); 12205#L65-2 assume !(1 == mp_add_~i~0 % 256); 12204#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; 12140#L67-1 assume !(3 == mp_add_~i~0 % 256); 12202#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12200#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12199#L76-1 assume !(0 == mp_add_~i~0 % 256); 12198#L80-1 assume !(1 == mp_add_~i~0 % 256); 12197#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 11803#L82-1 assume !(3 == mp_add_~i~0 % 256); 11797#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11798#L61-3 assume true; 11778#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11779#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 11720#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11692#L71 assume !(0 == mp_add_~i~0 % 256); 11686#L71-2 assume !(1 == mp_add_~i~0 % 256); 11687#L72-1 assume !(2 == mp_add_~i~0 % 256); 11717#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; 12273#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; 12272#L76-1 assume !(0 == mp_add_~i~0 % 256); 12271#L80-1 assume !(1 == mp_add_~i~0 % 256); 12270#L81-1 assume !(2 == mp_add_~i~0 % 256); 12264#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 12153#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12154#L61-3 assume true; 12149#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12150#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12134#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 11993#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11992#L76-1 assume !(0 == mp_add_~i~0 % 256); 11805#L80-1 assume !(1 == mp_add_~i~0 % 256); 11802#L81-1 assume !(2 == mp_add_~i~0 % 256); 11804#L82-1 assume !(3 == mp_add_~i~0 % 256); 11781#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11782#L61-3 assume true; 11749#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11750#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12233#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12234#L65-2 [2018-11-18 15:41:07,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:07,537 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 11 times [2018-11-18 15:41:07,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:07,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:07,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:07,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:07,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:07,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:07,547 INFO L82 PathProgramCache]: Analyzing trace with hash -845353895, now seen corresponding path program 1 times [2018-11-18 15:41:07,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:07,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:07,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:07,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:07,649 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 84 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 15:41:07,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:07,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:07,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:07,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-18 15:41:07,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:41:07,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2018-11-18 15:41:07,763 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 15:41:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-11-18 15:41:07,763 INFO L87 Difference]: Start difference. First operand 631 states and 913 transitions. cyclomatic complexity: 286 Second operand 11 states. [2018-11-18 15:41:08,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:08,363 INFO L93 Difference]: Finished difference Result 1640 states and 2286 transitions. [2018-11-18 15:41:08,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 15:41:08,363 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1640 states and 2286 transitions. [2018-11-18 15:41:08,367 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1459 [2018-11-18 15:41:08,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1640 states to 1625 states and 2271 transitions. [2018-11-18 15:41:08,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1625 [2018-11-18 15:41:08,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1625 [2018-11-18 15:41:08,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1625 states and 2271 transitions. [2018-11-18 15:41:08,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:08,374 INFO L705 BuchiCegarLoop]: Abstraction has 1625 states and 2271 transitions. [2018-11-18 15:41:08,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states and 2271 transitions. [2018-11-18 15:41:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1412. [2018-11-18 15:41:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-11-18 15:41:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2022 transitions. [2018-11-18 15:41:08,389 INFO L728 BuchiCegarLoop]: Abstraction has 1412 states and 2022 transitions. [2018-11-18 15:41:08,389 INFO L608 BuchiCegarLoop]: Abstraction has 1412 states and 2022 transitions. [2018-11-18 15:41:08,389 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 15:41:08,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1412 states and 2022 transitions. [2018-11-18 15:41:08,392 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1346 [2018-11-18 15:41:08,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:08,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:08,393 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:08,393 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:08,394 INFO L794 eck$LassoCheckResult]: Stem: 14242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 14210#L40 assume !(0 == mp_add_~a3~0 % 256); 14206#L40-1 mp_add_~nb~0 := 4; 14207#L50 assume !(0 == mp_add_~b3~0 % 256); 14234#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14235#L61-3 assume true; 15544#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15543#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15542#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15243#L65-2 [2018-11-18 15:41:08,394 INFO L796 eck$LassoCheckResult]: Loop: 15243#L65-2 assume !(1 == mp_add_~i~0 % 256); 15541#L66-1 assume !(2 == mp_add_~i~0 % 256); 15539#L67-1 assume !(3 == mp_add_~i~0 % 256); 15540#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15449#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15169#L71-2 assume !(1 == mp_add_~i~0 % 256); 15170#L72-1 assume !(2 == mp_add_~i~0 % 256); 15507#L73-1 assume !(3 == mp_add_~i~0 % 256); 15506#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; 15505#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15504#L80-1 assume !(1 == mp_add_~i~0 % 256); 15503#L81-1 assume !(2 == mp_add_~i~0 % 256); 15502#L82-1 assume !(3 == mp_add_~i~0 % 256); 15501#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15500#L61-3 assume true; 15499#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15498#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15497#L65 assume !(0 == mp_add_~i~0 % 256); 15462#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; 15237#L66-1 assume !(2 == mp_add_~i~0 % 256); 15456#L67-1 assume !(3 == mp_add_~i~0 % 256); 15457#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14208#L71 assume !(0 == mp_add_~i~0 % 256); 14209#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; 15218#L72-1 assume !(2 == mp_add_~i~0 % 256); 15290#L73-1 assume !(3 == mp_add_~i~0 % 256); 15289#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; 15287#L76-1 assume !(0 == mp_add_~i~0 % 256); 15280#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15199#L81-1 assume !(2 == mp_add_~i~0 % 256); 15279#L82-1 assume !(3 == mp_add_~i~0 % 256); 15278#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15277#L61-3 assume true; 15276#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15275#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15274#L65 assume !(0 == mp_add_~i~0 % 256); 15273#L65-2 assume !(1 == mp_add_~i~0 % 256); 15271#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; 15231#L67-1 assume !(3 == mp_add_~i~0 % 256); 15266#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15263#L71 assume !(0 == mp_add_~i~0 % 256); 14202#L71-2 assume !(1 == mp_add_~i~0 % 256); 14203#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; 15128#L73-1 assume !(3 == mp_add_~i~0 % 256); 15129#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15204#L76-1 assume !(0 == mp_add_~i~0 % 256); 15201#L80-1 assume !(1 == mp_add_~i~0 % 256); 15197#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15191#L82-1 assume !(3 == mp_add_~i~0 % 256); 15189#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15187#L61-3 assume true; 15184#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15185#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15175#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15173#L71 assume !(0 == mp_add_~i~0 % 256); 15174#L71-2 assume !(1 == mp_add_~i~0 % 256); 15272#L72-1 assume !(2 == mp_add_~i~0 % 256); 15270#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; 15268#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; 15269#L76-1 assume !(0 == mp_add_~i~0 % 256); 15284#L80-1 assume !(1 == mp_add_~i~0 % 256); 15281#L81-1 assume !(2 == mp_add_~i~0 % 256); 15258#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 15255#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15253#L61-3 assume true; 15251#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15245#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15227#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15316#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15378#L76-1 assume !(0 == mp_add_~i~0 % 256); 15371#L80-1 assume !(1 == mp_add_~i~0 % 256); 15370#L81-1 assume !(2 == mp_add_~i~0 % 256); 14604#L82-1 assume !(3 == mp_add_~i~0 % 256); 14601#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14597#L61-3 assume true; 14598#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15521#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15522#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15243#L65-2 [2018-11-18 15:41:08,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 12 times [2018-11-18 15:41:08,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:08,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:08,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:08,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:08,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -654143055, now seen corresponding path program 1 times [2018-11-18 15:41:08,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:08,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:08,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2018-11-18 15:41:08,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:08,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:08,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:08,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 105 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 15:41:08,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:08,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-11-18 15:41:08,581 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:08,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:41:08,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:41:08,581 INFO L87 Difference]: Start difference. First operand 1412 states and 2022 transitions. cyclomatic complexity: 618 Second operand 9 states. [2018-11-18 15:41:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:09,456 INFO L93 Difference]: Finished difference Result 2501 states and 3018 transitions. [2018-11-18 15:41:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 15:41:09,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2501 states and 3018 transitions. [2018-11-18 15:41:09,461 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2321 [2018-11-18 15:41:09,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2501 states to 2463 states and 2970 transitions. [2018-11-18 15:41:09,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2463 [2018-11-18 15:41:09,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2463 [2018-11-18 15:41:09,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2463 states and 2970 transitions. [2018-11-18 15:41:09,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:09,469 INFO L705 BuchiCegarLoop]: Abstraction has 2463 states and 2970 transitions. [2018-11-18 15:41:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states and 2970 transitions. [2018-11-18 15:41:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 1372. [2018-11-18 15:41:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-11-18 15:41:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1743 transitions. [2018-11-18 15:41:09,484 INFO L728 BuchiCegarLoop]: Abstraction has 1372 states and 1743 transitions. [2018-11-18 15:41:09,484 INFO L608 BuchiCegarLoop]: Abstraction has 1372 states and 1743 transitions. [2018-11-18 15:41:09,484 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-18 15:41:09,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1372 states and 1743 transitions. [2018-11-18 15:41:09,486 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1300 [2018-11-18 15:41:09,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:09,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:09,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:09,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:09,487 INFO L794 eck$LassoCheckResult]: Stem: 18487#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18462#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 18458#L40 assume !(0 == mp_add_~a3~0 % 256); 18454#L40-1 mp_add_~nb~0 := 4; 18455#L50 assume !(0 == mp_add_~b3~0 % 256); 18478#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 18479#L61-3 assume true; 19697#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19696#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19693#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 19388#L65-2 [2018-11-18 15:41:09,487 INFO L796 eck$LassoCheckResult]: Loop: 19388#L65-2 assume !(1 == mp_add_~i~0 % 256); 19690#L66-1 assume !(2 == mp_add_~i~0 % 256); 19688#L67-1 assume !(3 == mp_add_~i~0 % 256); 19686#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19683#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 19681#L71-2 assume !(1 == mp_add_~i~0 % 256); 19679#L72-1 assume !(2 == mp_add_~i~0 % 256); 19677#L73-1 assume !(3 == mp_add_~i~0 % 256); 19674#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; 19671#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 19669#L80-1 assume !(1 == mp_add_~i~0 % 256); 19667#L81-1 assume !(2 == mp_add_~i~0 % 256); 19665#L82-1 assume !(3 == mp_add_~i~0 % 256); 19663#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19661#L61-3 assume true; 19573#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19574#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19569#L65 assume !(0 == mp_add_~i~0 % 256); 19570#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; 19655#L66-1 assume !(2 == mp_add_~i~0 % 256); 19653#L67-1 assume !(3 == mp_add_~i~0 % 256); 19651#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19565#L71 assume !(0 == mp_add_~i~0 % 256); 19525#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; 19523#L72-1 assume !(2 == mp_add_~i~0 % 256); 19520#L73-1 assume !(3 == mp_add_~i~0 % 256); 19504#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; 19505#L76-1 assume !(0 == mp_add_~i~0 % 256); 19641#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 19639#L81-1 assume !(2 == mp_add_~i~0 % 256); 19635#L82-1 assume !(3 == mp_add_~i~0 % 256); 19631#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19627#L61-3 assume true; 19474#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19473#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19472#L65 assume !(0 == mp_add_~i~0 % 256); 19470#L65-2 assume !(1 == mp_add_~i~0 % 256); 19471#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; 19413#L67-1 assume !(3 == mp_add_~i~0 % 256); 19617#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19466#L71 assume !(0 == mp_add_~i~0 % 256); 19464#L71-2 assume !(1 == mp_add_~i~0 % 256); 19462#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; 19401#L73-1 assume !(3 == mp_add_~i~0 % 256); 19460#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; 19459#L76-1 assume !(0 == mp_add_~i~0 % 256); 19454#L80-1 assume !(1 == mp_add_~i~0 % 256); 19452#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 19449#L82-1 assume !(3 == mp_add_~i~0 % 256); 19446#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19445#L61-3 assume true; 19444#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19442#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19443#L65 assume !(0 == mp_add_~i~0 % 256); 19453#L65-2 assume !(1 == mp_add_~i~0 % 256); 19447#L66-1 assume !(2 == mp_add_~i~0 % 256); 19448#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; 19435#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19562#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; 19558#L76-1 assume !(0 == mp_add_~i~0 % 256); 19556#L80-1 assume !(1 == mp_add_~i~0 % 256); 19553#L81-1 assume !(2 == mp_add_~i~0 % 256); 19549#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 19548#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19547#L61-3 assume true; 19546#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19544#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19542#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19406#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19541#L76-1 assume !(0 == mp_add_~i~0 % 256); 19540#L80-1 assume !(1 == mp_add_~i~0 % 256); 19539#L81-1 assume !(2 == mp_add_~i~0 % 256); 19538#L82-1 assume !(3 == mp_add_~i~0 % 256); 19537#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19536#L61-3 assume true; 19535#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19534#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19533#L65 assume !(0 == mp_add_~i~0 % 256); 19532#L65-2 assume !(1 == mp_add_~i~0 % 256); 19531#L66-1 assume !(2 == mp_add_~i~0 % 256); 19530#L67-1 assume !(3 == mp_add_~i~0 % 256); 19529#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19499#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19527#L76-1 assume !(0 == mp_add_~i~0 % 256); 19526#L80-1 assume !(1 == mp_add_~i~0 % 256); 19524#L81-1 assume !(2 == mp_add_~i~0 % 256); 19521#L82-1 assume !(3 == mp_add_~i~0 % 256); 19519#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19517#L61-3 assume true; 19515#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19512#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 19513#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 19388#L65-2 [2018-11-18 15:41:09,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 13 times [2018-11-18 15:41:09,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:09,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:09,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:09,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:09,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2144258323, now seen corresponding path program 1 times [2018-11-18 15:41:09,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:09,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:09,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:09,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:09,572 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-18 15:41:09,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:09,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:41:09,573 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:09,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 15:41:09,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 15:41:09,573 INFO L87 Difference]: Start difference. First operand 1372 states and 1743 transitions. cyclomatic complexity: 379 Second operand 6 states. [2018-11-18 15:41:09,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:09,730 INFO L93 Difference]: Finished difference Result 1980 states and 2412 transitions. [2018-11-18 15:41:09,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:41:09,731 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1980 states and 2412 transitions. [2018-11-18 15:41:09,735 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1595 [2018-11-18 15:41:09,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1980 states to 1853 states and 2270 transitions. [2018-11-18 15:41:09,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1853 [2018-11-18 15:41:09,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1853 [2018-11-18 15:41:09,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1853 states and 2270 transitions. [2018-11-18 15:41:09,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:09,742 INFO L705 BuchiCegarLoop]: Abstraction has 1853 states and 2270 transitions. [2018-11-18 15:41:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states and 2270 transitions. [2018-11-18 15:41:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1506. [2018-11-18 15:41:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2018-11-18 15:41:09,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1868 transitions. [2018-11-18 15:41:09,763 INFO L728 BuchiCegarLoop]: Abstraction has 1506 states and 1868 transitions. [2018-11-18 15:41:09,763 INFO L608 BuchiCegarLoop]: Abstraction has 1506 states and 1868 transitions. [2018-11-18 15:41:09,763 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-18 15:41:09,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1506 states and 1868 transitions. [2018-11-18 15:41:09,766 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1400 [2018-11-18 15:41:09,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:09,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:09,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:09,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:09,767 INFO L794 eck$LassoCheckResult]: Stem: 21856#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 21827#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 21823#L40 assume !(0 == mp_add_~a3~0 % 256); 21819#L40-1 mp_add_~nb~0 := 4; 21820#L50 assume !(0 == mp_add_~b3~0 % 256); 21844#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 21845#L61-3 assume true; 23027#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23026#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23025#L65 [2018-11-18 15:41:09,767 INFO L796 eck$LassoCheckResult]: Loop: 23025#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22782#L65-2 assume !(1 == mp_add_~i~0 % 256); 23024#L66-1 assume !(2 == mp_add_~i~0 % 256); 23023#L67-1 assume !(3 == mp_add_~i~0 % 256); 23021#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23020#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 23019#L71-2 assume !(1 == mp_add_~i~0 % 256); 23017#L72-1 assume !(2 == mp_add_~i~0 % 256); 23015#L73-1 assume !(3 == mp_add_~i~0 % 256); 23012#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23011#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22806#L80-1 assume !(1 == mp_add_~i~0 % 256); 23010#L81-1 assume !(2 == mp_add_~i~0 % 256); 23007#L82-1 assume !(3 == mp_add_~i~0 % 256); 22984#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22985#L61-3 assume true; 22976#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22977#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22967#L65 assume !(0 == mp_add_~i~0 % 256); 22968#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; 22912#L66-1 assume !(2 == mp_add_~i~0 % 256); 22948#L67-1 assume !(3 == mp_add_~i~0 % 256); 22925#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22923#L71 assume !(0 == mp_add_~i~0 % 256); 22921#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; 22920#L72-1 assume !(2 == mp_add_~i~0 % 256); 22918#L73-1 assume !(3 == mp_add_~i~0 % 256); 22915#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22913#L76-1 assume !(0 == mp_add_~i~0 % 256); 22914#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22906#L81-1 assume !(2 == mp_add_~i~0 % 256); 22907#L82-1 assume !(3 == mp_add_~i~0 % 256); 22902#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22903#L61-3 assume true; 22898#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22899#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22894#L65 assume !(0 == mp_add_~i~0 % 256); 22895#L65-2 assume !(1 == mp_add_~i~0 % 256); 22891#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; 22777#L67-1 assume !(3 == mp_add_~i~0 % 256); 22888#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22887#L71 assume !(0 == mp_add_~i~0 % 256); 22886#L71-2 assume !(1 == mp_add_~i~0 % 256); 22885#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; 22809#L73-1 assume !(3 == mp_add_~i~0 % 256); 22883#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; 22881#L76-1 assume !(0 == mp_add_~i~0 % 256); 22879#L80-1 assume !(1 == mp_add_~i~0 % 256); 22877#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22876#L82-1 assume !(3 == mp_add_~i~0 % 256); 22874#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22872#L61-3 assume true; 22869#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22868#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 21855#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23306#L71 assume !(0 == mp_add_~i~0 % 256); 23305#L71-2 assume !(1 == mp_add_~i~0 % 256); 23304#L72-1 assume !(2 == mp_add_~i~0 % 256); 23288#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; 23067#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; 23300#L76-1 assume !(0 == mp_add_~i~0 % 256); 23298#L80-1 assume !(1 == mp_add_~i~0 % 256); 23296#L81-1 assume !(2 == mp_add_~i~0 % 256); 23293#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 23272#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23271#L61-3 assume true; 21846#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 21847#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22841#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 21818#L71 assume !(0 == mp_add_~i~0 % 256); 21814#L71-2 assume !(1 == mp_add_~i~0 % 256); 21815#L72-1 assume !(2 == mp_add_~i~0 % 256); 21848#L73-1 assume !(3 == mp_add_~i~0 % 256); 23064#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23061#L76-1 assume !(0 == mp_add_~i~0 % 256); 23058#L80-1 assume !(1 == mp_add_~i~0 % 256); 23055#L81-1 assume !(2 == mp_add_~i~0 % 256); 23052#L82-1 assume !(3 == mp_add_~i~0 % 256); 23049#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23048#L61-3 assume true; 23047#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23046#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22772#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22768#L71 assume !(0 == mp_add_~i~0 % 256); 22767#L71-2 assume !(1 == mp_add_~i~0 % 256); 22765#L72-1 assume !(2 == mp_add_~i~0 % 256); 22760#L73-1 assume !(3 == mp_add_~i~0 % 256); 22762#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23039#L76-1 assume !(0 == mp_add_~i~0 % 256); 23036#L80-1 assume !(1 == mp_add_~i~0 % 256); 23034#L81-1 assume !(2 == mp_add_~i~0 % 256); 23032#L82-1 assume !(3 == mp_add_~i~0 % 256); 23031#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23030#L61-3 assume true; 23028#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23029#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23025#L65 [2018-11-18 15:41:09,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:09,767 INFO L82 PathProgramCache]: Analyzing trace with hash -685617880, now seen corresponding path program 1 times [2018-11-18 15:41:09,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:09,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:09,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:09,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash -207455747, now seen corresponding path program 1 times [2018-11-18 15:41:09,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:09,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:09,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 89 proven. 123 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 15:41:09,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:09,995 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:10,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:10,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 190 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-18 15:41:10,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:10,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2018-11-18 15:41:10,559 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:10,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 15:41:10,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-18 15:41:10,560 INFO L87 Difference]: Start difference. First operand 1506 states and 1868 transitions. cyclomatic complexity: 370 Second operand 20 states. [2018-11-18 15:41:14,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:14,094 INFO L93 Difference]: Finished difference Result 2546 states and 3096 transitions. [2018-11-18 15:41:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-18 15:41:14,094 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2546 states and 3096 transitions. [2018-11-18 15:41:14,098 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 2119 [2018-11-18 15:41:14,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2546 states to 2468 states and 2946 transitions. [2018-11-18 15:41:14,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2468 [2018-11-18 15:41:14,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2468 [2018-11-18 15:41:14,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2468 states and 2946 transitions. [2018-11-18 15:41:14,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:14,104 INFO L705 BuchiCegarLoop]: Abstraction has 2468 states and 2946 transitions. [2018-11-18 15:41:14,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states and 2946 transitions. [2018-11-18 15:41:14,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 1148. [2018-11-18 15:41:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2018-11-18 15:41:14,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1390 transitions. [2018-11-18 15:41:14,121 INFO L728 BuchiCegarLoop]: Abstraction has 1148 states and 1390 transitions. [2018-11-18 15:41:14,121 INFO L608 BuchiCegarLoop]: Abstraction has 1148 states and 1390 transitions. [2018-11-18 15:41:14,122 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-18 15:41:14,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1148 states and 1390 transitions. [2018-11-18 15:41:14,124 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 994 [2018-11-18 15:41:14,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:14,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:14,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:14,125 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:14,125 INFO L794 eck$LassoCheckResult]: Stem: 26314#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 26292#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 26288#L40 assume !(0 == mp_add_~a3~0 % 256); 26284#L40-1 mp_add_~nb~0 := 4; 26285#L50 assume !(0 == mp_add_~b3~0 % 256); 26305#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 26306#L61-3 assume true; 27059#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27041#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27040#L65 [2018-11-18 15:41:14,125 INFO L796 eck$LassoCheckResult]: Loop: 27040#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 26836#L65-2 assume !(1 == mp_add_~i~0 % 256); 27039#L66-1 assume !(2 == mp_add_~i~0 % 256); 27038#L67-1 assume !(3 == mp_add_~i~0 % 256); 27036#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27035#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 27034#L71-2 assume !(1 == mp_add_~i~0 % 256); 27032#L72-1 assume !(2 == mp_add_~i~0 % 256); 27030#L73-1 assume !(3 == mp_add_~i~0 % 256); 27027#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; 27025#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 27026#L80-1 assume !(1 == mp_add_~i~0 % 256); 27022#L81-1 assume !(2 == mp_add_~i~0 % 256); 27023#L82-1 assume !(3 == mp_add_~i~0 % 256); 27018#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27019#L61-3 assume true; 27014#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27015#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27010#L65 assume !(0 == mp_add_~i~0 % 256); 27011#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; 27294#L66-1 assume !(2 == mp_add_~i~0 % 256); 27292#L67-1 assume !(3 == mp_add_~i~0 % 256); 27290#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26993#L71 assume !(0 == mp_add_~i~0 % 256); 26990#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; 26988#L72-1 assume !(2 == mp_add_~i~0 % 256); 26986#L73-1 assume !(3 == mp_add_~i~0 % 256); 26981#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; 26979#L76-1 assume !(0 == mp_add_~i~0 % 256); 26980#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 27283#L81-1 assume !(2 == mp_add_~i~0 % 256); 26972#L82-1 assume !(3 == mp_add_~i~0 % 256); 26970#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26971#L61-3 assume true; 27277#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27275#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26656#L65 assume !(0 == mp_add_~i~0 % 256); 26943#L65-2 assume !(1 == mp_add_~i~0 % 256); 26944#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; 26914#L67-1 assume !(3 == mp_add_~i~0 % 256); 27271#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26939#L71 assume !(0 == mp_add_~i~0 % 256); 26938#L71-2 assume !(1 == mp_add_~i~0 % 256); 26937#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; 26877#L73-1 assume !(3 == mp_add_~i~0 % 256); 26934#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; 26933#L76-1 assume !(0 == mp_add_~i~0 % 256); 26932#L80-1 assume !(1 == mp_add_~i~0 % 256); 26931#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 26930#L82-1 assume !(3 == mp_add_~i~0 % 256); 26929#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26928#L61-3 assume true; 26927#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26925#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26924#L65 assume !(0 == mp_add_~i~0 % 256); 26923#L65-2 assume !(1 == mp_add_~i~0 % 256); 26921#L66-1 assume !(2 == mp_add_~i~0 % 256); 26922#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; 26887#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26918#L71 assume !(0 == mp_add_~i~0 % 256); 26917#L71-2 assume !(1 == mp_add_~i~0 % 256); 26916#L72-1 assume !(2 == mp_add_~i~0 % 256); 26913#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; 26911#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; 26912#L76-1 assume !(0 == mp_add_~i~0 % 256); 26907#L80-1 assume !(1 == mp_add_~i~0 % 256); 26908#L81-1 assume !(2 == mp_add_~i~0 % 256); 26903#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 26904#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26900#L61-3 assume true; 26901#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26895#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26897#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27102#L71 assume !(0 == mp_add_~i~0 % 256); 27103#L71-2 assume !(1 == mp_add_~i~0 % 256); 27098#L72-1 assume !(2 == mp_add_~i~0 % 256); 27099#L73-1 assume !(3 == mp_add_~i~0 % 256); 27096#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27095#L76-1 assume !(0 == mp_add_~i~0 % 256); 27094#L80-1 assume !(1 == mp_add_~i~0 % 256); 27093#L81-1 assume !(2 == mp_add_~i~0 % 256); 27092#L82-1 assume !(3 == mp_add_~i~0 % 256); 27091#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27090#L61-3 assume true; 27089#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27088#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26866#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27087#L71 assume !(0 == mp_add_~i~0 % 256); 27086#L71-2 assume !(1 == mp_add_~i~0 % 256); 27085#L72-1 assume !(2 == mp_add_~i~0 % 256); 27084#L73-1 assume !(3 == mp_add_~i~0 % 256); 27083#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27082#L76-1 assume !(0 == mp_add_~i~0 % 256); 27081#L80-1 assume !(1 == mp_add_~i~0 % 256); 27080#L81-1 assume !(2 == mp_add_~i~0 % 256); 27079#L82-1 assume !(3 == mp_add_~i~0 % 256); 27078#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27077#L61-3 assume true; 27076#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27075#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26838#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27074#L71 assume !(0 == mp_add_~i~0 % 256); 27073#L71-2 assume !(1 == mp_add_~i~0 % 256); 27072#L72-1 assume !(2 == mp_add_~i~0 % 256); 27071#L73-1 assume !(3 == mp_add_~i~0 % 256); 27070#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27069#L76-1 assume !(0 == mp_add_~i~0 % 256); 27068#L80-1 assume !(1 == mp_add_~i~0 % 256); 27067#L81-1 assume !(2 == mp_add_~i~0 % 256); 27066#L82-1 assume !(3 == mp_add_~i~0 % 256); 27065#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27064#L61-3 assume true; 27063#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27057#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27056#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27055#L71 assume !(0 == mp_add_~i~0 % 256); 27054#L71-2 assume !(1 == mp_add_~i~0 % 256); 27053#L72-1 assume !(2 == mp_add_~i~0 % 256); 27051#L73-1 assume !(3 == mp_add_~i~0 % 256); 27050#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27049#L76-1 assume !(0 == mp_add_~i~0 % 256); 27048#L80-1 assume !(1 == mp_add_~i~0 % 256); 27047#L81-1 assume !(2 == mp_add_~i~0 % 256); 27046#L82-1 assume !(3 == mp_add_~i~0 % 256); 27045#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27044#L61-3 assume true; 27042#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27043#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27040#L65 [2018-11-18 15:41:14,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash -685617880, now seen corresponding path program 2 times [2018-11-18 15:41:14,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:14,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:14,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:14,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:14,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:14,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:14,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:14,134 INFO L82 PathProgramCache]: Analyzing trace with hash 573797153, now seen corresponding path program 1 times [2018-11-18 15:41:14,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:14,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:14,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:14,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:14,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 210 proven. 140 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 15:41:14,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:14,326 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:14,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:14,462 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-11-18 15:41:14,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:41:14,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2018-11-18 15:41:14,478 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:41:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:41:14,478 INFO L87 Difference]: Start difference. First operand 1148 states and 1390 transitions. cyclomatic complexity: 249 Second operand 14 states. [2018-11-18 15:41:16,073 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-18 15:41:23,856 WARN L180 SmtUtils]: Spent 7.61 s on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2018-11-18 15:41:24,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:24,097 INFO L93 Difference]: Finished difference Result 1801 states and 2070 transitions. [2018-11-18 15:41:24,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-18 15:41:24,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1801 states and 2070 transitions. [2018-11-18 15:41:24,101 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 870 [2018-11-18 15:41:24,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1801 states to 1801 states and 2070 transitions. [2018-11-18 15:41:24,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1801 [2018-11-18 15:41:24,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1801 [2018-11-18 15:41:24,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1801 states and 2070 transitions. [2018-11-18 15:41:24,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:24,106 INFO L705 BuchiCegarLoop]: Abstraction has 1801 states and 2070 transitions. [2018-11-18 15:41:24,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states and 2070 transitions. [2018-11-18 15:41:24,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 984. [2018-11-18 15:41:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-11-18 15:41:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1154 transitions. [2018-11-18 15:41:24,119 INFO L728 BuchiCegarLoop]: Abstraction has 984 states and 1154 transitions. [2018-11-18 15:41:24,119 INFO L608 BuchiCegarLoop]: Abstraction has 984 states and 1154 transitions. [2018-11-18 15:41:24,119 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-18 15:41:24,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 984 states and 1154 transitions. [2018-11-18 15:41:24,121 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 567 [2018-11-18 15:41:24,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:24,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:24,122 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:24,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:24,122 INFO L794 eck$LassoCheckResult]: Stem: 29735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 29710#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 29705#L40 assume !(0 == mp_add_~a3~0 % 256); 29706#L40-1 mp_add_~nb~0 := 4; 29935#L50 assume !(0 == mp_add_~b3~0 % 256); 29725#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29726#L61-3 assume true; 30167#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30166#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30161#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 30162#L65-2 [2018-11-18 15:41:24,122 INFO L796 eck$LassoCheckResult]: Loop: 30162#L65-2 assume !(1 == mp_add_~i~0 % 256); 30423#L66-1 assume !(2 == mp_add_~i~0 % 256); 30422#L67-1 assume !(3 == mp_add_~i~0 % 256); 30420#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30419#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 30418#L71-2 assume !(1 == mp_add_~i~0 % 256); 30416#L72-1 assume !(2 == mp_add_~i~0 % 256); 30414#L73-1 assume !(3 == mp_add_~i~0 % 256); 30411#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; 30409#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 30410#L80-1 assume !(1 == mp_add_~i~0 % 256); 30406#L81-1 assume !(2 == mp_add_~i~0 % 256); 30407#L82-1 assume !(3 == mp_add_~i~0 % 256); 30402#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30403#L61-3 assume true; 30398#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30399#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30394#L65 assume !(0 == mp_add_~i~0 % 256); 30395#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; 30530#L66-1 assume !(2 == mp_add_~i~0 % 256); 30528#L67-1 assume !(3 == mp_add_~i~0 % 256); 30526#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30354#L71 assume !(0 == mp_add_~i~0 % 256); 30351#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; 30348#L72-1 assume !(2 == mp_add_~i~0 % 256); 30333#L73-1 assume !(3 == mp_add_~i~0 % 256); 30330#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30328#L76-1 assume !(0 == mp_add_~i~0 % 256); 30329#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 30321#L81-1 assume !(2 == mp_add_~i~0 % 256); 30322#L82-1 assume !(3 == mp_add_~i~0 % 256); 30317#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30318#L61-3 assume true; 30313#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30314#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29978#L65 assume !(0 == mp_add_~i~0 % 256); 30311#L65-2 assume !(1 == mp_add_~i~0 % 256); 30308#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; 30204#L67-1 assume !(3 == mp_add_~i~0 % 256); 30306#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30305#L71 assume !(0 == mp_add_~i~0 % 256); 30304#L71-2 assume !(1 == mp_add_~i~0 % 256); 30303#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; 30226#L73-1 assume !(3 == mp_add_~i~0 % 256); 30300#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30298#L76-1 assume !(0 == mp_add_~i~0 % 256); 30299#L80-1 assume !(1 == mp_add_~i~0 % 256); 30295#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 30219#L82-1 assume !(3 == mp_add_~i~0 % 256); 30430#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30290#L61-3 assume true; 30291#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30285#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30286#L65 assume !(0 == mp_add_~i~0 % 256); 30281#L65-2 assume !(1 == mp_add_~i~0 % 256); 30282#L66-1 assume !(2 == mp_add_~i~0 % 256); 30278#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; 30201#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30277#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30425#L76-1 assume !(0 == mp_add_~i~0 % 256); 30424#L80-1 assume !(1 == mp_add_~i~0 % 256); 30392#L81-1 assume !(2 == mp_add_~i~0 % 256); 30391#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 30350#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30386#L61-3 assume true; 30387#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30382#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30383#L65 assume !(0 == mp_add_~i~0 % 256); 30378#L65-2 assume !(1 == mp_add_~i~0 % 256); 30379#L66-1 assume !(2 == mp_add_~i~0 % 256); 30374#L67-1 assume !(3 == mp_add_~i~0 % 256); 30373#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30237#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30372#L76-1 assume !(0 == mp_add_~i~0 % 256); 30371#L80-1 assume !(1 == mp_add_~i~0 % 256); 30370#L81-1 assume !(2 == mp_add_~i~0 % 256); 30369#L82-1 assume !(3 == mp_add_~i~0 % 256); 30368#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30367#L61-3 assume true; 30366#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30365#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30364#L65 assume !(0 == mp_add_~i~0 % 256); 30363#L65-2 assume !(1 == mp_add_~i~0 % 256); 30362#L66-1 assume !(2 == mp_add_~i~0 % 256); 30361#L67-1 assume !(3 == mp_add_~i~0 % 256); 30360#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30326#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30358#L76-1 assume !(0 == mp_add_~i~0 % 256); 30355#L80-1 assume !(1 == mp_add_~i~0 % 256); 30352#L81-1 assume !(2 == mp_add_~i~0 % 256); 30349#L82-1 assume !(3 == mp_add_~i~0 % 256); 30347#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30346#L61-3 assume true; 30345#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30344#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30343#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 30162#L65-2 [2018-11-18 15:41:24,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 220682256, now seen corresponding path program 14 times [2018-11-18 15:41:24,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:24,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:24,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:24,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -147740261, now seen corresponding path program 1 times [2018-11-18 15:41:24,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:24,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:24,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:24,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:24,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 123 proven. 36 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 15:41:24,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:24,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:24,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:24,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:24,460 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 132 proven. 36 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-18 15:41:24,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:24,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 11 [2018-11-18 15:41:24,475 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:24,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 15:41:24,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-11-18 15:41:24,476 INFO L87 Difference]: Start difference. First operand 984 states and 1154 transitions. cyclomatic complexity: 178 Second operand 12 states. [2018-11-18 15:41:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:26,291 INFO L93 Difference]: Finished difference Result 1491 states and 1655 transitions. [2018-11-18 15:41:26,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 15:41:26,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1491 states and 1655 transitions. [2018-11-18 15:41:26,294 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 577 [2018-11-18 15:41:26,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1491 states to 1470 states and 1633 transitions. [2018-11-18 15:41:26,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1470 [2018-11-18 15:41:26,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1470 [2018-11-18 15:41:26,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1470 states and 1633 transitions. [2018-11-18 15:41:26,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:26,298 INFO L705 BuchiCegarLoop]: Abstraction has 1470 states and 1633 transitions. [2018-11-18 15:41:26,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states and 1633 transitions. [2018-11-18 15:41:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 1084. [2018-11-18 15:41:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1084 states. [2018-11-18 15:41:26,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1233 transitions. [2018-11-18 15:41:26,312 INFO L728 BuchiCegarLoop]: Abstraction has 1084 states and 1233 transitions. [2018-11-18 15:41:26,312 INFO L608 BuchiCegarLoop]: Abstraction has 1084 states and 1233 transitions. [2018-11-18 15:41:26,312 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-18 15:41:26,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1084 states and 1233 transitions. [2018-11-18 15:41:26,313 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 461 [2018-11-18 15:41:26,313 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:26,313 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:26,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:26,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:26,314 INFO L794 eck$LassoCheckResult]: Stem: 32562#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 32532#L40 assume !(0 == mp_add_~a3~0 % 256); 32529#L40-1 mp_add_~nb~0 := 4; 32530#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 32557#L52 assume !(0 == mp_add_~b2~0 % 256); 32541#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 33155#L61-3 assume true; 33156#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33151#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33152#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33146#L65-2 assume !(1 == mp_add_~i~0 % 256); 33147#L66-1 assume !(2 == mp_add_~i~0 % 256); 33140#L67-1 assume !(3 == mp_add_~i~0 % 256); 33141#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33294#L70 [2018-11-18 15:41:26,314 INFO L796 eck$LassoCheckResult]: Loop: 33294#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33516#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 33089#L80-1 assume !(1 == mp_add_~i~0 % 256); 33515#L81-1 assume !(2 == mp_add_~i~0 % 256); 33514#L82-1 assume !(3 == mp_add_~i~0 % 256); 33513#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33512#L61-3 assume true; 33511#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33510#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33509#L65 assume !(0 == mp_add_~i~0 % 256); 33508#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; 33382#L66-1 assume !(2 == mp_add_~i~0 % 256); 33507#L67-1 assume !(3 == mp_add_~i~0 % 256); 33506#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33505#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33503#L76-1 assume !(0 == mp_add_~i~0 % 256); 33375#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 33370#L81-1 assume !(2 == mp_add_~i~0 % 256); 33367#L82-1 assume !(3 == mp_add_~i~0 % 256); 33364#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33361#L61-3 assume true; 33358#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32674#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33353#L65 assume !(0 == mp_add_~i~0 % 256); 33350#L65-2 assume !(1 == mp_add_~i~0 % 256); 33349#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; 33335#L67-1 assume !(3 == mp_add_~i~0 % 256); 33343#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33341#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33339#L76-1 assume !(0 == mp_add_~i~0 % 256); 33337#L80-1 assume !(1 == mp_add_~i~0 % 256); 33333#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 33332#L82-1 assume !(3 == mp_add_~i~0 % 256); 33331#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33330#L61-3 assume true; 33329#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33328#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33327#L65 assume !(0 == mp_add_~i~0 % 256); 33326#L65-2 assume !(1 == mp_add_~i~0 % 256); 33325#L66-1 assume !(2 == mp_add_~i~0 % 256); 33320#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; 33321#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33491#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33489#L76-1 assume !(0 == mp_add_~i~0 % 256); 33487#L80-1 assume !(1 == mp_add_~i~0 % 256); 33485#L81-1 assume !(2 == mp_add_~i~0 % 256); 33482#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33392#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33435#L61-3 assume true; 33434#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33433#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33432#L65 assume !(0 == mp_add_~i~0 % 256); 33431#L65-2 assume !(1 == mp_add_~i~0 % 256); 33430#L66-1 assume !(2 == mp_add_~i~0 % 256); 33345#L67-1 assume !(3 == mp_add_~i~0 % 256); 33346#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33444#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33443#L76-1 assume !(0 == mp_add_~i~0 % 256); 33442#L80-1 assume !(1 == mp_add_~i~0 % 256); 33441#L81-1 assume !(2 == mp_add_~i~0 % 256); 33440#L82-1 assume !(3 == mp_add_~i~0 % 256); 33439#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33438#L61-3 assume true; 33344#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33342#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33340#L65 assume !(0 == mp_add_~i~0 % 256); 33338#L65-2 assume !(1 == mp_add_~i~0 % 256); 33334#L66-1 assume !(2 == mp_add_~i~0 % 256); 33336#L67-1 assume !(3 == mp_add_~i~0 % 256); 33425#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33424#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33423#L76-1 assume !(0 == mp_add_~i~0 % 256); 33422#L80-1 assume !(1 == mp_add_~i~0 % 256); 33421#L81-1 assume !(2 == mp_add_~i~0 % 256); 33420#L82-1 assume !(3 == mp_add_~i~0 % 256); 33419#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33418#L61-3 assume true; 33417#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33416#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33415#L65 assume !(0 == mp_add_~i~0 % 256); 33414#L65-2 assume !(1 == mp_add_~i~0 % 256); 33413#L66-1 assume !(2 == mp_add_~i~0 % 256); 33412#L67-1 assume !(3 == mp_add_~i~0 % 256); 33411#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33410#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33409#L76-1 assume !(0 == mp_add_~i~0 % 256); 33408#L80-1 assume !(1 == mp_add_~i~0 % 256); 33374#L81-1 assume !(2 == mp_add_~i~0 % 256); 33391#L82-1 assume !(3 == mp_add_~i~0 % 256); 33388#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33387#L61-3 assume true; 33386#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33385#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33383#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33384#L65-2 assume !(1 == mp_add_~i~0 % 256); 33519#L66-1 assume !(2 == mp_add_~i~0 % 256); 33518#L67-1 assume !(3 == mp_add_~i~0 % 256); 33517#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33294#L70 [2018-11-18 15:41:26,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash 236289352, now seen corresponding path program 1 times [2018-11-18 15:41:26,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:26,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:26,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:26,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:26,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 15:41:26,333 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:26,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash 710913985, now seen corresponding path program 1 times [2018-11-18 15:41:26,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:26,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:26,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:26,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:26,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 179 proven. 75 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-18 15:41:26,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:26,409 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:26,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:26,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-11-18 15:41:27,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:27,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-18 15:41:27,034 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:27,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 15:41:27,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 15:41:27,034 INFO L87 Difference]: Start difference. First operand 1084 states and 1233 transitions. cyclomatic complexity: 160 Second operand 3 states. [2018-11-18 15:41:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:27,037 INFO L93 Difference]: Finished difference Result 552 states and 616 transitions. [2018-11-18 15:41:27,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 15:41:27,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 552 states and 616 transitions. [2018-11-18 15:41:27,039 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 181 [2018-11-18 15:41:27,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 552 states to 552 states and 616 transitions. [2018-11-18 15:41:27,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 552 [2018-11-18 15:41:27,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 552 [2018-11-18 15:41:27,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 552 states and 616 transitions. [2018-11-18 15:41:27,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:27,040 INFO L705 BuchiCegarLoop]: Abstraction has 552 states and 616 transitions. [2018-11-18 15:41:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states and 616 transitions. [2018-11-18 15:41:27,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2018-11-18 15:41:27,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-18 15:41:27,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 616 transitions. [2018-11-18 15:41:27,044 INFO L728 BuchiCegarLoop]: Abstraction has 552 states and 616 transitions. [2018-11-18 15:41:27,044 INFO L608 BuchiCegarLoop]: Abstraction has 552 states and 616 transitions. [2018-11-18 15:41:27,044 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-18 15:41:27,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 552 states and 616 transitions. [2018-11-18 15:41:27,046 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 181 [2018-11-18 15:41:27,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:27,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:27,046 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:27,046 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:27,047 INFO L794 eck$LassoCheckResult]: Stem: 34506#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 34481#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 34476#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34478#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34505#L44 assume !(0 == mp_add_~a1~0 % 256); 34510#L40-1 mp_add_~nb~0 := 4; 34643#L50 assume !(0 == mp_add_~b3~0 % 256); 34641#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34639#L61-3 assume true; 34637#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34634#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34632#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34630#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34628#L71-2 assume !(1 == mp_add_~i~0 % 256); 34626#L72-1 assume !(2 == mp_add_~i~0 % 256); 34624#L73-1 assume !(3 == mp_add_~i~0 % 256); 34622#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34620#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 34618#L80-1 assume !(1 == mp_add_~i~0 % 256); 34616#L81-1 assume !(2 == mp_add_~i~0 % 256); 34614#L82-1 assume !(3 == mp_add_~i~0 % 256); 34612#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34610#L61-3 assume true; 34608#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34604#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34603#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34590#L71 assume !(0 == mp_add_~i~0 % 256); 34591#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; 34578#L72-1 assume !(2 == mp_add_~i~0 % 256); 34579#L73-1 assume !(3 == mp_add_~i~0 % 256); 34555#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34553#L76-1 assume !(0 == mp_add_~i~0 % 256); 34551#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 34549#L81-1 assume !(2 == mp_add_~i~0 % 256); 34547#L82-1 assume !(3 == mp_add_~i~0 % 256); 34545#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34543#L61-3 assume true; 34538#L61-1 assume !((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536); 34537#L88-2 assume true; 34535#L88 assume !!(mp_add_~i~0 % 256 < 4); 34534#L89 assume !(0 == mp_add_~i~0 % 256); 34529#L89-2 assume !(1 == mp_add_~i~0 % 256); 34530#L90-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := 0; 34513#L91-1 assume !(3 == mp_add_~i~0 % 256); 34468#L92-1 [2018-11-18 15:41:27,047 INFO L796 eck$LassoCheckResult]: Loop: 34468#L92-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34527#L88-2 assume true; 34526#L88 assume !!(mp_add_~i~0 % 256 < 4); 34525#L89 assume !(0 == mp_add_~i~0 % 256); 34524#L89-2 assume !(1 == mp_add_~i~0 % 256); 34523#L90-1 assume !(2 == mp_add_~i~0 % 256); 34467#L91-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := 0; 34468#L92-1 [2018-11-18 15:41:27,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:27,047 INFO L82 PathProgramCache]: Analyzing trace with hash 104060560, now seen corresponding path program 1 times [2018-11-18 15:41:27,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:27,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:27,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:27,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:27,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:27,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:27,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:27,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:27,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 15:41:27,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:41:27,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2018-11-18 15:41:27,189 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:27,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:27,189 INFO L82 PathProgramCache]: Analyzing trace with hash 864362241, now seen corresponding path program 1 times [2018-11-18 15:41:27,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:27,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:27,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:27,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:27,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:27,217 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:27,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:27,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:27,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:27,218 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:41:27,218 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:27,218 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:27,218 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:27,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration21_Loop [2018-11-18 15:41:27,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:27,219 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:27,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:27,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:27,281 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:27,282 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:27,286 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:41:27,286 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:41:27,295 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 15:41:27,296 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~r3~0=0} Honda state: {ULTIMATE.start_mp_add_~r3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:27,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:41:27,313 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:27,383 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:41:27,383 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:41:27,613 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:41:27,614 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:27,614 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:27,614 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:27,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:27,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:41:27,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:27,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:27,615 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:27,615 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration21_Loop [2018-11-18 15:41:27,615 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:27,615 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:27,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:27,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:27,685 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:27,688 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:41:27,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:27,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:27,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:27,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:27,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,699 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:41:27,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,701 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:27,701 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:27,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,703 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:27,704 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:27,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,706 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:41:27,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:27,708 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:27,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,710 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:27,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:27,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,714 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:41:27,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,716 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:27,716 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:27,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:27,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,718 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:27,719 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:27,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,724 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:41:27,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,724 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:27,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,725 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:27,726 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:27,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,727 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:27,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:27,730 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:27,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,734 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:41:27,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,735 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:27,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,736 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:27,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:27,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,739 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:27,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:27,743 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:27,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,751 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:41:27,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,752 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,752 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:27,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:27,755 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:27,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,757 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:27,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:27,763 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:27,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,775 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:41:27,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:27,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:27,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:27,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,779 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:27,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:27,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:27,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,785 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:41:27,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,785 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:27,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,786 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:27,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:27,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:27,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:27,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:27,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:27,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:27,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:27,790 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:27,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:27,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:27,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:27,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:41:27,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:41:27,802 INFO L87 Difference]: Start difference. First operand 552 states and 616 transitions. cyclomatic complexity: 73 Second operand 9 states. [2018-11-18 15:41:28,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:28,072 INFO L93 Difference]: Finished difference Result 535 states and 585 transitions. [2018-11-18 15:41:28,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:41:28,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 535 states and 585 transitions. [2018-11-18 15:41:28,075 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 146 [2018-11-18 15:41:28,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 535 states to 485 states and 531 transitions. [2018-11-18 15:41:28,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 485 [2018-11-18 15:41:28,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 485 [2018-11-18 15:41:28,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 485 states and 531 transitions. [2018-11-18 15:41:28,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:28,078 INFO L705 BuchiCegarLoop]: Abstraction has 485 states and 531 transitions. [2018-11-18 15:41:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states and 531 transitions. [2018-11-18 15:41:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 449. [2018-11-18 15:41:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-11-18 15:41:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 493 transitions. [2018-11-18 15:41:28,082 INFO L728 BuchiCegarLoop]: Abstraction has 449 states and 493 transitions. [2018-11-18 15:41:28,083 INFO L608 BuchiCegarLoop]: Abstraction has 449 states and 493 transitions. [2018-11-18 15:41:28,083 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-18 15:41:28,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 493 transitions. [2018-11-18 15:41:28,084 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 141 [2018-11-18 15:41:28,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:28,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:28,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:28,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:28,085 INFO L794 eck$LassoCheckResult]: Stem: 35735#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 35716#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 35711#L40 assume !(0 == mp_add_~a3~0 % 256); 35712#L40-1 mp_add_~nb~0 := 4; 35729#L50 assume !(0 == mp_add_~b3~0 % 256); 35730#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 35746#L61-3 assume true; 35747#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35742#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35743#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 36056#L65-2 assume !(1 == mp_add_~i~0 % 256); 35779#L66-1 assume !(2 == mp_add_~i~0 % 256); 35780#L67-1 assume !(3 == mp_add_~i~0 % 256); 35776#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35775#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 35774#L71-2 assume !(1 == mp_add_~i~0 % 256); 35773#L72-1 assume !(2 == mp_add_~i~0 % 256); 35771#L73-1 assume !(3 == mp_add_~i~0 % 256); 35772#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36022#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36020#L80-1 assume !(1 == mp_add_~i~0 % 256); 36018#L81-1 assume !(2 == mp_add_~i~0 % 256); 36016#L82-1 assume !(3 == mp_add_~i~0 % 256); 36014#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36012#L61-3 assume true; 36010#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35753#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35754#L65 assume !(0 == mp_add_~i~0 % 256); 35717#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; 35718#L66-1 assume !(2 == mp_add_~i~0 % 256); 35849#L67-1 assume !(3 == mp_add_~i~0 % 256); 35850#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35845#L71 assume !(0 == mp_add_~i~0 % 256); 35846#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; 35841#L72-1 assume !(2 == mp_add_~i~0 % 256); 35842#L73-1 assume !(3 == mp_add_~i~0 % 256); 35837#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35838#L76-1 assume !(0 == mp_add_~i~0 % 256); 35833#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 35834#L81-1 assume !(2 == mp_add_~i~0 % 256); 35829#L82-1 assume !(3 == mp_add_~i~0 % 256); 35830#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35825#L61-3 assume true; 35826#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35793#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35792#L65 assume !(0 == mp_add_~i~0 % 256); 35791#L65-2 assume !(1 == mp_add_~i~0 % 256); 35788#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; 35722#L67-1 [2018-11-18 15:41:28,085 INFO L796 eck$LassoCheckResult]: Loop: 35722#L67-1 assume !(3 == mp_add_~i~0 % 256); 35723#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35903#L71 assume !(0 == mp_add_~i~0 % 256); 35902#L71-2 assume !(1 == mp_add_~i~0 % 256); 35901#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; 35894#L73-1 assume !(3 == mp_add_~i~0 % 256); 35891#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 35890#L76-1 assume !(0 == mp_add_~i~0 % 256); 35889#L80-1 assume !(1 == mp_add_~i~0 % 256); 35888#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 35883#L82-1 assume !(3 == mp_add_~i~0 % 256); 35786#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35787#L61-3 assume true; 35782#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35783#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35720#L65 assume !(0 == mp_add_~i~0 % 256); 35721#L65-2 assume !(1 == mp_add_~i~0 % 256); 35750#L66-1 assume !(2 == mp_add_~i~0 % 256); 35822#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; 35821#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35820#L71 assume !(0 == mp_add_~i~0 % 256); 35819#L71-2 assume !(1 == mp_add_~i~0 % 256); 35818#L72-1 assume !(2 == mp_add_~i~0 % 256); 35817#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; 35815#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 35813#L76-1 assume !(0 == mp_add_~i~0 % 256); 35814#L80-1 assume !(1 == mp_add_~i~0 % 256); 35809#L81-1 assume !(2 == mp_add_~i~0 % 256); 35810#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 35805#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35806#L61-3 assume true; 35801#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35802#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35796#L65 assume !(0 == mp_add_~i~0 % 256); 35797#L65-2 assume !(1 == mp_add_~i~0 % 256); 35789#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; 35722#L67-1 [2018-11-18 15:41:28,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:28,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1099852742, now seen corresponding path program 1 times [2018-11-18 15:41:28,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:28,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:28,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:28,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:28,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1094832153, now seen corresponding path program 1 times [2018-11-18 15:41:28,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:28,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:28,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:28,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:28,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:41:28,257 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:41:28,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:41:28,257 INFO L87 Difference]: Start difference. First operand 449 states and 493 transitions. cyclomatic complexity: 50 Second operand 7 states. [2018-11-18 15:41:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:28,353 INFO L93 Difference]: Finished difference Result 475 states and 512 transitions. [2018-11-18 15:41:28,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:41:28,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 475 states and 512 transitions. [2018-11-18 15:41:28,354 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 104 [2018-11-18 15:41:28,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 475 states to 475 states and 512 transitions. [2018-11-18 15:41:28,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2018-11-18 15:41:28,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2018-11-18 15:41:28,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 512 transitions. [2018-11-18 15:41:28,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:28,355 INFO L705 BuchiCegarLoop]: Abstraction has 475 states and 512 transitions. [2018-11-18 15:41:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 512 transitions. [2018-11-18 15:41:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 365. [2018-11-18 15:41:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-18 15:41:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 395 transitions. [2018-11-18 15:41:28,358 INFO L728 BuchiCegarLoop]: Abstraction has 365 states and 395 transitions. [2018-11-18 15:41:28,358 INFO L608 BuchiCegarLoop]: Abstraction has 365 states and 395 transitions. [2018-11-18 15:41:28,358 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-18 15:41:28,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 365 states and 395 transitions. [2018-11-18 15:41:28,359 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 100 [2018-11-18 15:41:28,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:28,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:28,359 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 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, 1, 1] [2018-11-18 15:41:28,359 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:28,360 INFO L794 eck$LassoCheckResult]: Stem: 36671#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 36653#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 36648#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36650#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36670#L44 assume !(0 == mp_add_~a1~0 % 256); 36674#L40-1 mp_add_~nb~0 := 4; 36879#L50 assume !(0 == mp_add_~b3~0 % 256); 36878#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 36877#L61-3 assume true; 36876#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36874#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36875#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36925#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 36924#L71-2 assume !(1 == mp_add_~i~0 % 256); 36922#L72-1 assume !(2 == mp_add_~i~0 % 256); 36920#L73-1 assume !(3 == mp_add_~i~0 % 256); 36919#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36918#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36917#L80-1 assume !(1 == mp_add_~i~0 % 256); 36915#L81-1 assume !(2 == mp_add_~i~0 % 256); 36913#L82-1 assume !(3 == mp_add_~i~0 % 256); 36911#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36909#L61-3 assume true; 36907#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36904#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36903#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36902#L71 assume !(0 == mp_add_~i~0 % 256); 36901#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; 36899#L72-1 assume !(2 == mp_add_~i~0 % 256); 36897#L73-1 assume !(3 == mp_add_~i~0 % 256); 36896#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36849#L76-1 assume !(0 == mp_add_~i~0 % 256); 36893#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 36891#L81-1 assume !(2 == mp_add_~i~0 % 256); 36889#L82-1 assume !(3 == mp_add_~i~0 % 256); 36887#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36885#L61-3 assume true; 36882#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36880#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36830#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36828#L71 assume !(0 == mp_add_~i~0 % 256); 36826#L71-2 assume !(1 == mp_add_~i~0 % 256); 36824#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; 36822#L73-1 assume !(3 == mp_add_~i~0 % 256); 36820#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36816#L76-1 assume !(0 == mp_add_~i~0 % 256); 36817#L80-1 assume !(1 == mp_add_~i~0 % 256); 36813#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 36642#L82-1 assume !(3 == mp_add_~i~0 % 256); 36643#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36662#L61-3 assume true; 36663#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36667#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36669#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36646#L71 assume !(0 == mp_add_~i~0 % 256); 36647#L71-2 assume !(1 == mp_add_~i~0 % 256); 36982#L72-1 assume !(2 == mp_add_~i~0 % 256); 36942#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; 36943#L70 [2018-11-18 15:41:28,360 INFO L796 eck$LassoCheckResult]: Loop: 36943#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36960#L76-1 assume !(0 == mp_add_~i~0 % 256); 36638#L80-1 assume !(1 == mp_add_~i~0 % 256); 36639#L81-1 assume !(2 == mp_add_~i~0 % 256); 36664#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 37002#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37001#L61-3 assume true; 37000#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36999#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36998#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36996#L71 assume !(0 == mp_add_~i~0 % 256); 36640#L71-2 assume !(1 == mp_add_~i~0 % 256); 36641#L72-1 assume !(2 == mp_add_~i~0 % 256); 36668#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; 36943#L70 [2018-11-18 15:41:28,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash 739638960, now seen corresponding path program 1 times [2018-11-18 15:41:28,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:28,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:28,428 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-18 15:41:28,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:28,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:41:28,429 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:28,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:28,429 INFO L82 PathProgramCache]: Analyzing trace with hash -661597147, now seen corresponding path program 1 times [2018-11-18 15:41:28,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:28,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:28,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:28,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 15:41:28,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:28,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 15:41:28,541 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 15:41:28,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 15:41:28,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-11-18 15:41:28,541 INFO L87 Difference]: Start difference. First operand 365 states and 395 transitions. cyclomatic complexity: 36 Second operand 7 states. [2018-11-18 15:41:28,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:28,641 INFO L93 Difference]: Finished difference Result 397 states and 423 transitions. [2018-11-18 15:41:28,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 15:41:28,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 423 transitions. [2018-11-18 15:41:28,642 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 15:41:28,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 397 states and 423 transitions. [2018-11-18 15:41:28,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2018-11-18 15:41:28,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2018-11-18 15:41:28,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 397 states and 423 transitions. [2018-11-18 15:41:28,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:28,643 INFO L705 BuchiCegarLoop]: Abstraction has 397 states and 423 transitions. [2018-11-18 15:41:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states and 423 transitions. [2018-11-18 15:41:28,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 301. [2018-11-18 15:41:28,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-11-18 15:41:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 323 transitions. [2018-11-18 15:41:28,645 INFO L728 BuchiCegarLoop]: Abstraction has 301 states and 323 transitions. [2018-11-18 15:41:28,645 INFO L608 BuchiCegarLoop]: Abstraction has 301 states and 323 transitions. [2018-11-18 15:41:28,645 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-18 15:41:28,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 323 transitions. [2018-11-18 15:41:28,646 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 15:41:28,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:28,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:28,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 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] [2018-11-18 15:41:28,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:28,650 INFO L794 eck$LassoCheckResult]: Stem: 37449#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 37429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 37425#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37426#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37448#L44 assume !(0 == mp_add_~a1~0 % 256); 37451#L40-1 mp_add_~nb~0 := 4; 37606#L50 assume !(0 == mp_add_~b3~0 % 256); 37605#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 37604#L61-3 assume true; 37603#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37601#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37600#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37599#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 37598#L71-2 assume !(1 == mp_add_~i~0 % 256); 37597#L72-1 assume !(2 == mp_add_~i~0 % 256); 37596#L73-1 assume !(3 == mp_add_~i~0 % 256); 37595#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37593#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 37594#L80-1 assume !(1 == mp_add_~i~0 % 256); 37713#L81-1 assume !(2 == mp_add_~i~0 % 256); 37712#L82-1 assume !(3 == mp_add_~i~0 % 256); 37711#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37710#L61-3 assume true; 37709#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37708#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37707#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37706#L71 assume !(0 == mp_add_~i~0 % 256); 37705#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; 37704#L72-1 assume !(2 == mp_add_~i~0 % 256); 37703#L73-1 assume !(3 == mp_add_~i~0 % 256); 37702#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37641#L76-1 assume !(0 == mp_add_~i~0 % 256); 37701#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 37700#L81-1 assume !(2 == mp_add_~i~0 % 256); 37699#L82-1 assume !(3 == mp_add_~i~0 % 256); 37698#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37697#L61-3 assume true; 37696#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37695#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37694#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37693#L71 assume !(0 == mp_add_~i~0 % 256); 37692#L71-2 assume !(1 == mp_add_~i~0 % 256); 37691#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; 37690#L73-1 assume !(3 == mp_add_~i~0 % 256); 37689#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37677#L76-1 assume !(0 == mp_add_~i~0 % 256); 37688#L80-1 assume !(1 == mp_add_~i~0 % 256); 37687#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 37686#L82-1 assume !(3 == mp_add_~i~0 % 256); 37685#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37684#L61-3 assume true; 37683#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37682#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37549#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37681#L71 assume !(0 == mp_add_~i~0 % 256); 37680#L71-2 assume !(1 == mp_add_~i~0 % 256); 37679#L72-1 assume !(2 == mp_add_~i~0 % 256); 37678#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; 37440#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37432#L76-1 assume !(0 == mp_add_~i~0 % 256); 37416#L80-1 assume !(1 == mp_add_~i~0 % 256); 37417#L81-1 assume !(2 == mp_add_~i~0 % 256); 37439#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 37421#L83-1 [2018-11-18 15:41:28,650 INFO L796 eck$LassoCheckResult]: Loop: 37421#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37437#L61-3 assume true; 37438#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37443#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37446#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37424#L71 assume !(0 == mp_add_~i~0 % 256); 37418#L71-2 assume !(1 == mp_add_~i~0 % 256); 37419#L72-1 assume !(2 == mp_add_~i~0 % 256); 37427#L73-1 assume !(3 == mp_add_~i~0 % 256); 37428#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37716#L76-1 assume !(0 == mp_add_~i~0 % 256); 37715#L80-1 assume !(1 == mp_add_~i~0 % 256); 37714#L81-1 assume !(2 == mp_add_~i~0 % 256); 37420#L82-1 assume !(3 == mp_add_~i~0 % 256); 37421#L83-1 [2018-11-18 15:41:28,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:28,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1160041331, now seen corresponding path program 1 times [2018-11-18 15:41:28,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:28,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:28,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:28,732 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 15:41:28,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:28,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 15:41:28,733 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:28,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:28,733 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 1 times [2018-11-18 15:41:28,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:28,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:28,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:28,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:28,828 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:28,828 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:28,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:28,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:28,828 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:41:28,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:28,829 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:28,829 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:28,829 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-18 15:41:28,829 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:28,829 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:28,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:28,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:29,006 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:29,006 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:29,009 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:41:29,009 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:29,043 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:41:29,043 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:41:29,751 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:41:29,753 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:29,753 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:29,753 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:29,753 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:29,753 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:41:29,753 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:29,753 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:29,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:29,754 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-18 15:41:29,754 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:29,754 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:29,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:29,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:29,885 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:29,885 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:41:29,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:29,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:29,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:29,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:29,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,897 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:41:29,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:29,899 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:29,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,903 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:29,904 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:29,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,905 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:41:29,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,906 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:29,907 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:29,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,912 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:29,934 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:29,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,937 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:41:29,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,939 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:29,939 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:29,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:29,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:29,953 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:29,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,954 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:41:29,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,954 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:29,955 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:29,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,957 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:29,959 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:29,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:29,966 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:29,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,966 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:29,967 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:29,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,968 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:41:29,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,969 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:29,969 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:29,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,969 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:29,971 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:29,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:29,988 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:29,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:29,990 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:29,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:29,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:29,992 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:41:29,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:29,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:29,992 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:29,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:29,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:29,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:29,993 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:29,997 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:29,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:30,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:30,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:30,013 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:30,013 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:30,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:30,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:30,014 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:30,014 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:30,015 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:30,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:30,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:30,017 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:41:30,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:30,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:30,017 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:30,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:30,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:30,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:30,018 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:30,019 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:30,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:30,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:30,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:30,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:30,025 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:30,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:30,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:30,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:30,026 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:30,026 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:30,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:30,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:30,029 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:41:30,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:30,030 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:30,030 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:30,030 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:30,030 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:30,030 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:30,030 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:30,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:30,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:30,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:30,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:30,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:30,044 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:30,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:30,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:30,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:30,044 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:30,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:30,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:30,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:30,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 15:41:30,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 15:41:30,050 INFO L87 Difference]: Start difference. First operand 301 states and 323 transitions. cyclomatic complexity: 25 Second operand 8 states. [2018-11-18 15:41:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:30,644 INFO L93 Difference]: Finished difference Result 616 states and 651 transitions. [2018-11-18 15:41:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 15:41:30,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 616 states and 651 transitions. [2018-11-18 15:41:30,645 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 120 [2018-11-18 15:41:30,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 616 states to 585 states and 618 transitions. [2018-11-18 15:41:30,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 585 [2018-11-18 15:41:30,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 585 [2018-11-18 15:41:30,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 585 states and 618 transitions. [2018-11-18 15:41:30,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:30,648 INFO L705 BuchiCegarLoop]: Abstraction has 585 states and 618 transitions. [2018-11-18 15:41:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states and 618 transitions. [2018-11-18 15:41:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 369. [2018-11-18 15:41:30,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-11-18 15:41:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 394 transitions. [2018-11-18 15:41:30,652 INFO L728 BuchiCegarLoop]: Abstraction has 369 states and 394 transitions. [2018-11-18 15:41:30,652 INFO L608 BuchiCegarLoop]: Abstraction has 369 states and 394 transitions. [2018-11-18 15:41:30,652 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-18 15:41:30,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 369 states and 394 transitions. [2018-11-18 15:41:30,653 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 15:41:30,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:30,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:30,654 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 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] [2018-11-18 15:41:30,654 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:30,654 INFO L794 eck$LassoCheckResult]: Stem: 38393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 38377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 38373#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38374#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38392#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38396#L40-1 mp_add_~nb~0 := 4; 38388#L50 assume !(0 == mp_add_~b3~0 % 256); 38389#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 38441#L61-3 assume true; 38442#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38436#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38438#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38729#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 38728#L71-2 assume !(1 == mp_add_~i~0 % 256); 38727#L72-1 assume !(2 == mp_add_~i~0 % 256); 38726#L73-1 assume !(3 == mp_add_~i~0 % 256); 38725#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38724#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 38723#L80-1 assume !(1 == mp_add_~i~0 % 256); 38722#L81-1 assume !(2 == mp_add_~i~0 % 256); 38721#L82-1 assume !(3 == mp_add_~i~0 % 256); 38720#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38719#L61-3 assume true; 38718#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38717#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38716#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38715#L71 assume !(0 == mp_add_~i~0 % 256); 38714#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; 38713#L72-1 assume !(2 == mp_add_~i~0 % 256); 38712#L73-1 assume !(3 == mp_add_~i~0 % 256); 38697#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38696#L76-1 assume !(0 == mp_add_~i~0 % 256); 38695#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 38694#L81-1 assume !(2 == mp_add_~i~0 % 256); 38693#L82-1 assume !(3 == mp_add_~i~0 % 256); 38692#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38691#L61-3 assume true; 38690#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38689#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38688#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38687#L71 assume !(0 == mp_add_~i~0 % 256); 38686#L71-2 assume !(1 == mp_add_~i~0 % 256); 38685#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; 38684#L73-1 assume !(3 == mp_add_~i~0 % 256); 38683#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38679#L76-1 assume !(0 == mp_add_~i~0 % 256); 38680#L80-1 assume !(1 == mp_add_~i~0 % 256); 38677#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 38675#L82-1 assume !(3 == mp_add_~i~0 % 256); 38673#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38671#L61-3 assume true; 38669#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38660#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38621#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38619#L71 assume !(0 == mp_add_~i~0 % 256); 38617#L71-2 assume !(1 == mp_add_~i~0 % 256); 38615#L72-1 assume !(2 == mp_add_~i~0 % 256); 38613#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; 38611#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38609#L76-1 assume !(0 == mp_add_~i~0 % 256); 38608#L80-1 assume !(1 == mp_add_~i~0 % 256); 38607#L81-1 assume !(2 == mp_add_~i~0 % 256); 38606#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 38367#L83-1 [2018-11-18 15:41:30,654 INFO L796 eck$LassoCheckResult]: Loop: 38367#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38383#L61-3 assume true; 38384#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38387#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38390#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38368#L71 assume !(0 == mp_add_~i~0 % 256); 38364#L71-2 assume !(1 == mp_add_~i~0 % 256); 38365#L72-1 assume !(2 == mp_add_~i~0 % 256); 38371#L73-1 assume !(3 == mp_add_~i~0 % 256); 38372#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38378#L76-1 assume !(0 == mp_add_~i~0 % 256); 38362#L80-1 assume !(1 == mp_add_~i~0 % 256); 38363#L81-1 assume !(2 == mp_add_~i~0 % 256); 38366#L82-1 assume !(3 == mp_add_~i~0 % 256); 38367#L83-1 [2018-11-18 15:41:30,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1720741109, now seen corresponding path program 1 times [2018-11-18 15:41:30,654 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:30,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:30,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-18 15:41:30,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 15:41:30,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 15:41:30,748 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:30,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:30,748 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 2 times [2018-11-18 15:41:30,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:30,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:30,819 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:30,819 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:30,819 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:30,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:30,819 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:41:30,819 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:30,819 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:30,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:30,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-18 15:41:30,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:30,819 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:30,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:30,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:30,992 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:30,992 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:30,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:41:30,997 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:31,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:41:31,042 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:41:39,177 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:41:39,179 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:39,179 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:39,180 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:39,180 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:39,180 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:41:39,180 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:39,180 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:39,180 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:39,180 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-18 15:41:39,180 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:39,180 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:39,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:39,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:39,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:39,309 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:41:39,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:39,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:39,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:39,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:39,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,314 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:41:39,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,315 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:39,316 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:39,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,319 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:39,319 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:39,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,320 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:41:39,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,321 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:39,321 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:39,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,325 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:39,325 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:39,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,326 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:41:39,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,327 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:39,328 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:39,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:39,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,333 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:39,333 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:39,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,334 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:41:39,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,334 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:39,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,335 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:39,336 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:39,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:39,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:39,341 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:39,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,342 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:41:39,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,343 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:39,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,343 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:39,345 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:39,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,353 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:39,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,354 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:39,355 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:39,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,356 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:41:39,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:39,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,357 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:39,360 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:39,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,369 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:39,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,370 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:39,371 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:39,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,372 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:41:39,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:39,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,373 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:39,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:39,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,380 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,380 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:39,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,380 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:39,381 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:39,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,383 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:41:39,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,384 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,384 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:39,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,384 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:39,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:39,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:39,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:39,398 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:39,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:39,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:39,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:39,398 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:39,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:39,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:39,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:41:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:41:39,403 INFO L87 Difference]: Start difference. First operand 369 states and 394 transitions. cyclomatic complexity: 28 Second operand 9 states. [2018-11-18 15:41:39,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:39,942 INFO L93 Difference]: Finished difference Result 450 states and 472 transitions. [2018-11-18 15:41:39,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 15:41:39,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 450 states and 472 transitions. [2018-11-18 15:41:39,943 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 88 [2018-11-18 15:41:39,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 450 states to 449 states and 470 transitions. [2018-11-18 15:41:39,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2018-11-18 15:41:39,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2018-11-18 15:41:39,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 449 states and 470 transitions. [2018-11-18 15:41:39,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:39,945 INFO L705 BuchiCegarLoop]: Abstraction has 449 states and 470 transitions. [2018-11-18 15:41:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states and 470 transitions. [2018-11-18 15:41:39,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 303. [2018-11-18 15:41:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-11-18 15:41:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 319 transitions. [2018-11-18 15:41:39,948 INFO L728 BuchiCegarLoop]: Abstraction has 303 states and 319 transitions. [2018-11-18 15:41:39,948 INFO L608 BuchiCegarLoop]: Abstraction has 303 states and 319 transitions. [2018-11-18 15:41:39,949 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-18 15:41:39,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 319 transitions. [2018-11-18 15:41:39,949 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 15:41:39,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:39,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:39,950 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:39,950 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:39,950 INFO L794 eck$LassoCheckResult]: Stem: 39232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 39217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 39212#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 39214#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 39231#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 39235#L40-1 mp_add_~nb~0 := 4; 39284#L50 assume !(0 == mp_add_~b3~0 % 256); 39225#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 39226#L61-3 assume true; 39289#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39288#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 39287#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 39237#L65-2 assume !(1 == mp_add_~i~0 % 256); 39233#L66-1 assume !(2 == mp_add_~i~0 % 256); 39234#L67-1 assume !(3 == mp_add_~i~0 % 256); 39496#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39495#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 39494#L71-2 assume !(1 == mp_add_~i~0 % 256); 39493#L72-1 assume !(2 == mp_add_~i~0 % 256); 39492#L73-1 assume !(3 == mp_add_~i~0 % 256); 39490#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; 39491#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 39503#L80-1 assume !(1 == mp_add_~i~0 % 256); 39502#L81-1 assume !(2 == mp_add_~i~0 % 256); 39501#L82-1 assume !(3 == mp_add_~i~0 % 256); 39500#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39499#L61-3 assume true; 39498#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39497#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39222#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39467#L71 assume !(0 == mp_add_~i~0 % 256); 39465#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; 39463#L72-1 assume !(2 == mp_add_~i~0 % 256); 39460#L73-1 assume !(3 == mp_add_~i~0 % 256); 39461#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; 39476#L76-1 assume !(0 == mp_add_~i~0 % 256); 39475#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 39474#L81-1 assume !(2 == mp_add_~i~0 % 256); 39473#L82-1 assume !(3 == mp_add_~i~0 % 256); 39472#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39471#L61-3 assume true; 39470#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39469#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39468#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39466#L71 assume !(0 == mp_add_~i~0 % 256); 39464#L71-2 assume !(1 == mp_add_~i~0 % 256); 39462#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; 39459#L73-1 assume !(3 == mp_add_~i~0 % 256); 39443#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; 39441#L76-1 assume !(0 == mp_add_~i~0 % 256); 39439#L80-1 assume !(1 == mp_add_~i~0 % 256); 39437#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 39435#L82-1 assume !(3 == mp_add_~i~0 % 256); 39433#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39431#L61-3 assume true; 39429#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39427#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39425#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39423#L71 assume !(0 == mp_add_~i~0 % 256); 39421#L71-2 assume !(1 == mp_add_~i~0 % 256); 39419#L72-1 assume !(2 == mp_add_~i~0 % 256); 39417#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; 39415#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39414#L76-1 assume !(0 == mp_add_~i~0 % 256); 39413#L80-1 assume !(1 == mp_add_~i~0 % 256); 39412#L81-1 assume !(2 == mp_add_~i~0 % 256); 39411#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 39206#L83-1 [2018-11-18 15:41:39,950 INFO L796 eck$LassoCheckResult]: Loop: 39206#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39223#L61-3 assume true; 39224#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39227#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39230#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39207#L71 assume !(0 == mp_add_~i~0 % 256); 39203#L71-2 assume !(1 == mp_add_~i~0 % 256); 39204#L72-1 assume !(2 == mp_add_~i~0 % 256); 39210#L73-1 assume !(3 == mp_add_~i~0 % 256); 39211#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39218#L76-1 assume !(0 == mp_add_~i~0 % 256); 39201#L80-1 assume !(1 == mp_add_~i~0 % 256); 39202#L81-1 assume !(2 == mp_add_~i~0 % 256); 39205#L82-1 assume !(3 == mp_add_~i~0 % 256); 39206#L83-1 [2018-11-18 15:41:39,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:39,951 INFO L82 PathProgramCache]: Analyzing trace with hash -981348295, now seen corresponding path program 1 times [2018-11-18 15:41:39,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:39,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:39,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:39,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:39,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 50 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 15:41:40,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:40,042 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:40,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:40,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 56 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 15:41:40,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:40,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-18 15:41:40,142 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 15:41:40,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:40,143 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 3 times [2018-11-18 15:41:40,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:40,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:40,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:40,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:40,196 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:40,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:40,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:40,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:40,197 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:41:40,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:40,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:40,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:40,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration26_Loop [2018-11-18 15:41:40,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:40,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:40,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:40,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:40,352 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:40,352 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:40,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:41:40,367 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:40,426 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:41:40,426 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:41:52,437 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-18 15:41:52,439 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:52,439 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:52,439 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:52,439 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:52,439 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:41:52,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:52,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:52,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:52,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration26_Loop [2018-11-18 15:41:52,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:52,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:52,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:52,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:52,589 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:52,589 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:41:52,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:52,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:52,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:52,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:52,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,594 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:41:52,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,595 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:52,595 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:52,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,598 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:52,599 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:52,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,599 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:41:52,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,600 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:52,601 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:52,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,605 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,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-11-18 15:41:52,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,606 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:52,606 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:52,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,607 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:41:52,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,608 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:52,609 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:52,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:52,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,614 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:52,614 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:52,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,615 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:41:52,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,615 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:52,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,616 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:52,617 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:52,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,623 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:52,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,623 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:52,624 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:52,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,625 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:41:52,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,625 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:52,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:52,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:52,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,635 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:52,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,635 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:52,636 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:52,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,639 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:41:52,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,640 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:52,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,640 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:52,642 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:52,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,654 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:52,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:52,655 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:52,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,656 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:41:52,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,657 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:52,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,657 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:52,658 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:52,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,663 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,663 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:52,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:52,664 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:52,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,667 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:41:52,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,668 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:52,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:52,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:52,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:52,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:52,679 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:52,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:52,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:52,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:52,679 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:52,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:52,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:52,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:52,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 15:41:52,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 15:41:52,684 INFO L87 Difference]: Start difference. First operand 303 states and 319 transitions. cyclomatic complexity: 19 Second operand 9 states. [2018-11-18 15:41:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:52,853 INFO L93 Difference]: Finished difference Result 438 states and 456 transitions. [2018-11-18 15:41:52,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 15:41:52,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 438 states and 456 transitions. [2018-11-18 15:41:52,855 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 15:41:52,856 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 438 states to 438 states and 456 transitions. [2018-11-18 15:41:52,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 438 [2018-11-18 15:41:52,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 438 [2018-11-18 15:41:52,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 438 states and 456 transitions. [2018-11-18 15:41:52,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:52,856 INFO L705 BuchiCegarLoop]: Abstraction has 438 states and 456 transitions. [2018-11-18 15:41:52,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 456 transitions. [2018-11-18 15:41:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 295. [2018-11-18 15:41:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-18 15:41:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 311 transitions. [2018-11-18 15:41:52,861 INFO L728 BuchiCegarLoop]: Abstraction has 295 states and 311 transitions. [2018-11-18 15:41:52,861 INFO L608 BuchiCegarLoop]: Abstraction has 295 states and 311 transitions. [2018-11-18 15:41:52,862 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-18 15:41:52,862 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 295 states and 311 transitions. [2018-11-18 15:41:52,862 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 46 [2018-11-18 15:41:52,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:52,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:52,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:52,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:52,863 INFO L794 eck$LassoCheckResult]: Stem: 40188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 40170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 40165#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40167#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40187#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 40161#L40-1 mp_add_~nb~0 := 4; 40162#L50 assume !(0 == mp_add_~b3~0 % 256); 40180#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 40181#L61-3 assume true; 40307#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40306#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 40305#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 40280#L65-2 assume !(1 == mp_add_~i~0 % 256); 40281#L66-1 assume !(2 == mp_add_~i~0 % 256); 40174#L67-1 assume !(3 == mp_add_~i~0 % 256); 40175#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40448#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 40447#L71-2 assume !(1 == mp_add_~i~0 % 256); 40446#L72-1 assume !(2 == mp_add_~i~0 % 256); 40445#L73-1 assume !(3 == mp_add_~i~0 % 256); 40179#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 40171#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 40154#L80-1 assume !(1 == mp_add_~i~0 % 256); 40155#L81-1 assume !(2 == mp_add_~i~0 % 256); 40178#L82-1 assume !(3 == mp_add_~i~0 % 256); 40441#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40440#L61-3 assume true; 40439#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40438#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40437#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40436#L71 assume !(0 == mp_add_~i~0 % 256); 40435#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; 40434#L72-1 assume !(2 == mp_add_~i~0 % 256); 40433#L73-1 assume !(3 == mp_add_~i~0 % 256); 40432#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 40424#L76-1 assume !(0 == mp_add_~i~0 % 256); 40431#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 40430#L81-1 assume !(2 == mp_add_~i~0 % 256); 40414#L82-1 assume !(3 == mp_add_~i~0 % 256); 40412#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40410#L61-3 assume true; 40408#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40407#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40406#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40405#L71 assume !(0 == mp_add_~i~0 % 256); 40404#L71-2 assume !(1 == mp_add_~i~0 % 256); 40403#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; 40401#L73-1 assume !(3 == mp_add_~i~0 % 256); 40399#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 40397#L76-1 assume !(0 == mp_add_~i~0 % 256); 40395#L80-1 assume !(1 == mp_add_~i~0 % 256); 40393#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 40391#L82-1 assume !(3 == mp_add_~i~0 % 256); 40389#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40387#L61-3 assume true; 40385#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40383#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40381#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40379#L71 assume !(0 == mp_add_~i~0 % 256); 40377#L71-2 assume !(1 == mp_add_~i~0 % 256); 40375#L72-1 assume !(2 == mp_add_~i~0 % 256); 40373#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; 40371#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 40369#L76-1 assume !(0 == mp_add_~i~0 % 256); 40368#L80-1 assume !(1 == mp_add_~i~0 % 256); 40367#L81-1 assume !(2 == mp_add_~i~0 % 256); 40366#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 40159#L83-1 [2018-11-18 15:41:52,863 INFO L796 eck$LassoCheckResult]: Loop: 40159#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 40176#L61-3 assume true; 40177#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 40182#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 40185#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 40160#L71 assume !(0 == mp_add_~i~0 % 256); 40156#L71-2 assume !(1 == mp_add_~i~0 % 256); 40157#L72-1 assume !(2 == mp_add_~i~0 % 256); 40163#L73-1 assume !(3 == mp_add_~i~0 % 256); 40164#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 40444#L76-1 assume !(0 == mp_add_~i~0 % 256); 40443#L80-1 assume !(1 == mp_add_~i~0 % 256); 40442#L81-1 assume !(2 == mp_add_~i~0 % 256); 40158#L82-1 assume !(3 == mp_add_~i~0 % 256); 40159#L83-1 [2018-11-18 15:41:52,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1199200319, now seen corresponding path program 1 times [2018-11-18 15:41:52,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:52,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:52,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:52,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:52,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:52,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash -399462691, now seen corresponding path program 4 times [2018-11-18 15:41:52,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:52,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:52,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:52,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1043021157, now seen corresponding path program 2 times [2018-11-18 15:41:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:52,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 57 proven. 41 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-18 15:41:53,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:53,107 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:53,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 15:41:53,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 15:41:53,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 15:41:53,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-18 15:41:53,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 15:41:53,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-18 15:41:53,279 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:53,279 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:53,279 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:53,279 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:53,279 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:41:53,279 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:53,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:53,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:53,280 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration27_Loop [2018-11-18 15:41:53,280 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:53,280 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:53,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:53,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:53,461 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:53,461 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:53,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:41:53,466 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:53,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:41:53,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:41:55,773 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:41:55,775 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:55,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:55,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:55,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:55,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:41:55,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:55,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:55,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:55,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration27_Loop [2018-11-18 15:41:55,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:55,776 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:55,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:55,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:55,915 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:55,916 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:41:55,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:55,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:55,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:55,920 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:55,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,920 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:41:55,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,921 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:55,922 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:55,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,925 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:55,925 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:55,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,926 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:41:55,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,927 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:55,927 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:55,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:55,931 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:55,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,932 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:41:55,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,933 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:55,935 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:55,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,939 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:55,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,940 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:55,940 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:55,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,941 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:41:55,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,949 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:55,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,950 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:55,950 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:55,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,955 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:55,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,955 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:55,956 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:55,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,957 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:41:55,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,957 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:55,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,958 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:55,959 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:55,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,966 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,966 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:55,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,967 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:55,968 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:55,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,969 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:41:55,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,970 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:55,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,970 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:55,973 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:55,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,984 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:55,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,985 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:55,986 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:55,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,987 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:41:55,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:55,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,988 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:55,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:55,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,994 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,994 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:55,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,994 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:55,995 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:55,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:55,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:55,997 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:41:55,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:55,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:55,997 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:55,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:55,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:55,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:55,998 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:55,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:55,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:56,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:56,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:56,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:56,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:56,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:56,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:56,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:56,009 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:56,010 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:56,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:56,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 15:41:56,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-18 15:41:56,014 INFO L87 Difference]: Start difference. First operand 295 states and 311 transitions. cyclomatic complexity: 19 Second operand 16 states. [2018-11-18 15:41:56,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:56,522 INFO L93 Difference]: Finished difference Result 278 states and 292 transitions. [2018-11-18 15:41:56,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 15:41:56,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 292 transitions. [2018-11-18 15:41:56,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 15:41:56,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 100 states and 104 transitions. [2018-11-18 15:41:56,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2018-11-18 15:41:56,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2018-11-18 15:41:56,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 104 transitions. [2018-11-18 15:41:56,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:56,523 INFO L705 BuchiCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-11-18 15:41:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 104 transitions. [2018-11-18 15:41:56,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2018-11-18 15:41:56,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 15:41:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-11-18 15:41:56,524 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-18 15:41:56,524 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-18 15:41:56,524 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-18 15:41:56,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 95 transitions. [2018-11-18 15:41:56,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-18 15:41:56,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 15:41:56,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 15:41:56,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 3, 3, 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] [2018-11-18 15:41:56,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 15:41:56,525 INFO L794 eck$LassoCheckResult]: Stem: 41030#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41027#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 41024#L40 assume !(0 == mp_add_~a3~0 % 256); 41021#L40-1 mp_add_~nb~0 := 4; 41022#L50 assume !(0 == mp_add_~b3~0 % 256); 41015#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 41016#L61-3 assume true; 41063#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41062#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41061#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 41060#L65-2 assume !(1 == mp_add_~i~0 % 256); 41059#L66-1 assume !(2 == mp_add_~i~0 % 256); 41058#L67-1 assume !(3 == mp_add_~i~0 % 256); 41057#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41056#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 41055#L71-2 assume !(1 == mp_add_~i~0 % 256); 41054#L72-1 assume !(2 == mp_add_~i~0 % 256); 41053#L73-1 assume !(3 == mp_add_~i~0 % 256); 41052#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 41051#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 41050#L80-1 assume !(1 == mp_add_~i~0 % 256); 41049#L81-1 assume !(2 == mp_add_~i~0 % 256); 41048#L82-1 assume !(3 == mp_add_~i~0 % 256); 41047#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41046#L61-3 assume true; 41045#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41044#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41043#L65 assume !(0 == mp_add_~i~0 % 256); 41042#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; 41041#L66-1 assume !(2 == mp_add_~i~0 % 256); 41040#L67-1 assume !(3 == mp_add_~i~0 % 256); 41039#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41038#L71 assume !(0 == mp_add_~i~0 % 256); 41036#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; 41037#L72-1 assume !(2 == mp_add_~i~0 % 256); 41092#L73-1 assume !(3 == mp_add_~i~0 % 256); 41090#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 41088#L76-1 assume !(0 == mp_add_~i~0 % 256); 41086#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 41084#L81-1 assume !(2 == mp_add_~i~0 % 256); 41082#L82-1 assume !(3 == mp_add_~i~0 % 256); 41080#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41078#L61-3 assume true; 41076#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41074#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41072#L65 assume !(0 == mp_add_~i~0 % 256); 41070#L65-2 assume !(1 == mp_add_~i~0 % 256); 41068#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; 41066#L67-1 assume !(3 == mp_add_~i~0 % 256); 41034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41035#L71 assume !(0 == mp_add_~i~0 % 256); 41094#L71-2 assume !(1 == mp_add_~i~0 % 256); 41093#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; 41091#L73-1 assume !(3 == mp_add_~i~0 % 256); 41089#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 41087#L76-1 assume !(0 == mp_add_~i~0 % 256); 41085#L80-1 assume !(1 == mp_add_~i~0 % 256); 41083#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 41081#L82-1 assume !(3 == mp_add_~i~0 % 256); 41079#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41077#L61-3 assume true; 41075#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41073#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41071#L65 assume !(0 == mp_add_~i~0 % 256); 41069#L65-2 assume !(1 == mp_add_~i~0 % 256); 41067#L66-1 assume !(2 == mp_add_~i~0 % 256); 41064#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; 41065#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 41020#L71 assume !(0 == mp_add_~i~0 % 256); 41010#L71-2 assume !(1 == mp_add_~i~0 % 256); 41011#L72-1 assume !(2 == mp_add_~i~0 % 256); 41023#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; 41025#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 41095#L76-1 assume !(0 == mp_add_~i~0 % 256); 41006#L80-1 assume !(1 == mp_add_~i~0 % 256); 41007#L81-1 assume !(2 == mp_add_~i~0 % 256); 41012#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 41018#L83-1 [2018-11-18 15:41:56,525 INFO L796 eck$LassoCheckResult]: Loop: 41018#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 41008#L61-3 assume true; 41009#L61-1 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 41019#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 41031#L65 assume !(0 == mp_add_~i~0 % 256); 41028#L65-2 assume !(1 == mp_add_~i~0 % 256); 41029#L66-1 assume !(2 == mp_add_~i~0 % 256); 41033#L67-1 assume !(3 == mp_add_~i~0 % 256); 41026#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 41013#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 41014#L76-1 assume !(0 == mp_add_~i~0 % 256); 41032#L80-1 assume !(1 == mp_add_~i~0 % 256); 41096#L81-1 assume !(2 == mp_add_~i~0 % 256); 41017#L82-1 assume !(3 == mp_add_~i~0 % 256); 41018#L83-1 [2018-11-18 15:41:56,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash 883015198, now seen corresponding path program 1 times [2018-11-18 15:41:56,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:56,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:56,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:56,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 15:41:56,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:56,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1506597377, now seen corresponding path program 1 times [2018-11-18 15:41:56,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:56,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:56,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:56,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:56,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 15:41:56,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 15:41:56,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1734680926, now seen corresponding path program 1 times [2018-11-18 15:41:56,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 15:41:56,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 15:41:56,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:56,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:56,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 15:41:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:56,850 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 76 proven. 34 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 15:41:56,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 15:41:56,850 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 15:41:56,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 15:41:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 15:41:56,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 15:41:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-18 15:41:56,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-18 15:41:56,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 14 [2018-11-18 15:41:57,036 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:57,037 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:57,037 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:57,037 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:57,037 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 15:41:57,037 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:57,037 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:57,037 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:57,037 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration28_Loop [2018-11-18 15:41:57,037 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:57,037 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:57,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:57,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:57,189 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:57,190 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:57,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 15:41:57,199 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_282cb96e-1405-48e8-8723-9383aaf1808e/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:57,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 15:41:57,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 15:41:57,590 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 15:41:57,592 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 15:41:57,592 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 15:41:57,592 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 15:41:57,592 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 15:41:57,592 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 15:41:57,593 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 15:41:57,593 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 15:41:57,593 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 15:41:57,593 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration28_Loop [2018-11-18 15:41:57,593 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 15:41:57,593 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 15:41:57,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:57,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 15:41:57,714 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 15:41:57,714 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 15:41:57,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:57,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:57,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 15:41:57,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 15:41:57,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,719 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 15:41:57,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,720 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:57,720 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:57,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,725 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:57,725 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:57,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,726 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 15:41:57,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,726 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:57,727 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:57,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,730 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:57,731 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:57,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,731 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 15:41:57,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,732 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:57,733 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:57,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 15:41:57,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,736 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:57,737 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:57,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,738 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 15:41:57,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,738 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:57,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,739 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:57,739 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:57,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,743 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,744 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:57,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,744 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 15:41:57,744 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 15:41:57,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,745 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 15:41:57,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,746 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:57,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,746 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:57,747 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:57,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,753 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 15:41:57,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:57,754 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:57,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,756 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 15:41:57,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,756 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:57,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:57,759 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:57,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,767 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,767 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:57,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,768 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 15:41:57,769 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 15:41:57,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,770 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 15:41:57,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,770 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:57,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,771 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:57,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:57,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,776 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 15:41:57,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 15:41:57,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 15:41:57,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,779 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 15:41:57,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,780 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:57,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,780 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:57,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:57,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 15:41:57,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 15:41:57,791 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 15:41:57,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 15:41:57,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 15:41:57,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 15:41:57,791 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 15:41:57,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 15:41:57,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 15:41:57,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 15:41:57,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 15:41:57,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-11-18 15:41:57,796 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. cyclomatic complexity: 5 Second operand 14 states. [2018-11-18 15:41:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 15:41:58,168 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2018-11-18 15:41:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 15:41:58,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 84 transitions. [2018-11-18 15:41:58,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:41:58,169 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 0 states and 0 transitions. [2018-11-18 15:41:58,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 15:41:58,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 15:41:58,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 15:41:58,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 15:41:58,169 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:41:58,169 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:41:58,169 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 15:41:58,169 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-18 15:41:58,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 15:41:58,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 15:41:58,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 15:41:58,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 03:41:58 BoogieIcfgContainer [2018-11-18 15:41:58,175 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 15:41:58,175 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 15:41:58,175 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 15:41:58,176 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 15:41:58,176 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 03:41:02" (3/4) ... [2018-11-18 15:41:58,179 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 15:41:58,179 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 15:41:58,179 INFO L168 Benchmark]: Toolchain (without parser) took 56364.83 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.0 MB). Free memory was 959.2 MB in the beginning and 1.2 GB in the end (delta: -248.4 MB). Peak memory consumption was 183.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:41:58,180 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:41:58,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 196.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-18 15:41:58,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -218.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:41:58,182 INFO L168 Benchmark]: Boogie Preprocessor took 19.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-18 15:41:58,182 INFO L168 Benchmark]: RCFGBuilder took 238.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2018-11-18 15:41:58,183 INFO L168 Benchmark]: BuchiAutomizer took 55840.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 266.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.6 MB). Peak memory consumption was 197.8 MB. Max. memory is 11.5 GB. [2018-11-18 15:41:58,183 INFO L168 Benchmark]: Witness Printer took 3.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 15:41:58,186 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 196.48 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -218.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 238.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 55840.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 266.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -68.6 MB). Peak memory consumption was 197.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.58 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 28 terminating modules (28 trivial, 0 deterministic, 0 nondeterministic). 28 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 55.8s and 29 iterations. TraceHistogramMax:8. Analysis of lassos took 33.0s. Construction of modules took 9.8s. Büchi inclusion checks took 12.3s. Highest rank in rank-based complementation 0. Minimization of det autom 28. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 6945 StatesRemovedByMinimization, 26 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1506 states and ocurred in iteration 16. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1163 SDtfs, 6977 SDslu, 2795 SDs, 0 SdLazy, 10374 SolverSat, 1336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.8s Time LassoAnalysisResults: nont0 unkn0 SFLI18 SFLT0 conc2 concLT0 SILN0 SILU4 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital52 mio100 ax100 hnf97 lsp81 ukn100 mio100 lsp100 div451 bol100 ite100 ukn100 eq144 hnf46 smp72 dnf100 smp100 tf102 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 24.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...