./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-aa41828 [2018-11-23 00:15:16,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:15:16,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:15:16,256 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:15:16,256 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:15:16,257 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:15:16,258 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:15:16,259 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:15:16,260 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:15:16,261 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:15:16,261 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:15:16,262 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:15:16,262 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:15:16,263 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:15:16,264 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:15:16,264 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:15:16,265 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:15:16,266 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:15:16,268 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:15:16,269 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:15:16,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:15:16,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:15:16,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:15:16,272 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:15:16,273 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:15:16,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:15:16,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:15:16,274 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:15:16,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:15:16,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:15:16,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:15:16,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:15:16,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:15:16,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:15:16,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:15:16,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:15:16,278 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 00:15:16,290 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:15:16,290 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:15:16,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:15:16,291 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:15:16,291 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:15:16,292 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:15:16,292 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:15:16,292 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:15:16,292 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:15:16,292 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:15:16,292 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:15:16,293 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:15:16,293 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 00:15:16,293 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:15:16,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:15:16,293 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 00:15:16,293 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:15:16,293 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:15:16,293 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:15:16,294 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:15:16,294 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 00:15:16,294 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:15:16,294 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:15:16,294 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:15:16,294 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:15:16,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:15:16,295 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:15:16,295 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:15:16,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:15:16,295 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:15:16,295 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:15:16,296 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:15:16,296 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_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:15:16,322 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:15:16,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:15:16,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:15:16,335 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:15:16,335 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:15:16,336 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/../../sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-23 00:15:16,379 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/data/d84d005df/0c8828de8bcf41d38232a017a3c484fc/FLAGe4064c3d9 [2018-11-23 00:15:16,784 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:15:16,784 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/sv-benchmarks/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-23 00:15:16,789 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/data/d84d005df/0c8828de8bcf41d38232a017a3c484fc/FLAGe4064c3d9 [2018-11-23 00:15:16,800 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/data/d84d005df/0c8828de8bcf41d38232a017a3c484fc [2018-11-23 00:15:16,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:15:16,804 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:15:16,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:15:16,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:15:16,807 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:15:16,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:16" (1/1) ... [2018-11-23 00:15:16,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd9ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:16, skipping insertion in model container [2018-11-23 00:15:16,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:15:16" (1/1) ... [2018-11-23 00:15:16,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:15:16,834 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:15:16,968 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:15:16,971 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:15:16,995 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:15:17,007 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:15:17,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17 WrapperNode [2018-11-23 00:15:17,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:15:17,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:15:17,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:15:17,008 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:15:17,013 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:15:17,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:15:17,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:15:17,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:15:17,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... [2018-11-23 00:15:17,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:15:17,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:15:17,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:15:17,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:15:17,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:15:17,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:15:17,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:15:17,363 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:15:17,363 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 00:15:17,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:17 BoogieIcfgContainer [2018-11-23 00:15:17,364 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:15:17,364 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:15:17,365 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:15:17,367 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:15:17,368 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:15:17,368 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:15:16" (1/3) ... [2018-11-23 00:15:17,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35d8eaee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:15:17, skipping insertion in model container [2018-11-23 00:15:17,369 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:15:17,369 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:15:17" (2/3) ... [2018-11-23 00:15:17,369 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@35d8eaee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:15:17, skipping insertion in model container [2018-11-23 00:15:17,370 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:15:17,370 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:17" (3/3) ... [2018-11-23 00:15:17,371 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2018-11-23 00:15:17,410 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:15:17,411 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:15:17,411 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:15:17,411 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:15:17,411 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:15:17,411 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:15:17,411 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:15:17,411 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:15:17,411 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:15:17,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-23 00:15:17,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-23 00:15:17,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:17,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:17,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 00:15:17,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:17,439 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:15:17,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2018-11-23 00:15:17,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2018-11-23 00:15:17,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:17,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:17,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 00:15:17,441 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:17,447 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L40true assume !(0 == mp_add_~a3~0 % 256); 8#L40-1true mp_add_~nb~0 := 4; 29#L50true assume !(0 == mp_add_~b3~0 % 256); 27#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-2true [2018-11-23 00:15:17,448 INFO L796 eck$LassoCheckResult]: Loop: 23#L61-2true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25#L70true assume !(mp_add_~partial_sum~0 % 65536 > 255); 13#L76-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22#L81-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23#L61-2true [2018-11-23 00:15:17,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2018-11-23 00:15:17,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:17,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:17,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:17,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2018-11-23 00:15:17,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:17,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:17,586 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-23 00:15:17,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:17,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:15:17,590 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:15:17,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:15:17,601 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-11-23 00:15:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:17,771 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2018-11-23 00:15:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:15:17,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2018-11-23 00:15:17,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-23 00:15:17,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2018-11-23 00:15:17,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-23 00:15:17,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2018-11-23 00:15:17,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2018-11-23 00:15:17,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:17,779 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2018-11-23 00:15:17,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2018-11-23 00:15:17,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-11-23 00:15:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 00:15:17,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2018-11-23 00:15:17,805 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-11-23 00:15:17,806 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2018-11-23 00:15:17,806 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:15:17,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2018-11-23 00:15:17,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-23 00:15:17,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:17,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:17,808 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:17,808 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:17,808 INFO L794 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 123#L40 assume !(0 == mp_add_~a3~0 % 256); 120#L40-1 mp_add_~nb~0 := 4; 121#L50 assume !(0 == mp_add_~b3~0 % 256); 131#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 138#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 139#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 136#L64-1 [2018-11-23 00:15:17,808 INFO L796 eck$LassoCheckResult]: Loop: 136#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 126#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 129#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 112#L80-1 assume !(1 == mp_add_~i~0 % 256); 113#L81-1 assume !(2 == mp_add_~i~0 % 256); 118#L82-1 assume !(3 == mp_add_~i~0 % 256); 119#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 143#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 159#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 160#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 127#L65-2 assume !(1 == mp_add_~i~0 % 256); 128#L66-1 assume !(2 == mp_add_~i~0 % 256); 135#L67-1 assume !(3 == mp_add_~i~0 % 256); 136#L64-1 [2018-11-23 00:15:17,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2018-11-23 00:15:17,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:17,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:17,965 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-23 00:15:17,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:17,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:17,965 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:15:17,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:17,966 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2018-11-23 00:15:17,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:17,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:17,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:18,054 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-23 00:15:18,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:18,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:18,055 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:15:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:15:18,056 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2018-11-23 00:15:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:18,521 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2018-11-23 00:15:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 00:15:18,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2018-11-23 00:15:18,528 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2018-11-23 00:15:18,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2018-11-23 00:15:18,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2018-11-23 00:15:18,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2018-11-23 00:15:18,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2018-11-23 00:15:18,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:18,532 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2018-11-23 00:15:18,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2018-11-23 00:15:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2018-11-23 00:15:18,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-11-23 00:15:18,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2018-11-23 00:15:18,544 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-11-23 00:15:18,544 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2018-11-23 00:15:18,545 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:15:18,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2018-11-23 00:15:18,546 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2018-11-23 00:15:18,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:18,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:18,548 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:18,548 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:18,548 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 410#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 412#L42 assume !(0 == mp_add_~a2~0 % 256); 406#L40-1 mp_add_~nb~0 := 4; 407#L50 assume !(0 == mp_add_~b3~0 % 256); 433#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 485#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 488#L64-1 [2018-11-23 00:15:18,548 INFO L796 eck$LassoCheckResult]: Loop: 488#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 492#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 417#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 418#L80-1 assume !(1 == mp_add_~i~0 % 256); 428#L81-1 assume !(2 == mp_add_~i~0 % 256); 404#L82-1 assume !(3 == mp_add_~i~0 % 256); 405#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 438#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 448#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 443#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 415#L65-2 assume !(1 == mp_add_~i~0 % 256); 416#L66-1 assume !(2 == mp_add_~i~0 % 256); 444#L67-1 assume !(3 == mp_add_~i~0 % 256); 488#L64-1 [2018-11-23 00:15:18,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:18,549 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2018-11-23 00:15:18,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:18,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:18,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:18,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:18,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:18,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:18,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:18,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 00:15:18,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:15:18,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2018-11-23 00:15:18,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:18,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:18,746 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-23 00:15:18,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:18,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:18,747 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:15:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:15:18,747 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2018-11-23 00:15:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:19,362 INFO L93 Difference]: Finished difference Result 373 states and 546 transitions. [2018-11-23 00:15:19,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:15:19,362 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 546 transitions. [2018-11-23 00:15:19,365 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 255 [2018-11-23 00:15:19,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 546 transitions. [2018-11-23 00:15:19,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2018-11-23 00:15:19,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-23 00:15:19,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 546 transitions. [2018-11-23 00:15:19,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:19,371 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 546 transitions. [2018-11-23 00:15:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 546 transitions. [2018-11-23 00:15:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 201. [2018-11-23 00:15:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-11-23 00:15:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2018-11-23 00:15:19,392 INFO L728 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-11-23 00:15:19,392 INFO L608 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2018-11-23 00:15:19,392 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 00:15:19,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 289 transitions. [2018-11-23 00:15:19,395 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2018-11-23 00:15:19,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:19,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:19,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:19,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:19,396 INFO L794 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 937#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 938#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 965#L44 assume !(0 == mp_add_~a1~0 % 256); 969#L40-1 mp_add_~nb~0 := 4; 988#L50 assume !(0 == mp_add_~b3~0 % 256); 985#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 983#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 984#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 951#L64-1 [2018-11-23 00:15:19,396 INFO L796 eck$LassoCheckResult]: Loop: 951#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 940#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 943#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 944#L80-1 assume !(1 == mp_add_~i~0 % 256); 1081#L81-1 assume !(2 == mp_add_~i~0 % 256); 931#L82-1 assume !(3 == mp_add_~i~0 % 256); 932#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 972#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 973#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 968#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 941#L65-2 assume !(1 == mp_add_~i~0 % 256); 942#L66-1 assume !(2 == mp_add_~i~0 % 256); 950#L67-1 assume !(3 == mp_add_~i~0 % 256); 951#L64-1 [2018-11-23 00:15:19,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1341941206, now seen corresponding path program 1 times [2018-11-23 00:15:19,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:19,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:19,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:19,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:19,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:19,517 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-23 00:15:19,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:19,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 00:15:19,517 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:15:19,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 3 times [2018-11-23 00:15:19,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:19,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:19,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:19,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:19,553 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-23 00:15:19,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:19,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:19,553 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:19,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:15:19,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:15:19,554 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. cyclomatic complexity: 93 Second operand 8 states. [2018-11-23 00:15:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:20,484 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2018-11-23 00:15:20,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:15:20,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 616 transitions. [2018-11-23 00:15:20,488 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 306 [2018-11-23 00:15:20,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 616 transitions. [2018-11-23 00:15:20,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2018-11-23 00:15:20,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2018-11-23 00:15:20,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 616 transitions. [2018-11-23 00:15:20,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:20,492 INFO L705 BuchiCegarLoop]: Abstraction has 418 states and 616 transitions. [2018-11-23 00:15:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 616 transitions. [2018-11-23 00:15:20,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2018-11-23 00:15:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-11-23 00:15:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2018-11-23 00:15:20,504 INFO L728 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-11-23 00:15:20,504 INFO L608 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2018-11-23 00:15:20,504 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 00:15:20,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 395 transitions. [2018-11-23 00:15:20,506 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2018-11-23 00:15:20,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:20,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:20,508 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:20,508 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:20,509 INFO L794 eck$LassoCheckResult]: Stem: 1613#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1581#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1583#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1611#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 1617#L40-1 mp_add_~nb~0 := 4; 1625#L50 assume !(0 == mp_add_~b3~0 % 256); 1620#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1621#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1762#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1808#L64-1 [2018-11-23 00:15:20,509 INFO L796 eck$LassoCheckResult]: Loop: 1808#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1585#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1588#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1569#L80-1 assume !(1 == mp_add_~i~0 % 256); 1570#L81-1 assume !(2 == mp_add_~i~0 % 256); 1575#L82-1 assume !(3 == mp_add_~i~0 % 256); 1576#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1622#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1756#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1614#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1586#L65-2 assume !(1 == mp_add_~i~0 % 256); 1587#L66-1 assume !(2 == mp_add_~i~0 % 256); 1815#L67-1 assume !(3 == mp_add_~i~0 % 256); 1808#L64-1 [2018-11-23 00:15:20,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199508, now seen corresponding path program 1 times [2018-11-23 00:15:20,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:20,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:20,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:20,602 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-23 00:15:20,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:20,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 00:15:20,603 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:15:20,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:20,603 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 4 times [2018-11-23 00:15:20,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:20,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:20,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:20,636 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-23 00:15:20,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:20,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:20,637 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:20,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:15:20,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:15:20,637 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. cyclomatic complexity: 126 Second operand 8 states. [2018-11-23 00:15:21,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:21,334 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2018-11-23 00:15:21,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:15:21,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 533 transitions. [2018-11-23 00:15:21,337 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2018-11-23 00:15:21,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 533 transitions. [2018-11-23 00:15:21,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-11-23 00:15:21,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-11-23 00:15:21,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 533 transitions. [2018-11-23 00:15:21,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:21,339 INFO L705 BuchiCegarLoop]: Abstraction has 375 states and 533 transitions. [2018-11-23 00:15:21,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 533 transitions. [2018-11-23 00:15:21,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 300. [2018-11-23 00:15:21,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 00:15:21,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 431 transitions. [2018-11-23 00:15:21,346 INFO L728 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-11-23 00:15:21,346 INFO L608 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2018-11-23 00:15:21,347 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 00:15:21,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 431 transitions. [2018-11-23 00:15:21,348 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-11-23 00:15:21,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:21,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:21,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:21,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:21,349 INFO L794 eck$LassoCheckResult]: Stem: 2298#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2263#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2265#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2294#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 2259#L40-1 mp_add_~nb~0 := 4; 2260#L50 assume !(0 == mp_add_~b3~0 % 256); 2271#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2286#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2485#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2018-11-23 00:15:21,349 INFO L796 eck$LassoCheckResult]: Loop: 2272#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2273#L65-2 assume !(1 == mp_add_~i~0 % 256); 2510#L66-1 assume !(2 == mp_add_~i~0 % 256); 2509#L67-1 assume !(3 == mp_add_~i~0 % 256); 2506#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2504#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2503#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2494#L80-1 assume !(1 == mp_add_~i~0 % 256); 2502#L81-1 assume !(2 == mp_add_~i~0 % 256); 2490#L82-1 assume !(3 == mp_add_~i~0 % 256); 2488#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2486#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2487#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2272#L65 [2018-11-23 00:15:21,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 1 times [2018-11-23 00:15:21,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:21,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:21,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:21,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:21,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:21,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:21,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 5 times [2018-11-23 00:15:21,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:21,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:21,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:21,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:21,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:21,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:21,384 INFO L82 PathProgramCache]: Analyzing trace with hash -833715526, now seen corresponding path program 1 times [2018-11-23 00:15:21,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:21,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:21,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:21,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:21,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:21,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:21,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 00:15:21,574 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:21,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:21,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:21,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:21,575 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 00:15:21,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:21,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:21,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:21,576 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-23 00:15:21,576 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:21,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:21,594 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-23 00:15:21,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-23 00:15:21,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:21,758 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:21,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:15:21,761 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:21,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 00:15:21,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:15:23,324 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 00:15:23,326 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:23,326 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:23,326 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:23,326 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:23,326 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:15:23,326 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:23,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:23,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:23,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2018-11-23 00:15:23,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:23,327 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:23,327 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-23 00:15:23,333 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-23 00:15:23,504 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:23,508 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:15:23,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:23,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:23,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:23,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:23,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,522 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:15:23,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:23,525 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:23,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,528 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:23,529 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:23,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,535 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:15:23,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,536 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:23,537 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:23,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,540 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:23,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:23,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,549 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:15:23,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:23,552 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:23,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:23,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,556 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:23,557 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:23,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,562 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:15:23,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,563 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,563 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:23,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,564 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:23,566 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:23,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,572 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,572 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:23,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,572 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:23,574 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:23,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,583 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:15:23,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,584 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,584 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:23,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,584 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:23,587 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:23,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,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-23 00:15:23,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,592 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:23,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:23,596 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:23,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,607 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:15:23,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,608 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:23,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,609 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:23,614 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:23,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,617 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:23,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,617 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:23,621 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:23,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,634 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:15:23,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-23 00:15:23,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,635 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:23,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,635 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:23,637 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:23,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,643 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,644 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:23,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:23,645 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:23,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,653 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:15:23,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-23 00:15:23,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:23,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,654 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:23,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:23,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:23,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:23,668 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:23,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:23,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:23,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:23,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:23,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:23,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:23,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:15:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:15:23,688 INFO L87 Difference]: Start difference. First operand 300 states and 431 transitions. cyclomatic complexity: 139 Second operand 6 states. [2018-11-23 00:15:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:23,987 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2018-11-23 00:15:23,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:15:23,988 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 882 transitions. [2018-11-23 00:15:23,991 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 325 [2018-11-23 00:15:23,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 612 states and 882 transitions. [2018-11-23 00:15:23,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2018-11-23 00:15:23,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2018-11-23 00:15:23,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 882 transitions. [2018-11-23 00:15:23,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:23,995 INFO L705 BuchiCegarLoop]: Abstraction has 612 states and 882 transitions. [2018-11-23 00:15:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 882 transitions. [2018-11-23 00:15:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 380. [2018-11-23 00:15:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-11-23 00:15:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2018-11-23 00:15:24,002 INFO L728 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-11-23 00:15:24,002 INFO L608 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2018-11-23 00:15:24,003 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 00:15:24,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 520 transitions. [2018-11-23 00:15:24,004 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2018-11-23 00:15:24,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:24,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:24,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:24,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:24,005 INFO L794 eck$LassoCheckResult]: Stem: 3219#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3190#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3191#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3217#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 3222#L40-1 mp_add_~nb~0 := 4; 3451#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3216#L52 assume !(0 == mp_add_~b2~0 % 256); 3196#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3210#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3525#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2018-11-23 00:15:24,005 INFO L796 eck$LassoCheckResult]: Loop: 3524#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3523#L65-2 assume !(1 == mp_add_~i~0 % 256); 3522#L66-1 assume !(2 == mp_add_~i~0 % 256); 3521#L67-1 assume !(3 == mp_add_~i~0 % 256); 3520#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3189#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3194#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3176#L80-1 assume !(1 == mp_add_~i~0 % 256); 3177#L81-1 assume !(2 == mp_add_~i~0 % 256); 3261#L82-1 assume !(3 == mp_add_~i~0 % 256); 3254#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3245#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3246#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3524#L65 [2018-11-23 00:15:24,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash -438599534, now seen corresponding path program 1 times [2018-11-23 00:15:24,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:24,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:24,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:24,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:24,048 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-23 00:15:24,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:24,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 00:15:24,048 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:15:24,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:24,049 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 6 times [2018-11-23 00:15:24,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:24,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:24,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:24,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:24,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:24,111 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:24,111 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:24,111 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:24,111 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:24,111 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 00:15:24,111 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:24,111 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:24,111 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:24,111 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-23 00:15:24,111 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:24,112 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:24,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:15:24,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:15:24,272 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:24,272 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:24,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:15:24,275 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:24,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 00:15:24,307 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:15:36,322 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-23 00:15:36,324 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:36,324 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:36,324 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:36,324 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:36,324 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:15:36,324 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:36,324 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:36,325 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:36,325 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2018-11-23 00:15:36,325 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:36,325 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:36,325 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-23 00:15:36,335 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-23 00:15:36,481 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:36,481 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:15:36,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:36,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:36,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:36,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:36,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,489 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:15:36,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,490 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:36,490 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:36,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,494 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:36,495 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:36,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,496 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:15:36,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:36,498 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:36,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:36,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:36,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,505 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:15:36,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,506 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:36,507 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:36,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:36,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,513 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:36,514 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:36,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,515 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:15:36,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,516 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:36,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,516 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:36,517 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:36,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,523 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:36,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,523 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:36,524 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:36,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,526 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:15:36,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,527 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:36,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:36,529 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:36,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,541 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:36,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,541 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:36,546 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:36,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,550 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:15:36,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,551 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,551 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:36,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:36,554 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:36,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,570 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:36,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,570 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:36,576 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:36,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,578 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:15:36,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,579 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:36,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,579 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:36,580 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:36,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,588 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:36,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,589 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:36,590 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:36,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,595 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:15:36,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,595 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,595 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:36,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,596 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:36,597 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:36,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:36,612 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:36,612 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:36,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:36,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:36,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:36,613 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:36,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:36,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:36,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:36,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:15:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:15:36,624 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. cyclomatic complexity: 148 Second operand 3 states. [2018-11-23 00:15:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:36,636 INFO L93 Difference]: Finished difference Result 295 states and 401 transitions. [2018-11-23 00:15:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:15:36,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 401 transitions. [2018-11-23 00:15:36,638 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2018-11-23 00:15:36,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 295 states and 401 transitions. [2018-11-23 00:15:36,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2018-11-23 00:15:36,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2018-11-23 00:15:36,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 401 transitions. [2018-11-23 00:15:36,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:36,640 INFO L705 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-11-23 00:15:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 401 transitions. [2018-11-23 00:15:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-11-23 00:15:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-11-23 00:15:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2018-11-23 00:15:36,645 INFO L728 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-11-23 00:15:36,645 INFO L608 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2018-11-23 00:15:36,645 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 00:15:36,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 295 states and 401 transitions. [2018-11-23 00:15:36,646 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2018-11-23 00:15:36,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:36,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:36,647 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:36,647 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:36,647 INFO L794 eck$LassoCheckResult]: Stem: 3896#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3871#L40 assume !(0 == mp_add_~a3~0 % 256); 3867#L40-1 mp_add_~nb~0 := 4; 3868#L50 assume !(0 == mp_add_~b3~0 % 256); 3889#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3884#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3885#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3876#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3873#L65-2 assume !(1 == mp_add_~i~0 % 256); 3874#L66-1 assume !(2 == mp_add_~i~0 % 256); 3879#L67-1 assume !(3 == mp_add_~i~0 % 256); 3880#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4136#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4135#L71-2 assume !(1 == mp_add_~i~0 % 256); 4134#L72-1 assume !(2 == mp_add_~i~0 % 256); 4133#L73-1 assume !(3 == mp_add_~i~0 % 256); 4132#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4131#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4130#L80-1 assume !(1 == mp_add_~i~0 % 256); 4129#L81-1 assume !(2 == mp_add_~i~0 % 256); 4128#L82-1 assume !(3 == mp_add_~i~0 % 256); 4127#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4126#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4125#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2018-11-23 00:15:36,648 INFO L796 eck$LassoCheckResult]: Loop: 4112#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4123#L65-2 assume !(1 == mp_add_~i~0 % 256); 4121#L66-1 assume !(2 == mp_add_~i~0 % 256); 4119#L67-1 assume !(3 == mp_add_~i~0 % 256); 4117#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4115#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4113#L71-2 assume !(1 == mp_add_~i~0 % 256); 4110#L72-1 assume !(2 == mp_add_~i~0 % 256); 4091#L73-1 assume !(3 == mp_add_~i~0 % 256); 3888#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3875#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3857#L80-1 assume !(1 == mp_add_~i~0 % 256); 3858#L81-1 assume !(2 == mp_add_~i~0 % 256); 3863#L82-1 assume !(3 == mp_add_~i~0 % 256); 3864#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3919#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3920#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4112#L65 [2018-11-23 00:15:36,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 1 times [2018-11-23 00:15:36,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:36,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:36,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:36,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:36,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1235554401, now seen corresponding path program 1 times [2018-11-23 00:15:36,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:36,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:36,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:36,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:36,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash 350902213, now seen corresponding path program 1 times [2018-11-23 00:15:36,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:36,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:36,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:36,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:36,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:36,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:36,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:36,871 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:36,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:36,871 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:36,871 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:36,871 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 00:15:36,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:36,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:36,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:36,872 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-23 00:15:36,872 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:36,872 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:36,873 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-23 00:15:36,883 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-23 00:15:37,017 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2018-11-23 00:15:37,170 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2018-11-23 00:15:37,248 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:37,248 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:37,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:15:37,251 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:37,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 00:15:37,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:15:38,225 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 00:15:38,227 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:38,227 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:38,227 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:38,227 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:38,227 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:15:38,227 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:38,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:38,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:38,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2018-11-23 00:15:38,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:38,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:38,228 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-23 00:15:38,234 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-23 00:15:38,410 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:38,410 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:15:38,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:38,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:38,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:38,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:38,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,417 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:15:38,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,418 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:38,418 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:38,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,422 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:38,423 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:38,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,424 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:15:38,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,425 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:38,426 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:38,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,430 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:38,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:38,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,433 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:15:38,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,434 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:38,434 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:38,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:38,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,439 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:38,440 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:38,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,442 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:15:38,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,443 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:38,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,443 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:38,444 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:38,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,449 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,449 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,449 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:38,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,450 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:38,451 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:38,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,453 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:15:38,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,454 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:38,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,454 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:38,455 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:38,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,464 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,464 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:38,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:38,467 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:38,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,470 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:15:38,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,471 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,471 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:38,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,472 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:38,474 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:38,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,483 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,483 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:38,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,483 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:38,487 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:38,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,489 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:15:38,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,490 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:38,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,490 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:38,491 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:38,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,496 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,496 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:38,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,497 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:38,498 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:38,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,503 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:15:38,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,503 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,503 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:38,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,504 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:38,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:38,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:38,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:38,513 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:38,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:38,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:38,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:38,514 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:38,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:38,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:38,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:15:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:15:38,526 INFO L87 Difference]: Start difference. First operand 295 states and 401 transitions. cyclomatic complexity: 113 Second operand 4 states. [2018-11-23 00:15:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:38,640 INFO L93 Difference]: Finished difference Result 404 states and 572 transitions. [2018-11-23 00:15:38,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:15:38,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 572 transitions. [2018-11-23 00:15:38,642 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 283 [2018-11-23 00:15:38,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 402 states and 570 transitions. [2018-11-23 00:15:38,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2018-11-23 00:15:38,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2018-11-23 00:15:38,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 570 transitions. [2018-11-23 00:15:38,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:38,644 INFO L705 BuchiCegarLoop]: Abstraction has 402 states and 570 transitions. [2018-11-23 00:15:38,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 570 transitions. [2018-11-23 00:15:38,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 364. [2018-11-23 00:15:38,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-23 00:15:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 507 transitions. [2018-11-23 00:15:38,648 INFO L728 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2018-11-23 00:15:38,648 INFO L608 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2018-11-23 00:15:38,648 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 00:15:38,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 507 transitions. [2018-11-23 00:15:38,650 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 245 [2018-11-23 00:15:38,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:38,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:38,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:38,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:38,651 INFO L794 eck$LassoCheckResult]: Stem: 4602#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4576#L40 assume !(0 == mp_add_~a3~0 % 256); 4573#L40-1 mp_add_~nb~0 := 4; 4574#L50 assume !(0 == mp_add_~b3~0 % 256); 4596#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4597#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4860#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4859#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4858#L65-2 assume !(1 == mp_add_~i~0 % 256); 4857#L66-1 assume !(2 == mp_add_~i~0 % 256); 4856#L67-1 assume !(3 == mp_add_~i~0 % 256); 4855#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4854#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4853#L71-2 assume !(1 == mp_add_~i~0 % 256); 4852#L72-1 assume !(2 == mp_add_~i~0 % 256); 4851#L73-1 assume !(3 == mp_add_~i~0 % 256); 4850#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4848#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4847#L80-1 assume !(1 == mp_add_~i~0 % 256); 4845#L81-1 assume !(2 == mp_add_~i~0 % 256); 4846#L82-1 assume !(3 == mp_add_~i~0 % 256); 4599#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4591#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4592#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2018-11-23 00:15:38,651 INFO L796 eck$LassoCheckResult]: Loop: 4867#L65 assume !(0 == mp_add_~i~0 % 256); 4862#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4605#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 4587#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 4588#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4575#L71 assume !(0 == mp_add_~i~0 % 256); 4569#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 4570#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 4598#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 4863#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4864#L76-1 assume !(0 == mp_add_~i~0 % 256); 4885#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4926#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4571#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 4572#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4619#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4620#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4890#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4865#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4866#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4636#L80-1 assume !(1 == mp_add_~i~0 % 256); 4637#L81-1 assume !(2 == mp_add_~i~0 % 256); 4884#L82-1 assume !(3 == mp_add_~i~0 % 256); 4882#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4611#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4612#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4867#L65 [2018-11-23 00:15:38,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:38,651 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 2 times [2018-11-23 00:15:38,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:38,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:38,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:38,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:38,669 INFO L82 PathProgramCache]: Analyzing trace with hash -929180227, now seen corresponding path program 1 times [2018-11-23 00:15:38,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:38,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:38,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:38,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:38,697 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 00:15:38,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:38,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:15:38,697 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:38,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:15:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:15:38,697 INFO L87 Difference]: Start difference. First operand 364 states and 507 transitions. cyclomatic complexity: 150 Second operand 3 states. [2018-11-23 00:15:38,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:38,746 INFO L93 Difference]: Finished difference Result 454 states and 625 transitions. [2018-11-23 00:15:38,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:15:38,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 454 states and 625 transitions. [2018-11-23 00:15:38,748 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 329 [2018-11-23 00:15:38,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 454 states to 454 states and 625 transitions. [2018-11-23 00:15:38,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2018-11-23 00:15:38,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2018-11-23 00:15:38,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 625 transitions. [2018-11-23 00:15:38,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:38,751 INFO L705 BuchiCegarLoop]: Abstraction has 454 states and 625 transitions. [2018-11-23 00:15:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 625 transitions. [2018-11-23 00:15:38,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2018-11-23 00:15:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-11-23 00:15:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 565 transitions. [2018-11-23 00:15:38,755 INFO L728 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2018-11-23 00:15:38,756 INFO L608 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2018-11-23 00:15:38,756 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 00:15:38,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 565 transitions. [2018-11-23 00:15:38,757 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 285 [2018-11-23 00:15:38,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:38,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:38,758 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:38,758 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:38,758 INFO L794 eck$LassoCheckResult]: Stem: 5434#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 5403#L40 assume !(0 == mp_add_~a3~0 % 256); 5404#L40-1 mp_add_~nb~0 := 4; 5742#L50 assume !(0 == mp_add_~b3~0 % 256); 5741#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5740#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5739#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5738#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5737#L65-2 assume !(1 == mp_add_~i~0 % 256); 5736#L66-1 assume !(2 == mp_add_~i~0 % 256); 5735#L67-1 assume !(3 == mp_add_~i~0 % 256); 5734#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5733#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5732#L71-2 assume !(1 == mp_add_~i~0 % 256); 5731#L72-1 assume !(2 == mp_add_~i~0 % 256); 5730#L73-1 assume !(3 == mp_add_~i~0 % 256); 5729#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5728#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5727#L80-1 assume !(1 == mp_add_~i~0 % 256); 5726#L81-1 assume !(2 == mp_add_~i~0 % 256); 5725#L82-1 assume !(3 == mp_add_~i~0 % 256); 5724#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5723#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5722#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2018-11-23 00:15:38,758 INFO L796 eck$LassoCheckResult]: Loop: 5687#L65 assume !(0 == mp_add_~i~0 % 256); 5721#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 5719#L66-1 assume !(2 == mp_add_~i~0 % 256); 5717#L67-1 assume !(3 == mp_add_~i~0 % 256); 5715#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5714#L71 assume !(0 == mp_add_~i~0 % 256); 5711#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 5709#L72-1 assume !(2 == mp_add_~i~0 % 256); 5707#L73-1 assume !(3 == mp_add_~i~0 % 256); 5681#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5677#L76-1 assume !(0 == mp_add_~i~0 % 256); 5672#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5670#L81-1 assume !(2 == mp_add_~i~0 % 256); 5668#L82-1 assume !(3 == mp_add_~i~0 % 256); 5666#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5665#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5663#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5664#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5679#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5674#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5675#L80-1 assume !(1 == mp_add_~i~0 % 256); 5695#L81-1 assume !(2 == mp_add_~i~0 % 256); 5694#L82-1 assume !(3 == mp_add_~i~0 % 256); 5692#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5689#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5686#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5687#L65 [2018-11-23 00:15:38,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 3 times [2018-11-23 00:15:38,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:38,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:38,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:38,776 INFO L82 PathProgramCache]: Analyzing trace with hash 440290813, now seen corresponding path program 1 times [2018-11-23 00:15:38,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:38,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:38,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:38,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:38,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:15:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:38,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:38,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:15:38,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2018-11-23 00:15:38,918 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:38,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 00:15:38,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 00:15:38,918 INFO L87 Difference]: Start difference. First operand 407 states and 565 transitions. cyclomatic complexity: 164 Second operand 6 states. [2018-11-23 00:15:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:39,068 INFO L93 Difference]: Finished difference Result 482 states and 628 transitions. [2018-11-23 00:15:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:15:39,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 628 transitions. [2018-11-23 00:15:39,070 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 341 [2018-11-23 00:15:39,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 476 states and 619 transitions. [2018-11-23 00:15:39,072 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2018-11-23 00:15:39,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2018-11-23 00:15:39,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 476 states and 619 transitions. [2018-11-23 00:15:39,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:39,073 INFO L705 BuchiCegarLoop]: Abstraction has 476 states and 619 transitions. [2018-11-23 00:15:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states and 619 transitions. [2018-11-23 00:15:39,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 372. [2018-11-23 00:15:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-23 00:15:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 477 transitions. [2018-11-23 00:15:39,077 INFO L728 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2018-11-23 00:15:39,078 INFO L608 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2018-11-23 00:15:39,078 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 00:15:39,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 477 transitions. [2018-11-23 00:15:39,079 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 241 [2018-11-23 00:15:39,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:39,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:39,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,080 INFO L794 eck$LassoCheckResult]: Stem: 6416#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6383#L40 assume !(0 == mp_add_~a3~0 % 256); 6379#L40-1 mp_add_~nb~0 := 4; 6380#L50 assume !(0 == mp_add_~b3~0 % 256); 6404#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6405#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6632#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6633#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6628#L65-2 assume !(1 == mp_add_~i~0 % 256); 6629#L66-1 assume !(2 == mp_add_~i~0 % 256); 6624#L67-1 assume !(3 == mp_add_~i~0 % 256); 6625#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6620#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6621#L71-2 assume !(1 == mp_add_~i~0 % 256); 6616#L72-1 assume !(2 == mp_add_~i~0 % 256); 6617#L73-1 assume !(3 == mp_add_~i~0 % 256); 6612#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6613#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6734#L80-1 assume !(1 == mp_add_~i~0 % 256); 6733#L81-1 assume !(2 == mp_add_~i~0 % 256); 6732#L82-1 assume !(3 == mp_add_~i~0 % 256); 6731#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6730#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6729#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2018-11-23 00:15:39,080 INFO L796 eck$LassoCheckResult]: Loop: 6390#L65 assume !(0 == mp_add_~i~0 % 256); 6391#L65-2 assume !(1 == mp_add_~i~0 % 256); 6727#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 6725#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 6723#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6721#L71 assume !(0 == mp_add_~i~0 % 256); 6651#L71-2 assume !(1 == mp_add_~i~0 % 256); 6647#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 6644#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 6643#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6641#L76-1 assume !(0 == mp_add_~i~0 % 256); 6642#L80-1 assume !(1 == mp_add_~i~0 % 256); 6637#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 6638#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6546#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6547#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6674#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6668#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6669#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6663#L71-2 assume !(1 == mp_add_~i~0 % 256); 6664#L72-1 assume !(2 == mp_add_~i~0 % 256); 6659#L73-1 assume !(3 == mp_add_~i~0 % 256); 6660#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6655#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6656#L80-1 assume !(1 == mp_add_~i~0 % 256); 6684#L81-1 assume !(2 == mp_add_~i~0 % 256); 6685#L82-1 assume !(3 == mp_add_~i~0 % 256); 6677#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6678#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6671#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6390#L65 [2018-11-23 00:15:39,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,080 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 4 times [2018-11-23 00:15:39,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:39,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,096 INFO L82 PathProgramCache]: Analyzing trace with hash 293037747, now seen corresponding path program 1 times [2018-11-23 00:15:39,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 00:15:39,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:39,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:15:39,105 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:15:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:15:39,105 INFO L87 Difference]: Start difference. First operand 372 states and 477 transitions. cyclomatic complexity: 111 Second operand 3 states. [2018-11-23 00:15:39,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:39,174 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2018-11-23 00:15:39,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:15:39,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 422 states and 539 transitions. [2018-11-23 00:15:39,177 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 289 [2018-11-23 00:15:39,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 422 states to 422 states and 539 transitions. [2018-11-23 00:15:39,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 422 [2018-11-23 00:15:39,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2018-11-23 00:15:39,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 422 states and 539 transitions. [2018-11-23 00:15:39,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:39,179 INFO L705 BuchiCegarLoop]: Abstraction has 422 states and 539 transitions. [2018-11-23 00:15:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states and 539 transitions. [2018-11-23 00:15:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 375. [2018-11-23 00:15:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-11-23 00:15:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 483 transitions. [2018-11-23 00:15:39,184 INFO L728 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2018-11-23 00:15:39,184 INFO L608 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2018-11-23 00:15:39,184 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 00:15:39,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 483 transitions. [2018-11-23 00:15:39,186 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 247 [2018-11-23 00:15:39,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:39,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:39,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,186 INFO L794 eck$LassoCheckResult]: Stem: 7208#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7179#L40 assume !(0 == mp_add_~a3~0 % 256); 7180#L40-1 mp_add_~nb~0 := 4; 7436#L50 assume !(0 == mp_add_~b3~0 % 256); 7435#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7433#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7432#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7431#L65-2 assume !(1 == mp_add_~i~0 % 256); 7429#L66-1 assume !(2 == mp_add_~i~0 % 256); 7427#L67-1 assume !(3 == mp_add_~i~0 % 256); 7424#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7421#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7419#L71-2 assume !(1 == mp_add_~i~0 % 256); 7417#L72-1 assume !(2 == mp_add_~i~0 % 256); 7415#L73-1 assume !(3 == mp_add_~i~0 % 256); 7413#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7411#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7409#L80-1 assume !(1 == mp_add_~i~0 % 256); 7407#L81-1 assume !(2 == mp_add_~i~0 % 256); 7405#L82-1 assume !(3 == mp_add_~i~0 % 256); 7403#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7400#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7396#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2018-11-23 00:15:39,187 INFO L796 eck$LassoCheckResult]: Loop: 7393#L65 assume !(0 == mp_add_~i~0 % 256); 7389#L65-2 assume !(1 == mp_add_~i~0 % 256); 7387#L66-1 assume !(2 == mp_add_~i~0 % 256); 7383#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 7384#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7460#L71 assume !(0 == mp_add_~i~0 % 256); 7457#L71-2 assume !(1 == mp_add_~i~0 % 256); 7455#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 7456#L73-1 assume !(3 == mp_add_~i~0 % 256); 7469#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7466#L76-1 assume !(0 == mp_add_~i~0 % 256); 7463#L80-1 assume !(1 == mp_add_~i~0 % 256); 7461#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7450#L82-1 assume !(3 == mp_add_~i~0 % 256); 7402#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7399#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7394#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7395#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7423#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7420#L71-2 assume !(1 == mp_add_~i~0 % 256); 7418#L72-1 assume !(2 == mp_add_~i~0 % 256); 7416#L73-1 assume !(3 == mp_add_~i~0 % 256); 7414#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7412#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7410#L80-1 assume !(1 == mp_add_~i~0 % 256); 7408#L81-1 assume !(2 == mp_add_~i~0 % 256); 7406#L82-1 assume !(3 == mp_add_~i~0 % 256); 7404#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7401#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7397#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7393#L65 [2018-11-23 00:15:39,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 5 times [2018-11-23 00:15:39,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1585928527, now seen corresponding path program 1 times [2018-11-23 00:15:39,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:39,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:39,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 00:15:39,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:39,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 00:15:39,212 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:39,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 00:15:39,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 00:15:39,213 INFO L87 Difference]: Start difference. First operand 375 states and 483 transitions. cyclomatic complexity: 113 Second operand 3 states. [2018-11-23 00:15:39,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:39,284 INFO L93 Difference]: Finished difference Result 419 states and 534 transitions. [2018-11-23 00:15:39,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 00:15:39,285 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 534 transitions. [2018-11-23 00:15:39,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 289 [2018-11-23 00:15:39,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 534 transitions. [2018-11-23 00:15:39,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2018-11-23 00:15:39,288 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2018-11-23 00:15:39,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 534 transitions. [2018-11-23 00:15:39,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:39,288 INFO L705 BuchiCegarLoop]: Abstraction has 419 states and 534 transitions. [2018-11-23 00:15:39,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 534 transitions. [2018-11-23 00:15:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 398. [2018-11-23 00:15:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-23 00:15:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2018-11-23 00:15:39,294 INFO L728 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2018-11-23 00:15:39,294 INFO L608 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2018-11-23 00:15:39,294 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 00:15:39,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 511 transitions. [2018-11-23 00:15:39,295 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 268 [2018-11-23 00:15:39,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:39,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:39,296 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,296 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,296 INFO L794 eck$LassoCheckResult]: Stem: 8008#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7979#L40 assume !(0 == mp_add_~a3~0 % 256); 7976#L40-1 mp_add_~nb~0 := 4; 7977#L50 assume !(0 == mp_add_~b3~0 % 256); 8000#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8001#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8040#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8041#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8141#L65-2 assume !(1 == mp_add_~i~0 % 256); 8142#L66-1 assume !(2 == mp_add_~i~0 % 256); 8137#L67-1 assume !(3 == mp_add_~i~0 % 256); 8138#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8133#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8134#L71-2 assume !(1 == mp_add_~i~0 % 256); 8129#L72-1 assume !(2 == mp_add_~i~0 % 256); 8130#L73-1 assume !(3 == mp_add_~i~0 % 256); 8126#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8125#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8124#L80-1 assume !(1 == mp_add_~i~0 % 256); 8123#L81-1 assume !(2 == mp_add_~i~0 % 256); 8039#L82-1 assume !(3 == mp_add_~i~0 % 256); 8004#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7996#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7997#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2018-11-23 00:15:39,296 INFO L796 eck$LassoCheckResult]: Loop: 8276#L65 assume !(0 == mp_add_~i~0 % 256); 8274#L65-2 assume !(1 == mp_add_~i~0 % 256); 8272#L66-1 assume !(2 == mp_add_~i~0 % 256); 8273#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 8280#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8279#L71 assume !(0 == mp_add_~i~0 % 256); 8278#L71-2 assume !(1 == mp_add_~i~0 % 256); 8243#L72-1 assume !(2 == mp_add_~i~0 % 256); 8244#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 8324#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8156#L76-1 assume !(0 == mp_add_~i~0 % 256); 8157#L80-1 assume !(1 == mp_add_~i~0 % 256); 8144#L81-1 assume !(2 == mp_add_~i~0 % 256); 8145#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 8037#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8038#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8032#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8034#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8165#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8121#L71-2 assume !(1 == mp_add_~i~0 % 256); 8120#L72-1 assume !(2 == mp_add_~i~0 % 256); 8119#L73-1 assume !(3 == mp_add_~i~0 % 256); 8118#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8117#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8116#L80-1 assume !(1 == mp_add_~i~0 % 256); 8115#L81-1 assume !(2 == mp_add_~i~0 % 256); 8113#L82-1 assume !(3 == mp_add_~i~0 % 256); 8114#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8023#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8024#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8276#L65 [2018-11-23 00:15:39,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,296 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 6 times [2018-11-23 00:15:39,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash 278948913, now seen corresponding path program 1 times [2018-11-23 00:15:39,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:39,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:39,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:39,354 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:15:39,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:39,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:39,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:15:39,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2018-11-23 00:15:39,443 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:39,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 00:15:39,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 00:15:39,444 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. cyclomatic complexity: 118 Second operand 7 states. [2018-11-23 00:15:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:39,894 INFO L93 Difference]: Finished difference Result 1137 states and 1501 transitions. [2018-11-23 00:15:39,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 00:15:39,895 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1501 transitions. [2018-11-23 00:15:39,930 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 988 [2018-11-23 00:15:39,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 1137 states and 1501 transitions. [2018-11-23 00:15:39,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1137 [2018-11-23 00:15:39,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2018-11-23 00:15:39,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1137 states and 1501 transitions. [2018-11-23 00:15:39,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:39,935 INFO L705 BuchiCegarLoop]: Abstraction has 1137 states and 1501 transitions. [2018-11-23 00:15:39,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states and 1501 transitions. [2018-11-23 00:15:39,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 516. [2018-11-23 00:15:39,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-23 00:15:39,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 669 transitions. [2018-11-23 00:15:39,943 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2018-11-23 00:15:39,943 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2018-11-23 00:15:39,943 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 00:15:39,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 669 transitions. [2018-11-23 00:15:39,945 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 386 [2018-11-23 00:15:39,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:39,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:39,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:39,945 INFO L794 eck$LassoCheckResult]: Stem: 9679#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 9648#L40 assume !(0 == mp_add_~a3~0 % 256); 9649#L40-1 mp_add_~nb~0 := 4; 9866#L50 assume !(0 == mp_add_~b3~0 % 256); 9865#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9864#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9863#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9862#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9861#L65-2 assume !(1 == mp_add_~i~0 % 256); 9860#L66-1 assume !(2 == mp_add_~i~0 % 256); 9859#L67-1 assume !(3 == mp_add_~i~0 % 256); 9858#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9857#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9856#L71-2 assume !(1 == mp_add_~i~0 % 256); 9855#L72-1 assume !(2 == mp_add_~i~0 % 256); 9854#L73-1 assume !(3 == mp_add_~i~0 % 256); 9853#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9852#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9851#L80-1 assume !(1 == mp_add_~i~0 % 256); 9850#L81-1 assume !(2 == mp_add_~i~0 % 256); 9849#L82-1 assume !(3 == mp_add_~i~0 % 256); 9848#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9847#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9844#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2018-11-23 00:15:39,945 INFO L796 eck$LassoCheckResult]: Loop: 9837#L65 assume !(0 == mp_add_~i~0 % 256); 9835#L65-2 assume !(1 == mp_add_~i~0 % 256); 9833#L66-1 assume !(2 == mp_add_~i~0 % 256); 9832#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 9830#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9828#L71 assume !(0 == mp_add_~i~0 % 256); 9826#L71-2 assume !(1 == mp_add_~i~0 % 256); 9824#L72-1 assume !(2 == mp_add_~i~0 % 256); 9821#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 9819#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 9820#L76-1 assume !(0 == mp_add_~i~0 % 256); 9815#L80-1 assume !(1 == mp_add_~i~0 % 256); 9816#L81-1 assume !(2 == mp_add_~i~0 % 256); 9810#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 9811#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9845#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9846#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9837#L65 [2018-11-23 00:15:39,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,946 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 7 times [2018-11-23 00:15:39,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:39,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash -459730205, now seen corresponding path program 1 times [2018-11-23 00:15:39,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:39,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:39,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:39,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1126726409, now seen corresponding path program 1 times [2018-11-23 00:15:39,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:39,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:39,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:39,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:40,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:40,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:15:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:40,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:40,113 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 00:15:40,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:15:40,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2018-11-23 00:15:40,175 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:40,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:40,175 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:40,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:40,175 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 00:15:40,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:40,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:40,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:40,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2018-11-23 00:15:40,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:40,175 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:40,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:15:40,185 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-23 00:15:40,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:40,383 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:40,387 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:15:40,387 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:15:40,421 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 00:15:40,421 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:15:41,044 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 00:15:41,046 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:15:41,046 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:15:41,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:15:41,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:15:41,046 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:15:41,047 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:15:41,047 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:15:41,047 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:15:41,047 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2018-11-23 00:15:41,047 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:15:41,047 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:15:41,048 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-23 00:15:41,057 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-23 00:15:41,253 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:15:41,253 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:15:41,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:41,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:41,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:15:41,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:15:41,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,259 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:15:41,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,260 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:41,261 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:41,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,264 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:41,265 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:41,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,266 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:15:41,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,267 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:41,268 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:41,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,272 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:41,273 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:41,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,274 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:15:41,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,275 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:41,276 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:41,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:15:41,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,281 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:41,282 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:41,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,283 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:15:41,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,284 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:41,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,284 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:41,285 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:41,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,293 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:41,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,294 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:15:41,295 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:15:41,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,297 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:15:41,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,298 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,298 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:41,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,299 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:41,300 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:41,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,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-23 00:15:41,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,313 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:15:41,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:41,316 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:41,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,320 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:15:41,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-23 00:15:41,320 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,320 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:41,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,321 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:41,323 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:41,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,334 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,334 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:41,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,334 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:15:41,338 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:15:41,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,340 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:15:41,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-23 00:15:41,341 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,341 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:41,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,341 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:41,342 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:41,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,349 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:15:41,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,349 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:15:41,351 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:15:41,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,356 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:15:41,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:41,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,357 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:41,359 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:41,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:15:41,371 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:15:41,371 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:15:41,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:15:41,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:15:41,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:15:41,371 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:15:41,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:15:41,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:15:41,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:15:41,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:15:41,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:15:41,381 INFO L87 Difference]: Start difference. First operand 516 states and 669 transitions. cyclomatic complexity: 159 Second operand 8 states. [2018-11-23 00:15:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:41,825 INFO L93 Difference]: Finished difference Result 656 states and 821 transitions. [2018-11-23 00:15:41,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:15:41,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 821 transitions. [2018-11-23 00:15:41,828 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 514 [2018-11-23 00:15:41,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 647 states and 808 transitions. [2018-11-23 00:15:41,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2018-11-23 00:15:41,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 647 [2018-11-23 00:15:41,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 808 transitions. [2018-11-23 00:15:41,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:41,831 INFO L705 BuchiCegarLoop]: Abstraction has 647 states and 808 transitions. [2018-11-23 00:15:41,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 808 transitions. [2018-11-23 00:15:41,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 574. [2018-11-23 00:15:41,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-11-23 00:15:41,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 729 transitions. [2018-11-23 00:15:41,838 INFO L728 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2018-11-23 00:15:41,838 INFO L608 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2018-11-23 00:15:41,838 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 00:15:41,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 729 transitions. [2018-11-23 00:15:41,840 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 447 [2018-11-23 00:15:41,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:41,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:41,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:41,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:41,841 INFO L794 eck$LassoCheckResult]: Stem: 10990#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10959#L40 assume !(0 == mp_add_~a3~0 % 256); 10960#L40-1 mp_add_~nb~0 := 4; 11140#L50 assume !(0 == mp_add_~b3~0 % 256); 11139#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11138#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11137#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11136#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11135#L65-2 assume !(1 == mp_add_~i~0 % 256); 11134#L66-1 assume !(2 == mp_add_~i~0 % 256); 11133#L67-1 assume !(3 == mp_add_~i~0 % 256); 11132#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11131#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11130#L71-2 assume !(1 == mp_add_~i~0 % 256); 11129#L72-1 assume !(2 == mp_add_~i~0 % 256); 11128#L73-1 assume !(3 == mp_add_~i~0 % 256); 11127#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 11126#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11125#L80-1 assume !(1 == mp_add_~i~0 % 256); 11124#L81-1 assume !(2 == mp_add_~i~0 % 256); 11123#L82-1 assume !(3 == mp_add_~i~0 % 256); 11122#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11121#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11120#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11119#L65 assume !(0 == mp_add_~i~0 % 256); 11118#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11051#L66-1 [2018-11-23 00:15:41,841 INFO L796 eck$LassoCheckResult]: Loop: 11051#L66-1 assume !(2 == mp_add_~i~0 % 256); 11117#L67-1 assume !(3 == mp_add_~i~0 % 256); 11116#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11115#L71 assume !(0 == mp_add_~i~0 % 256); 11114#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 11113#L72-1 assume !(2 == mp_add_~i~0 % 256); 11112#L73-1 assume !(3 == mp_add_~i~0 % 256); 11111#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11110#L76-1 assume !(0 == mp_add_~i~0 % 256); 11108#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11107#L81-1 assume !(2 == mp_add_~i~0 % 256); 11052#L82-1 assume !(3 == mp_add_~i~0 % 256); 11043#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11044#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11039#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11040#L65 assume !(0 == mp_add_~i~0 % 256); 11050#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 11051#L66-1 [2018-11-23 00:15:41,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:41,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 1 times [2018-11-23 00:15:41,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:41,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:41,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:41,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:41,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:41,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:41,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1434173717, now seen corresponding path program 1 times [2018-11-23 00:15:41,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:41,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:41,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:41,899 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-23 00:15:41,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:41,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:41,900 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:41,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 00:15:41,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 00:15:41,900 INFO L87 Difference]: Start difference. First operand 574 states and 729 transitions. cyclomatic complexity: 163 Second operand 5 states. [2018-11-23 00:15:42,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:42,011 INFO L93 Difference]: Finished difference Result 896 states and 1144 transitions. [2018-11-23 00:15:42,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 00:15:42,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 896 states and 1144 transitions. [2018-11-23 00:15:42,016 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 763 [2018-11-23 00:15:42,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 896 states to 896 states and 1144 transitions. [2018-11-23 00:15:42,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2018-11-23 00:15:42,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 896 [2018-11-23 00:15:42,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 896 states and 1144 transitions. [2018-11-23 00:15:42,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:42,021 INFO L705 BuchiCegarLoop]: Abstraction has 896 states and 1144 transitions. [2018-11-23 00:15:42,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states and 1144 transitions. [2018-11-23 00:15:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 644. [2018-11-23 00:15:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2018-11-23 00:15:42,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 817 transitions. [2018-11-23 00:15:42,031 INFO L728 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2018-11-23 00:15:42,032 INFO L608 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2018-11-23 00:15:42,032 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 00:15:42,032 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 644 states and 817 transitions. [2018-11-23 00:15:42,034 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 523 [2018-11-23 00:15:42,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:42,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:42,034 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:42,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:42,035 INFO L794 eck$LassoCheckResult]: Stem: 12469#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 12438#L40 assume !(0 == mp_add_~a3~0 % 256); 12439#L40-1 mp_add_~nb~0 := 4; 12708#L50 assume !(0 == mp_add_~b3~0 % 256); 12707#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12706#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12705#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12704#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12703#L65-2 assume !(1 == mp_add_~i~0 % 256); 12702#L66-1 assume !(2 == mp_add_~i~0 % 256); 12701#L67-1 assume !(3 == mp_add_~i~0 % 256); 12700#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12699#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12698#L71-2 assume !(1 == mp_add_~i~0 % 256); 12697#L72-1 assume !(2 == mp_add_~i~0 % 256); 12696#L73-1 assume !(3 == mp_add_~i~0 % 256); 12695#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12694#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12693#L80-1 assume !(1 == mp_add_~i~0 % 256); 12692#L81-1 assume !(2 == mp_add_~i~0 % 256); 12691#L82-1 assume !(3 == mp_add_~i~0 % 256); 12690#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12689#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12688#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12687#L65 assume !(0 == mp_add_~i~0 % 256); 12686#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12685#L66-1 [2018-11-23 00:15:42,035 INFO L796 eck$LassoCheckResult]: Loop: 12685#L66-1 assume !(2 == mp_add_~i~0 % 256); 12684#L67-1 assume !(3 == mp_add_~i~0 % 256); 12683#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12682#L71 assume !(0 == mp_add_~i~0 % 256); 12681#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 12680#L72-1 assume !(2 == mp_add_~i~0 % 256); 12679#L73-1 assume !(3 == mp_add_~i~0 % 256); 12678#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12677#L76-1 assume !(0 == mp_add_~i~0 % 256); 12676#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12675#L81-1 assume !(2 == mp_add_~i~0 % 256); 12674#L82-1 assume !(3 == mp_add_~i~0 % 256); 12673#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12621#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12622#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12611#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12613#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12606#L76-1 assume !(0 == mp_add_~i~0 % 256); 12521#L80-1 assume !(1 == mp_add_~i~0 % 256); 12522#L81-1 assume !(2 == mp_add_~i~0 % 256); 12517#L82-1 assume !(3 == mp_add_~i~0 % 256); 12512#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12510#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12511#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12615#L65 assume !(0 == mp_add_~i~0 % 256); 12655#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12685#L66-1 [2018-11-23 00:15:42,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 2 times [2018-11-23 00:15:42,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:42,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1615640065, now seen corresponding path program 1 times [2018-11-23 00:15:42,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:42,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:42,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:42,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:42,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:42,163 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:15:42,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:42,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:42,564 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:15:42,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:15:42,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2018-11-23 00:15:42,579 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:42,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:15:42,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=104, Unknown=1, NotChecked=0, Total=132 [2018-11-23 00:15:42,580 INFO L87 Difference]: Start difference. First operand 644 states and 817 transitions. cyclomatic complexity: 181 Second operand 12 states. [2018-11-23 00:15:43,219 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-11-23 00:15:43,529 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-11-23 00:15:45,896 WARN L180 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2018-11-23 00:15:49,559 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-23 00:15:56,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:56,436 INFO L93 Difference]: Finished difference Result 1622 states and 2001 transitions. [2018-11-23 00:15:56,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 00:15:56,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1622 states and 2001 transitions. [2018-11-23 00:15:56,443 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1448 [2018-11-23 00:15:56,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1622 states to 1587 states and 1938 transitions. [2018-11-23 00:15:56,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1587 [2018-11-23 00:15:56,452 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1587 [2018-11-23 00:15:56,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1587 states and 1938 transitions. [2018-11-23 00:15:56,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:56,455 INFO L705 BuchiCegarLoop]: Abstraction has 1587 states and 1938 transitions. [2018-11-23 00:15:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states and 1938 transitions. [2018-11-23 00:15:56,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1105. [2018-11-23 00:15:56,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1105 states. [2018-11-23 00:15:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1105 states to 1105 states and 1386 transitions. [2018-11-23 00:15:56,474 INFO L728 BuchiCegarLoop]: Abstraction has 1105 states and 1386 transitions. [2018-11-23 00:15:56,474 INFO L608 BuchiCegarLoop]: Abstraction has 1105 states and 1386 transitions. [2018-11-23 00:15:56,474 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 00:15:56,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1105 states and 1386 transitions. [2018-11-23 00:15:56,478 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1022 [2018-11-23 00:15:56,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:56,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:56,478 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:56,479 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:56,479 INFO L794 eck$LassoCheckResult]: Stem: 14871#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 14843#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14845#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14869#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14840#L40-1 mp_add_~nb~0 := 4; 14841#L50 assume !(0 == mp_add_~b3~0 % 256); 14864#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14865#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15550#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15551#L65 [2018-11-23 00:15:56,479 INFO L796 eck$LassoCheckResult]: Loop: 15551#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15896#L65-2 assume !(1 == mp_add_~i~0 % 256); 14873#L66-1 assume !(2 == mp_add_~i~0 % 256); 14874#L67-1 assume !(3 == mp_add_~i~0 % 256); 15893#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15892#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15891#L71-2 assume !(1 == mp_add_~i~0 % 256); 15890#L72-1 assume !(2 == mp_add_~i~0 % 256); 15889#L73-1 assume !(3 == mp_add_~i~0 % 256); 15888#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15887#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15886#L80-1 assume !(1 == mp_add_~i~0 % 256); 15885#L81-1 assume !(2 == mp_add_~i~0 % 256); 15877#L82-1 assume !(3 == mp_add_~i~0 % 256); 14868#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14858#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14859#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15935#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15934#L71 assume !(0 == mp_add_~i~0 % 256); 15925#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; 15714#L72-1 assume !(2 == mp_add_~i~0 % 256); 15922#L73-1 assume !(3 == mp_add_~i~0 % 256); 15921#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15920#L76-1 assume !(0 == mp_add_~i~0 % 256); 15909#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15907#L81-1 assume !(2 == mp_add_~i~0 % 256); 15858#L82-1 assume !(3 == mp_add_~i~0 % 256); 15826#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14909#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14910#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15317#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15749#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15748#L76-1 assume !(0 == mp_add_~i~0 % 256); 15747#L80-1 assume !(1 == mp_add_~i~0 % 256); 15301#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15300#L82-1 assume !(3 == mp_add_~i~0 % 256); 14912#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14913#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15743#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15740#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15742#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15737#L76-1 assume !(0 == mp_add_~i~0 % 256); 15738#L80-1 assume !(1 == mp_add_~i~0 % 256); 15725#L81-1 assume !(2 == mp_add_~i~0 % 256); 15726#L82-1 assume !(3 == mp_add_~i~0 % 256); 15834#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15832#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15829#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15551#L65 [2018-11-23 00:15:56,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:56,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 2 times [2018-11-23 00:15:56,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:56,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:56,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:56,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:56,489 INFO L82 PathProgramCache]: Analyzing trace with hash -2024966345, now seen corresponding path program 1 times [2018-11-23 00:15:56,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:56,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:56,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:56,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 00:15:56,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:56,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:15:56,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:56,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 00:15:56,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 00:15:56,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-23 00:15:56,705 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:56,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:15:56,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:15:56,705 INFO L87 Difference]: Start difference. First operand 1105 states and 1386 transitions. cyclomatic complexity: 289 Second operand 8 states. [2018-11-23 00:15:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:56,788 INFO L93 Difference]: Finished difference Result 1843 states and 2218 transitions. [2018-11-23 00:15:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 00:15:56,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1843 states and 2218 transitions. [2018-11-23 00:15:56,793 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1745 [2018-11-23 00:15:56,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1843 states to 1843 states and 2218 transitions. [2018-11-23 00:15:56,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1843 [2018-11-23 00:15:56,801 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1843 [2018-11-23 00:15:56,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1843 states and 2218 transitions. [2018-11-23 00:15:56,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:56,803 INFO L705 BuchiCegarLoop]: Abstraction has 1843 states and 2218 transitions. [2018-11-23 00:15:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states and 2218 transitions. [2018-11-23 00:15:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1614. [2018-11-23 00:15:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2018-11-23 00:15:56,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 1970 transitions. [2018-11-23 00:15:56,826 INFO L728 BuchiCegarLoop]: Abstraction has 1614 states and 1970 transitions. [2018-11-23 00:15:56,826 INFO L608 BuchiCegarLoop]: Abstraction has 1614 states and 1970 transitions. [2018-11-23 00:15:56,826 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 00:15:56,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1614 states and 1970 transitions. [2018-11-23 00:15:56,830 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1531 [2018-11-23 00:15:56,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:56,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:56,831 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:56,831 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:56,831 INFO L794 eck$LassoCheckResult]: Stem: 17974#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 17946#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17948#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17971#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17942#L40-1 mp_add_~nb~0 := 4; 17943#L50 assume !(0 == mp_add_~b3~0 % 256); 17966#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17967#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18585#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18586#L65 [2018-11-23 00:15:56,831 INFO L796 eck$LassoCheckResult]: Loop: 18586#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 17949#L65-2 assume !(1 == mp_add_~i~0 % 256); 17950#L66-1 assume !(2 == mp_add_~i~0 % 256); 17956#L67-1 assume !(3 == mp_add_~i~0 % 256); 17957#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19378#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 19377#L71-2 assume !(1 == mp_add_~i~0 % 256); 19376#L72-1 assume !(2 == mp_add_~i~0 % 256); 19375#L73-1 assume !(3 == mp_add_~i~0 % 256); 19374#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19373#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 19372#L80-1 assume !(1 == mp_add_~i~0 % 256); 19371#L81-1 assume !(2 == mp_add_~i~0 % 256); 19370#L82-1 assume !(3 == mp_add_~i~0 % 256); 19369#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19368#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19367#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19353#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19351#L71 assume !(0 == mp_add_~i~0 % 256); 19349#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; 19167#L72-1 assume !(2 == mp_add_~i~0 % 256); 19346#L73-1 assume !(3 == mp_add_~i~0 % 256); 19342#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; 19340#L76-1 assume !(0 == mp_add_~i~0 % 256); 19337#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 19338#L81-1 assume !(2 == mp_add_~i~0 % 256); 19359#L82-1 assume !(3 == mp_add_~i~0 % 256); 19358#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19324#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19325#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19316#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19313#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; 19314#L76-1 assume !(0 == mp_add_~i~0 % 256); 19302#L80-1 assume !(1 == mp_add_~i~0 % 256); 19283#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 19281#L82-1 assume !(3 == mp_add_~i~0 % 256); 19279#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19277#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19275#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19273#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19274#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19265#L76-1 assume !(0 == mp_add_~i~0 % 256); 19266#L80-1 assume !(1 == mp_add_~i~0 % 256); 19211#L81-1 assume !(2 == mp_add_~i~0 % 256); 19212#L82-1 assume !(3 == mp_add_~i~0 % 256); 19200#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19152#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19153#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18586#L65 [2018-11-23 00:15:56,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:56,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 3 times [2018-11-23 00:15:56,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:56,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:56,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:56,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:56,842 INFO L82 PathProgramCache]: Analyzing trace with hash -498658057, now seen corresponding path program 1 times [2018-11-23 00:15:56,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:56,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:56,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 00:15:56,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 00:15:56,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 00:15:56,893 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:56,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 00:15:56,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 00:15:56,894 INFO L87 Difference]: Start difference. First operand 1614 states and 1970 transitions. cyclomatic complexity: 364 Second operand 4 states. [2018-11-23 00:15:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:56,951 INFO L93 Difference]: Finished difference Result 2008 states and 2388 transitions. [2018-11-23 00:15:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 00:15:56,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2008 states and 2388 transitions. [2018-11-23 00:15:56,955 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1910 [2018-11-23 00:15:56,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2008 states to 2008 states and 2388 transitions. [2018-11-23 00:15:56,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2008 [2018-11-23 00:15:56,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2008 [2018-11-23 00:15:56,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2008 states and 2388 transitions. [2018-11-23 00:15:56,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:56,964 INFO L705 BuchiCegarLoop]: Abstraction has 2008 states and 2388 transitions. [2018-11-23 00:15:56,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states and 2388 transitions. [2018-11-23 00:15:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1701. [2018-11-23 00:15:56,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2018-11-23 00:15:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2043 transitions. [2018-11-23 00:15:56,986 INFO L728 BuchiCegarLoop]: Abstraction has 1701 states and 2043 transitions. [2018-11-23 00:15:56,986 INFO L608 BuchiCegarLoop]: Abstraction has 1701 states and 2043 transitions. [2018-11-23 00:15:56,986 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 00:15:56,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1701 states and 2043 transitions. [2018-11-23 00:15:56,990 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1618 [2018-11-23 00:15:56,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:56,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:56,991 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:56,991 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:56,991 INFO L794 eck$LassoCheckResult]: Stem: 21601#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 21574#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21575#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21598#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21603#L40-1 mp_add_~nb~0 := 4; 21594#L50 assume !(0 == mp_add_~b3~0 % 256); 21595#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22419#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22416#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22415#L65 [2018-11-23 00:15:56,991 INFO L796 eck$LassoCheckResult]: Loop: 22415#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22414#L65-2 assume !(1 == mp_add_~i~0 % 256); 22413#L66-1 assume !(2 == mp_add_~i~0 % 256); 22412#L67-1 assume !(3 == mp_add_~i~0 % 256); 22411#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22410#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22409#L71-2 assume !(1 == mp_add_~i~0 % 256); 22408#L72-1 assume !(2 == mp_add_~i~0 % 256); 22407#L73-1 assume !(3 == mp_add_~i~0 % 256); 22406#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22405#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22402#L80-1 assume !(1 == mp_add_~i~0 % 256); 22399#L81-1 assume !(2 == mp_add_~i~0 % 256); 22387#L82-1 assume !(3 == mp_add_~i~0 % 256); 22386#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22382#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22377#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22364#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22363#L71 assume !(0 == mp_add_~i~0 % 256); 21675#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; 21676#L72-1 assume !(2 == mp_add_~i~0 % 256); 21671#L73-1 assume !(3 == mp_add_~i~0 % 256); 21672#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 21666#L76-1 assume !(0 == mp_add_~i~0 % 256); 21667#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 21647#L81-1 assume !(2 == mp_add_~i~0 % 256); 21643#L82-1 assume !(3 == mp_add_~i~0 % 256); 21644#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22311#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22312#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22297#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22295#L71 assume !(0 == mp_add_~i~0 % 256); 22282#L71-2 assume !(1 == mp_add_~i~0 % 256); 22277#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; 22276#L73-1 assume !(3 == mp_add_~i~0 % 256); 22274#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; 22273#L76-1 assume !(0 == mp_add_~i~0 % 256); 22272#L80-1 assume !(1 == mp_add_~i~0 % 256); 22271#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22155#L82-1 assume !(3 == mp_add_~i~0 % 256); 22270#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22269#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22268#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22266#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22264#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22265#L76-1 assume !(0 == mp_add_~i~0 % 256); 22423#L80-1 assume !(1 == mp_add_~i~0 % 256); 22422#L81-1 assume !(2 == mp_add_~i~0 % 256); 22216#L82-1 assume !(3 == mp_add_~i~0 % 256); 22420#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22417#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22418#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22415#L65 [2018-11-23 00:15:56,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:56,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 4 times [2018-11-23 00:15:56,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:56,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:56,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:56,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:57,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:57,000 INFO L82 PathProgramCache]: Analyzing trace with hash 982437249, now seen corresponding path program 1 times [2018-11-23 00:15:57,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:57,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 00:15:57,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:57,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:15:57,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:57,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 00:15:57,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:15:57,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2018-11-23 00:15:57,273 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:57,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 00:15:57,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-23 00:15:57,273 INFO L87 Difference]: Start difference. First operand 1701 states and 2043 transitions. cyclomatic complexity: 350 Second operand 10 states. [2018-11-23 00:15:58,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:58,234 INFO L93 Difference]: Finished difference Result 2267 states and 2559 transitions. [2018-11-23 00:15:58,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 00:15:58,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2267 states and 2559 transitions. [2018-11-23 00:15:58,247 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1679 [2018-11-23 00:15:58,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2267 states to 2183 states and 2466 transitions. [2018-11-23 00:15:58,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2183 [2018-11-23 00:15:58,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2183 [2018-11-23 00:15:58,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2183 states and 2466 transitions. [2018-11-23 00:15:58,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:58,254 INFO L705 BuchiCegarLoop]: Abstraction has 2183 states and 2466 transitions. [2018-11-23 00:15:58,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states and 2466 transitions. [2018-11-23 00:15:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1244. [2018-11-23 00:15:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1244 states. [2018-11-23 00:15:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1448 transitions. [2018-11-23 00:15:58,272 INFO L728 BuchiCegarLoop]: Abstraction has 1244 states and 1448 transitions. [2018-11-23 00:15:58,272 INFO L608 BuchiCegarLoop]: Abstraction has 1244 states and 1448 transitions. [2018-11-23 00:15:58,272 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 00:15:58,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1244 states and 1448 transitions. [2018-11-23 00:15:58,274 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1005 [2018-11-23 00:15:58,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:58,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:58,275 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:58,275 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:58,275 INFO L794 eck$LassoCheckResult]: Stem: 25807#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 25783#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25784#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25805#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25809#L40-1 mp_add_~nb~0 := 4; 26398#L50 assume !(0 == mp_add_~b3~0 % 256); 26395#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 26396#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26392#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26391#L65 [2018-11-23 00:15:58,275 INFO L796 eck$LassoCheckResult]: Loop: 26391#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 26390#L65-2 assume !(1 == mp_add_~i~0 % 256); 26389#L66-1 assume !(2 == mp_add_~i~0 % 256); 26388#L67-1 assume !(3 == mp_add_~i~0 % 256); 26387#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26386#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 26385#L71-2 assume !(1 == mp_add_~i~0 % 256); 26384#L72-1 assume !(2 == mp_add_~i~0 % 256); 26383#L73-1 assume !(3 == mp_add_~i~0 % 256); 26381#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; 26380#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 26379#L80-1 assume !(1 == mp_add_~i~0 % 256); 26378#L81-1 assume !(2 == mp_add_~i~0 % 256); 26377#L82-1 assume !(3 == mp_add_~i~0 % 256); 26375#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26373#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26371#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26369#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26364#L71 assume !(0 == mp_add_~i~0 % 256); 26362#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; 26360#L72-1 assume !(2 == mp_add_~i~0 % 256); 26358#L73-1 assume !(3 == mp_add_~i~0 % 256); 26354#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; 26352#L76-1 assume !(0 == mp_add_~i~0 % 256); 26349#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 26350#L81-1 assume !(2 == mp_add_~i~0 % 256); 26345#L82-1 assume !(3 == mp_add_~i~0 % 256); 26346#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26341#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26342#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26366#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26365#L71 assume !(0 == mp_add_~i~0 % 256); 26335#L71-2 assume !(1 == mp_add_~i~0 % 256); 26334#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; 26333#L73-1 assume !(3 == mp_add_~i~0 % 256); 26331#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; 26330#L76-1 assume !(0 == mp_add_~i~0 % 256); 26329#L80-1 assume !(1 == mp_add_~i~0 % 256); 26328#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 26327#L82-1 assume !(3 == mp_add_~i~0 % 256); 26325#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26323#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26321#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26317#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26318#L71 assume !(0 == mp_add_~i~0 % 256); 26416#L71-2 assume !(1 == mp_add_~i~0 % 256); 26415#L72-1 assume !(2 == mp_add_~i~0 % 256); 26414#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; 26412#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; 26411#L76-1 assume !(0 == mp_add_~i~0 % 256); 26410#L80-1 assume !(1 == mp_add_~i~0 % 256); 26409#L81-1 assume !(2 == mp_add_~i~0 % 256); 26408#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 26407#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26406#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26405#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26404#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26403#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26402#L76-1 assume !(0 == mp_add_~i~0 % 256); 26401#L80-1 assume !(1 == mp_add_~i~0 % 256); 26400#L81-1 assume !(2 == mp_add_~i~0 % 256); 26399#L82-1 assume !(3 == mp_add_~i~0 % 256); 26397#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26393#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26394#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26391#L65 [2018-11-23 00:15:58,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 5 times [2018-11-23 00:15:58,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:58,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:58,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:58,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:58,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:58,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:58,285 INFO L82 PathProgramCache]: Analyzing trace with hash -2060926355, now seen corresponding path program 1 times [2018-11-23 00:15:58,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:58,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:58,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:58,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:15:58,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 00:15:58,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:58,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:15:58,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:58,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:15:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 00:15:58,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:15:58,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 00:15:58,544 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:15:58,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:15:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:15:58,544 INFO L87 Difference]: Start difference. First operand 1244 states and 1448 transitions. cyclomatic complexity: 211 Second operand 14 states. [2018-11-23 00:15:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:15:59,633 INFO L93 Difference]: Finished difference Result 2564 states and 2875 transitions. [2018-11-23 00:15:59,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 00:15:59,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2564 states and 2875 transitions. [2018-11-23 00:15:59,637 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1447 [2018-11-23 00:15:59,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2564 states to 2528 states and 2808 transitions. [2018-11-23 00:15:59,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2528 [2018-11-23 00:15:59,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2528 [2018-11-23 00:15:59,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2528 states and 2808 transitions. [2018-11-23 00:15:59,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:15:59,643 INFO L705 BuchiCegarLoop]: Abstraction has 2528 states and 2808 transitions. [2018-11-23 00:15:59,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states and 2808 transitions. [2018-11-23 00:15:59,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 1284. [2018-11-23 00:15:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2018-11-23 00:15:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1501 transitions. [2018-11-23 00:15:59,663 INFO L728 BuchiCegarLoop]: Abstraction has 1284 states and 1501 transitions. [2018-11-23 00:15:59,663 INFO L608 BuchiCegarLoop]: Abstraction has 1284 states and 1501 transitions. [2018-11-23 00:15:59,663 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 00:15:59,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1284 states and 1501 transitions. [2018-11-23 00:15:59,665 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 980 [2018-11-23 00:15:59,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:15:59,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:15:59,666 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:59,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:15:59,667 INFO L794 eck$LassoCheckResult]: Stem: 29881#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 29858#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 29860#L42 assume !(0 == mp_add_~a2~0 % 256); 29880#L40-1 mp_add_~nb~0 := 4; 30370#L50 assume !(0 == mp_add_~b3~0 % 256); 30367#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 30365#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30366#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30360#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 30361#L65-2 assume !(1 == mp_add_~i~0 % 256); 30356#L66-1 assume !(2 == mp_add_~i~0 % 256); 30357#L67-1 assume !(3 == mp_add_~i~0 % 256); 30352#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30353#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 30348#L71-2 assume !(1 == mp_add_~i~0 % 256); 30349#L72-1 assume !(2 == mp_add_~i~0 % 256); 30344#L73-1 assume !(3 == mp_add_~i~0 % 256); 30345#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; 30343#L76-1 [2018-11-23 00:15:59,668 INFO L796 eck$LassoCheckResult]: Loop: 30343#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 31081#L80-1 assume !(1 == mp_add_~i~0 % 256); 31080#L81-1 assume !(2 == mp_add_~i~0 % 256); 30336#L82-1 assume !(3 == mp_add_~i~0 % 256); 30337#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30331#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30332#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30205#L65 assume !(0 == mp_add_~i~0 % 256); 29954#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; 29955#L66-1 assume !(2 == mp_add_~i~0 % 256); 29948#L67-1 assume !(3 == mp_add_~i~0 % 256); 29949#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29942#L71 assume !(0 == mp_add_~i~0 % 256); 29943#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; 29935#L72-1 assume !(2 == mp_add_~i~0 % 256); 29936#L73-1 assume !(3 == mp_add_~i~0 % 256); 29925#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; 29927#L76-1 assume !(0 == mp_add_~i~0 % 256); 30473#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 30471#L81-1 assume !(2 == mp_add_~i~0 % 256); 30469#L82-1 assume !(3 == mp_add_~i~0 % 256); 30467#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30465#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30461#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30459#L65 assume !(0 == mp_add_~i~0 % 256); 30457#L65-2 assume !(1 == mp_add_~i~0 % 256); 30456#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; 30455#L67-1 assume !(3 == mp_add_~i~0 % 256); 30454#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30450#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; 30448#L76-1 assume !(0 == mp_add_~i~0 % 256); 30445#L80-1 assume !(1 == mp_add_~i~0 % 256); 30444#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 30304#L82-1 assume !(3 == mp_add_~i~0 % 256); 30442#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30440#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30438#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 30436#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30434#L71 assume !(0 == mp_add_~i~0 % 256); 30432#L71-2 assume !(1 == mp_add_~i~0 % 256); 30430#L72-1 assume !(2 == mp_add_~i~0 % 256); 30428#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; 30426#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; 30424#L76-1 assume !(0 == mp_add_~i~0 % 256); 30422#L80-1 assume !(1 == mp_add_~i~0 % 256); 30420#L81-1 assume !(2 == mp_add_~i~0 % 256); 30418#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 30413#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30412#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30410#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 30407#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30405#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30404#L76-1 assume !(0 == mp_add_~i~0 % 256); 30403#L80-1 assume !(1 == mp_add_~i~0 % 256); 30402#L81-1 assume !(2 == mp_add_~i~0 % 256); 30396#L82-1 assume !(3 == mp_add_~i~0 % 256); 30395#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30394#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30393#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 30382#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30376#L71 assume !(0 == mp_add_~i~0 % 256); 30392#L71-2 assume !(1 == mp_add_~i~0 % 256); 30391#L72-1 assume !(2 == mp_add_~i~0 % 256); 30390#L73-1 assume !(3 == mp_add_~i~0 % 256); 30389#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30388#L76-1 assume !(0 == mp_add_~i~0 % 256); 30387#L80-1 assume !(1 == mp_add_~i~0 % 256); 30386#L81-1 assume !(2 == mp_add_~i~0 % 256); 30385#L82-1 assume !(3 == mp_add_~i~0 % 256); 30384#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30383#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30381#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30380#L65 assume !(0 == mp_add_~i~0 % 256); 30379#L65-2 assume !(1 == mp_add_~i~0 % 256); 30378#L66-1 assume !(2 == mp_add_~i~0 % 256); 30377#L67-1 assume !(3 == mp_add_~i~0 % 256); 30375#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30272#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30374#L76-1 assume !(0 == mp_add_~i~0 % 256); 30373#L80-1 assume !(1 == mp_add_~i~0 % 256); 30372#L81-1 assume !(2 == mp_add_~i~0 % 256); 30371#L82-1 assume !(3 == mp_add_~i~0 % 256); 30368#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30369#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30362#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30363#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 30358#L65-2 assume !(1 == mp_add_~i~0 % 256); 30359#L66-1 assume !(2 == mp_add_~i~0 % 256); 30354#L67-1 assume !(3 == mp_add_~i~0 % 256); 30355#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30350#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 30351#L71-2 assume !(1 == mp_add_~i~0 % 256); 30346#L72-1 assume !(2 == mp_add_~i~0 % 256); 30347#L73-1 assume !(3 == mp_add_~i~0 % 256); 30342#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; 30343#L76-1 [2018-11-23 00:15:59,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash 149431148, now seen corresponding path program 1 times [2018-11-23 00:15:59,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:15:59,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:15:59,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1087474253, now seen corresponding path program 1 times [2018-11-23 00:15:59,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:15:59,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:15:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:59,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:59,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:15:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 155 proven. 1 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-11-23 00:15:59,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:15:59,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:15:59,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:15:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:15:59,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:16:00,074 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_3 Int) (ULTIMATE.start_mp_add_~nb~0 Int)) (let ((.cse0 (mod ULTIMATE.start_mp_add_~nb~0 256)) (.cse1 (mod v_prenex_3 256))) (and (< (mod c_ULTIMATE.start_mp_add_~i~0 256) .cse0) (<= .cse0 .cse1) (<= .cse1 2)))) is different from true [2018-11-23 00:16:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 160 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-23 00:16:00,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:16:00,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-23 00:16:00,101 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:16:00,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 00:16:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2018-11-23 00:16:00,102 INFO L87 Difference]: Start difference. First operand 1284 states and 1501 transitions. cyclomatic complexity: 225 Second operand 9 states. [2018-11-23 00:16:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:16:00,484 INFO L93 Difference]: Finished difference Result 1485 states and 1692 transitions. [2018-11-23 00:16:00,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 00:16:00,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1485 states and 1692 transitions. [2018-11-23 00:16:00,487 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 870 [2018-11-23 00:16:00,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1485 states to 1426 states and 1632 transitions. [2018-11-23 00:16:00,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1426 [2018-11-23 00:16:00,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1426 [2018-11-23 00:16:00,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1426 states and 1632 transitions. [2018-11-23 00:16:00,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:16:00,491 INFO L705 BuchiCegarLoop]: Abstraction has 1426 states and 1632 transitions. [2018-11-23 00:16:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states and 1632 transitions. [2018-11-23 00:16:00,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 1142. [2018-11-23 00:16:00,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-11-23 00:16:00,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1332 transitions. [2018-11-23 00:16:00,500 INFO L728 BuchiCegarLoop]: Abstraction has 1142 states and 1332 transitions. [2018-11-23 00:16:00,500 INFO L608 BuchiCegarLoop]: Abstraction has 1142 states and 1332 transitions. [2018-11-23 00:16:00,500 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 00:16:00,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1142 states and 1332 transitions. [2018-11-23 00:16:00,502 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 738 [2018-11-23 00:16:00,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:16:00,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:16:00,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:00,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:00,503 INFO L794 eck$LassoCheckResult]: Stem: 32981#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 32956#L40 assume !(0 == mp_add_~a3~0 % 256); 32952#L40-1 mp_add_~nb~0 := 4; 32953#L50 assume !(0 == mp_add_~b3~0 % 256); 32971#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 32972#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33496#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33497#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33631#L65-2 assume !(1 == mp_add_~i~0 % 256); 33628#L66-1 assume !(2 == mp_add_~i~0 % 256); 33629#L67-1 assume !(3 == mp_add_~i~0 % 256); 33624#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33625#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 33620#L71-2 assume !(1 == mp_add_~i~0 % 256); 33621#L72-1 assume !(2 == mp_add_~i~0 % 256); 33616#L73-1 assume !(3 == mp_add_~i~0 % 256); 33617#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; 33900#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 33899#L80-1 assume !(1 == mp_add_~i~0 % 256); 33898#L81-1 assume !(2 == mp_add_~i~0 % 256); 33897#L82-1 assume !(3 == mp_add_~i~0 % 256); 33895#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33889#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33435#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33434#L65 [2018-11-23 00:16:00,504 INFO L796 eck$LassoCheckResult]: Loop: 33434#L65 assume !(0 == mp_add_~i~0 % 256); 33430#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; 33431#L66-1 assume !(2 == mp_add_~i~0 % 256); 33608#L67-1 assume !(3 == mp_add_~i~0 % 256); 33607#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33606#L71 assume !(0 == mp_add_~i~0 % 256); 33605#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; 33604#L72-1 assume !(2 == mp_add_~i~0 % 256); 33603#L73-1 assume !(3 == mp_add_~i~0 % 256); 33601#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33600#L76-1 assume !(0 == mp_add_~i~0 % 256); 33599#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 33598#L81-1 assume !(2 == mp_add_~i~0 % 256); 33597#L82-1 assume !(3 == mp_add_~i~0 % 256); 33595#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33596#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33591#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33590#L65 assume !(0 == mp_add_~i~0 % 256); 33589#L65-2 assume !(1 == mp_add_~i~0 % 256); 33433#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; 33587#L67-1 assume !(3 == mp_add_~i~0 % 256); 33586#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33585#L71 assume !(0 == mp_add_~i~0 % 256); 33584#L71-2 assume !(1 == mp_add_~i~0 % 256); 33583#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; 33582#L73-1 assume !(3 == mp_add_~i~0 % 256); 33580#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33578#L76-1 assume !(0 == mp_add_~i~0 % 256); 33579#L80-1 assume !(1 == mp_add_~i~0 % 256); 33526#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 33527#L82-1 assume !(3 == mp_add_~i~0 % 256); 33518#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33519#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_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; 33507#L65 assume !(0 == mp_add_~i~0 % 256); 33506#L65-2 assume !(1 == mp_add_~i~0 % 256); 33501#L66-1 assume !(2 == mp_add_~i~0 % 256); 33485#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; 33486#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33481#L71 assume !(0 == mp_add_~i~0 % 256); 33482#L71-2 assume !(1 == mp_add_~i~0 % 256); 33477#L72-1 assume !(2 == mp_add_~i~0 % 256); 33478#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; 33472#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; 33474#L76-1 assume !(0 == mp_add_~i~0 % 256); 33468#L80-1 assume !(1 == mp_add_~i~0 % 256); 33469#L81-1 assume !(2 == mp_add_~i~0 % 256); 33464#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33465#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33460#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33461#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33453#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33452#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33451#L76-1 assume !(0 == mp_add_~i~0 % 256); 33450#L80-1 assume !(1 == mp_add_~i~0 % 256); 33449#L81-1 assume !(2 == mp_add_~i~0 % 256); 33448#L82-1 assume !(3 == mp_add_~i~0 % 256); 33447#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33446#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33444#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33441#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33442#L65-2 assume !(1 == mp_add_~i~0 % 256); 33630#L66-1 assume !(2 == mp_add_~i~0 % 256); 33626#L67-1 assume !(3 == mp_add_~i~0 % 256); 33627#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33622#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 33623#L71-2 assume !(1 == mp_add_~i~0 % 256); 33618#L72-1 assume !(2 == mp_add_~i~0 % 256); 33619#L73-1 assume !(3 == mp_add_~i~0 % 256); 33614#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 33613#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 33612#L80-1 assume !(1 == mp_add_~i~0 % 256); 33611#L81-1 assume !(2 == mp_add_~i~0 % 256); 33531#L82-1 assume !(3 == mp_add_~i~0 % 256); 33502#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33487#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33488#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33434#L65 [2018-11-23 00:16:00,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 8 times [2018-11-23 00:16:00,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:00,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:00,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:00,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 584828071, now seen corresponding path program 1 times [2018-11-23 00:16:00,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:00,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:00,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:16:00,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:16:00,568 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 00:16:00,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:16:00,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:16:00,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:16:00,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:16:00,663 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 00:16:00,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:16:00,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 00:16:00,678 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:16:00,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 00:16:00,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 00:16:00,679 INFO L87 Difference]: Start difference. First operand 1142 states and 1332 transitions. cyclomatic complexity: 200 Second operand 8 states. [2018-11-23 00:16:02,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:16:02,650 INFO L93 Difference]: Finished difference Result 1404 states and 1561 transitions. [2018-11-23 00:16:02,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 00:16:02,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1404 states and 1561 transitions. [2018-11-23 00:16:02,653 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 763 [2018-11-23 00:16:02,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1404 states to 1316 states and 1447 transitions. [2018-11-23 00:16:02,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1316 [2018-11-23 00:16:02,655 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1316 [2018-11-23 00:16:02,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1316 states and 1447 transitions. [2018-11-23 00:16:02,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:16:02,655 INFO L705 BuchiCegarLoop]: Abstraction has 1316 states and 1447 transitions. [2018-11-23 00:16:02,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states and 1447 transitions. [2018-11-23 00:16:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 907. [2018-11-23 00:16:02,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2018-11-23 00:16:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1004 transitions. [2018-11-23 00:16:02,665 INFO L728 BuchiCegarLoop]: Abstraction has 907 states and 1004 transitions. [2018-11-23 00:16:02,665 INFO L608 BuchiCegarLoop]: Abstraction has 907 states and 1004 transitions. [2018-11-23 00:16:02,665 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 00:16:02,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 907 states and 1004 transitions. [2018-11-23 00:16:02,667 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 554 [2018-11-23 00:16:02,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:16:02,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:16:02,668 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:02,668 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:02,671 INFO L794 eck$LassoCheckResult]: Stem: 35767#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 35760#L40 assume !(0 == mp_add_~a3~0 % 256); 35761#L40-1 mp_add_~nb~0 := 4; 36002#L50 assume !(0 == mp_add_~b3~0 % 256); 36003#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 35998#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35999#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35994#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 35995#L65-2 assume !(1 == mp_add_~i~0 % 256); 35990#L66-1 assume !(2 == mp_add_~i~0 % 256); 35991#L67-1 assume !(3 == mp_add_~i~0 % 256); 35986#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35987#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 35982#L71-2 assume !(1 == mp_add_~i~0 % 256); 35983#L72-1 assume !(2 == mp_add_~i~0 % 256); 35978#L73-1 assume !(3 == mp_add_~i~0 % 256); 35979#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; 36269#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36268#L80-1 assume !(1 == mp_add_~i~0 % 256); 36267#L81-1 assume !(2 == mp_add_~i~0 % 256); 36266#L82-1 assume !(3 == mp_add_~i~0 % 256); 36265#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36264#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36263#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35778#L65 assume !(0 == mp_add_~i~0 % 256); 35779#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; 36121#L66-1 [2018-11-23 00:16:02,671 INFO L796 eck$LassoCheckResult]: Loop: 36121#L66-1 assume !(2 == mp_add_~i~0 % 256); 36262#L67-1 assume !(3 == mp_add_~i~0 % 256); 36261#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36260#L71 assume !(0 == mp_add_~i~0 % 256); 36259#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; 36258#L72-1 assume !(2 == mp_add_~i~0 % 256); 36257#L73-1 assume !(3 == mp_add_~i~0 % 256); 36256#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; 36255#L76-1 assume !(0 == mp_add_~i~0 % 256); 36253#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 36251#L81-1 assume !(2 == mp_add_~i~0 % 256); 36249#L82-1 assume !(3 == mp_add_~i~0 % 256); 36247#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36245#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36243#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36240#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36239#L71 assume !(0 == mp_add_~i~0 % 256); 36206#L71-2 assume !(1 == mp_add_~i~0 % 256); 36205#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; 36204#L73-1 assume !(3 == mp_add_~i~0 % 256); 36202#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; 36201#L76-1 assume !(0 == mp_add_~i~0 % 256); 36200#L80-1 assume !(1 == mp_add_~i~0 % 256); 36199#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 36198#L82-1 assume !(3 == mp_add_~i~0 % 256); 36197#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36195#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36193#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36189#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 36152#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36188#L76-1 assume !(0 == mp_add_~i~0 % 256); 36187#L80-1 assume !(1 == mp_add_~i~0 % 256); 36185#L81-1 assume !(2 == mp_add_~i~0 % 256); 36182#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 36141#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36180#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36179#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36178#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36177#L71 assume !(0 == mp_add_~i~0 % 256); 36118#L71-2 assume !(1 == mp_add_~i~0 % 256); 36119#L72-1 assume !(2 == mp_add_~i~0 % 256); 36102#L73-1 assume !(3 == mp_add_~i~0 % 256); 36103#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36092#L76-1 assume !(0 == mp_add_~i~0 % 256); 36093#L80-1 assume !(1 == mp_add_~i~0 % 256); 36082#L81-1 assume !(2 == mp_add_~i~0 % 256); 36083#L82-1 assume !(3 == mp_add_~i~0 % 256); 36074#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36075#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36055#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36051#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36050#L71 assume !(0 == mp_add_~i~0 % 256); 36046#L71-2 assume !(1 == mp_add_~i~0 % 256); 36043#L72-1 assume !(2 == mp_add_~i~0 % 256); 36042#L73-1 assume !(3 == mp_add_~i~0 % 256); 36041#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36040#L76-1 assume !(0 == mp_add_~i~0 % 256); 36039#L80-1 assume !(1 == mp_add_~i~0 % 256); 36038#L81-1 assume !(2 == mp_add_~i~0 % 256); 36036#L82-1 assume !(3 == mp_add_~i~0 % 256); 36037#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36032#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36033#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36122#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36488#L71 assume !(0 == mp_add_~i~0 % 256); 36168#L71-2 assume !(1 == mp_add_~i~0 % 256); 36165#L72-1 assume !(2 == mp_add_~i~0 % 256); 36151#L73-1 assume !(3 == mp_add_~i~0 % 256); 36149#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36147#L76-1 assume !(0 == mp_add_~i~0 % 256); 36145#L80-1 assume !(1 == mp_add_~i~0 % 256); 36143#L81-1 assume !(2 == mp_add_~i~0 % 256); 36140#L82-1 assume !(3 == mp_add_~i~0 % 256); 35799#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 35800#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 35790#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 35791#L65 assume !(0 == mp_add_~i~0 % 256); 36120#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; 36121#L66-1 [2018-11-23 00:16:02,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 3 times [2018-11-23 00:16:02,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:02,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:02,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:02,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:02,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:02,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1984374623, now seen corresponding path program 1 times [2018-11-23 00:16:02,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:02,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:02,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:16:02,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:16:02,842 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 00:16:02,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:16:02,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:16:02,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:16:02,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:16:03,479 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 00:16:03,771 WARN L854 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~i~0 Int) (ULTIMATE.start_mp_add_~nb~0 Int)) (let ((.cse0 (mod ULTIMATE.start_mp_add_~i~0 256))) (and (<= (mod c_ULTIMATE.start_mp_add_~na~0 256) .cse0) (<= ULTIMATE.start_mp_add_~nb~0 (+ (* 256 (div ULTIMATE.start_mp_add_~nb~0 256)) 3)) (< .cse0 (mod ULTIMATE.start_mp_add_~nb~0 256)) (not (= 2 .cse0))))) is different from true [2018-11-23 00:16:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 32 not checked. [2018-11-23 00:16:05,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:16:05,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2018-11-23 00:16:05,854 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 00:16:05,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 00:16:05,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=88, Unknown=3, NotChecked=20, Total=156 [2018-11-23 00:16:05,854 INFO L87 Difference]: Start difference. First operand 907 states and 1004 transitions. cyclomatic complexity: 105 Second operand 13 states. [2018-11-23 00:16:06,650 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 00:16:07,163 WARN L180 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-11-23 00:16:07,900 WARN L180 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-23 00:16:07,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:16:07,913 INFO L93 Difference]: Finished difference Result 618 states and 651 transitions. [2018-11-23 00:16:07,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 00:16:07,913 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 618 states and 651 transitions. [2018-11-23 00:16:07,914 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2018-11-23 00:16:07,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 618 states to 522 states and 553 transitions. [2018-11-23 00:16:07,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2018-11-23 00:16:07,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2018-11-23 00:16:07,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 553 transitions. [2018-11-23 00:16:07,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:16:07,915 INFO L705 BuchiCegarLoop]: Abstraction has 522 states and 553 transitions. [2018-11-23 00:16:07,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 553 transitions. [2018-11-23 00:16:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 472. [2018-11-23 00:16:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-11-23 00:16:07,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 502 transitions. [2018-11-23 00:16:07,919 INFO L728 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2018-11-23 00:16:07,919 INFO L608 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2018-11-23 00:16:07,919 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 00:16:07,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 472 states and 502 transitions. [2018-11-23 00:16:07,921 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2018-11-23 00:16:07,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:16:07,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:16:07,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:07,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:07,921 INFO L794 eck$LassoCheckResult]: Stem: 37552#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 37543#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37545#L42 assume !(0 == mp_add_~a2~0 % 256); 37535#L40-1 mp_add_~nb~0 := 4; 37536#L50 assume !(0 == mp_add_~b3~0 % 256); 37606#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 37607#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37602#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37603#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 37598#L65-2 assume !(1 == mp_add_~i~0 % 256); 37599#L66-1 assume !(2 == mp_add_~i~0 % 256); 37594#L67-1 assume !(3 == mp_add_~i~0 % 256); 37595#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37590#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 37591#L71-2 assume !(1 == mp_add_~i~0 % 256); 37586#L72-1 assume !(2 == mp_add_~i~0 % 256); 37587#L73-1 assume !(3 == mp_add_~i~0 % 256); 37581#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; 37583#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 37693#L80-1 assume !(1 == mp_add_~i~0 % 256); 37691#L81-1 assume !(2 == mp_add_~i~0 % 256); 37692#L82-1 assume !(3 == mp_add_~i~0 % 256); 37689#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37690#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37943#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37940#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37938#L71 assume !(0 == mp_add_~i~0 % 256); 37936#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; 37934#L72-1 assume !(2 == mp_add_~i~0 % 256); 37932#L73-1 assume !(3 == mp_add_~i~0 % 256); 37929#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37926#L76-1 assume !(0 == mp_add_~i~0 % 256); 37927#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 37922#L81-1 assume !(2 == mp_add_~i~0 % 256); 37923#L82-1 assume !(3 == mp_add_~i~0 % 256); 37918#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37919#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37914#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37915#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37910#L71 assume !(0 == mp_add_~i~0 % 256); 37911#L71-2 assume !(1 == mp_add_~i~0 % 256); 37907#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; 37546#L73-1 assume !(3 == mp_add_~i~0 % 256); 37529#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37530#L76-1 assume !(0 == mp_add_~i~0 % 256); 37522#L80-1 assume !(1 == mp_add_~i~0 % 256); 37523#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 37526#L82-1 assume !(3 == mp_add_~i~0 % 256); 37983#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37981#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37979#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; 37550#L71 assume !(0 == mp_add_~i~0 % 256); 37975#L71-2 assume !(1 == mp_add_~i~0 % 256); 37974#L72-1 assume !(2 == mp_add_~i~0 % 256); 37972#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; 37970#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37969#L76-1 assume !(0 == mp_add_~i~0 % 256); 37968#L80-1 assume !(1 == mp_add_~i~0 % 256); 37967#L81-1 assume !(2 == mp_add_~i~0 % 256); 37966#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 37534#L83-1 [2018-11-23 00:16:07,922 INFO L796 eck$LassoCheckResult]: Loop: 37534#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37527#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37528#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37553#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37537#L71 assume !(0 == mp_add_~i~0 % 256); 37538#L71-2 assume !(1 == mp_add_~i~0 % 256); 37539#L72-1 assume !(2 == mp_add_~i~0 % 256); 37540#L73-1 assume !(3 == mp_add_~i~0 % 256); 37991#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37990#L76-1 assume !(0 == mp_add_~i~0 % 256); 37988#L80-1 assume !(1 == mp_add_~i~0 % 256); 37986#L81-1 assume !(2 == mp_add_~i~0 % 256); 37533#L82-1 assume !(3 == mp_add_~i~0 % 256); 37534#L83-1 [2018-11-23 00:16:07,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:07,922 INFO L82 PathProgramCache]: Analyzing trace with hash -959140882, now seen corresponding path program 1 times [2018-11-23 00:16:07,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:07,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:07,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:07,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:07,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:16:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 00:16:07,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:16:07,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:16:08,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:16:08,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:16:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 00:16:08,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:16:08,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2018-11-23 00:16:08,111 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 00:16:08,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:08,111 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 1 times [2018-11-23 00:16:08,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:08,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:08,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:08,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:08,178 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:16:08,178 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:16:08,178 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:16:08,178 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:16:08,178 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 00:16:08,178 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:16:08,178 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:16:08,178 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:16:08,178 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-23 00:16:08,178 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:16:08,178 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:16:08,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:16:08,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-23 00:16:08,337 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:16:08,337 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:16:08,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:16:08,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:16:08,348 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 00:16:08,348 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:16:08,364 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:16:08,364 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:16:08,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 00:16:08,433 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:16:19,478 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 00:16:19,480 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:16:19,480 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:16:19,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:16:19,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:16:19,480 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:16:19,480 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:16:19,480 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:16:19,480 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:16:19,480 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2018-11-23 00:16:19,480 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:16:19,480 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:16:19,481 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-23 00:16:19,485 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-23 00:16:19,601 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:16:19,602 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:16:19,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:16:19,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:16:19,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:16:19,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:16:19,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,606 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:16:19,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-23 00:16:19,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:19,607 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:19,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:19,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:19,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,612 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:16:19,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,613 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:19,613 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:19,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,614 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:19,615 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:19,615 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,618 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:16:19,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,619 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:19,619 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:19,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:19,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,621 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:19,621 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:19,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,625 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:16:19,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-23 00:16:19,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,625 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:19,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,626 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:19,626 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:19,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:19,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,628 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:19,629 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:19,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,633 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:16:19,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,634 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:16:19,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,634 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:19,635 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:19,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,637 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:16:19,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:19,639 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:19,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,646 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:16:19,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,647 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:19,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,647 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:19,649 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:19,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,650 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:19,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,651 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:19,653 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:19,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,666 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:16:19,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,666 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,667 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:19,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,667 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:19,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:19,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,670 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:19,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,671 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:19,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:19,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,675 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,676 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:16:19,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,676 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,676 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:19,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,677 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:16:19,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:16:19,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:19,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:19,682 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:19,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:19,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:19,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:19,682 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:16:19,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:16:19,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:19,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:19,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 00:16:19,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 00:16:19,693 INFO L87 Difference]: Start difference. First operand 472 states and 502 transitions. cyclomatic complexity: 34 Second operand 12 states. [2018-11-23 00:16:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:16:20,202 INFO L93 Difference]: Finished difference Result 580 states and 608 transitions. [2018-11-23 00:16:20,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:16:20,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 608 transitions. [2018-11-23 00:16:20,204 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 123 [2018-11-23 00:16:20,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 561 states and 589 transitions. [2018-11-23 00:16:20,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2018-11-23 00:16:20,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2018-11-23 00:16:20,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 589 transitions. [2018-11-23 00:16:20,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:16:20,206 INFO L705 BuchiCegarLoop]: Abstraction has 561 states and 589 transitions. [2018-11-23 00:16:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 589 transitions. [2018-11-23 00:16:20,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 425. [2018-11-23 00:16:20,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-23 00:16:20,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 449 transitions. [2018-11-23 00:16:20,211 INFO L728 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2018-11-23 00:16:20,211 INFO L608 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2018-11-23 00:16:20,211 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-23 00:16:20,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 449 transitions. [2018-11-23 00:16:20,212 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2018-11-23 00:16:20,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:16:20,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:16:20,213 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:20,213 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 00:16:20,213 INFO L794 eck$LassoCheckResult]: Stem: 38802#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 38795#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38797#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38801#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 38807#L40-1 mp_add_~nb~0 := 4; 38848#L50 assume !(0 == mp_add_~b3~0 % 256); 38786#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 38787#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38851#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 38849#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 38850#L65-2 assume !(1 == mp_add_~i~0 % 256); 38805#L66-1 assume !(2 == mp_add_~i~0 % 256); 38806#L67-1 assume !(3 == mp_add_~i~0 % 256); 38809#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39199#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 39197#L71-2 assume !(1 == mp_add_~i~0 % 256); 39195#L72-1 assume !(2 == mp_add_~i~0 % 256); 39193#L73-1 assume !(3 == mp_add_~i~0 % 256); 39191#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39190#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 39189#L80-1 assume !(1 == mp_add_~i~0 % 256); 39188#L81-1 assume !(2 == mp_add_~i~0 % 256); 39187#L82-1 assume !(3 == mp_add_~i~0 % 256); 39186#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39185#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39183#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39181#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39179#L71 assume !(0 == mp_add_~i~0 % 256); 39177#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; 39175#L72-1 assume !(2 == mp_add_~i~0 % 256); 39173#L73-1 assume !(3 == mp_add_~i~0 % 256); 39171#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39169#L76-1 assume !(0 == mp_add_~i~0 % 256); 39167#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 39165#L81-1 assume !(2 == mp_add_~i~0 % 256); 39163#L82-1 assume !(3 == mp_add_~i~0 % 256); 39161#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39159#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39157#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39155#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39153#L71 assume !(0 == mp_add_~i~0 % 256); 39151#L71-2 assume !(1 == mp_add_~i~0 % 256); 39149#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; 39147#L73-1 assume !(3 == mp_add_~i~0 % 256); 39145#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39143#L76-1 assume !(0 == mp_add_~i~0 % 256); 39141#L80-1 assume !(1 == mp_add_~i~0 % 256); 39139#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 39137#L82-1 assume !(3 == mp_add_~i~0 % 256); 39135#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 39133#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 39131#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 39129#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 39127#L71 assume !(0 == mp_add_~i~0 % 256); 39125#L71-2 assume !(1 == mp_add_~i~0 % 256); 39123#L72-1 assume !(2 == mp_add_~i~0 % 256); 39121#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; 39119#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 39118#L76-1 assume !(0 == mp_add_~i~0 % 256); 39117#L80-1 assume !(1 == mp_add_~i~0 % 256); 39116#L81-1 assume !(2 == mp_add_~i~0 % 256); 39115#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 38788#L83-1 [2018-11-23 00:16:20,213 INFO L796 eck$LassoCheckResult]: Loop: 38788#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 38782#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 38783#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 38800#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 38791#L71 assume !(0 == mp_add_~i~0 % 256); 38779#L71-2 assume !(1 == mp_add_~i~0 % 256); 38780#L72-1 assume !(2 == mp_add_~i~0 % 256); 38792#L73-1 assume !(3 == mp_add_~i~0 % 256); 38784#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 38785#L76-1 assume !(0 == mp_add_~i~0 % 256); 38777#L80-1 assume !(1 == mp_add_~i~0 % 256); 38778#L81-1 assume !(2 == mp_add_~i~0 % 256); 38781#L82-1 assume !(3 == mp_add_~i~0 % 256); 38788#L83-1 [2018-11-23 00:16:20,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash 773605064, now seen corresponding path program 1 times [2018-11-23 00:16:20,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:20,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:20,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:20,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:20,235 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 2 times [2018-11-23 00:16:20,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:20,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:20,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:16:20,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:16:20,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:16:20,240 INFO L82 PathProgramCache]: Analyzing trace with hash -600207712, now seen corresponding path program 2 times [2018-11-23 00:16:20,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:16:20,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:16:20,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:20,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:16:20,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:16:20,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:16:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-23 00:16:20,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:16:20,459 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 00:16:20,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 00:16:20,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 00:16:20,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:16:20,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:16:20,698 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 00:16:20,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:16:20,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2018-11-23 00:16:20,768 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:16:20,769 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:16:20,769 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:16:20,769 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:16:20,769 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 00:16:20,769 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:16:20,769 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:16:20,769 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:16:20,769 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-23 00:16:20,769 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:16:20,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:16:20,770 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-23 00:16:20,780 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-23 00:16:20,894 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:16:20,894 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:16:20,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 00:16:20,897 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f4dbba16-b953-4a65-91c3-b6e80c2c5db5/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-23 00:16:20,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 00:16:20,938 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 00:16:28,645 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 00:16:28,647 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:16:28,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:16:28,648 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:16:28,648 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:16:28,648 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:16:28,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:16:28,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:16:28,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:16:28,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2018-11-23 00:16:28,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:16:28,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:16:28,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:16:28,659 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-23 00:16:28,776 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:16:28,776 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:16:28,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:16:28,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:16:28,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,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-23 00:16:28,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:16:28,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:16:28,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,781 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:16:28,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,782 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:28,782 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:28,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,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-23 00:16:28,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:28,786 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:28,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,786 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:16:28,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,787 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:28,788 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:28,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,790 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,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-23 00:16:28,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,791 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:28,792 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:28,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,793 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:16:28,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,793 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:28,794 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:28,794 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:16:28,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,798 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:28,799 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:28,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,799 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:16:28,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,800 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:28,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,800 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:28,801 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:28,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,807 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:28,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,807 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:16:28,808 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:16:28,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,809 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:16:28,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,809 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:16:28,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:28,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:28,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,818 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:16:28,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:28,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:28,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,820 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:16:28,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,821 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,821 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:28,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,821 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:28,823 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:28,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,832 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:28,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:16:28,834 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:16:28,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,835 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:16:28,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,835 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,835 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:28,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:28,836 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:28,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,841 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,842 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:16:28,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:16:28,842 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:16:28,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,844 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:16:28,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,845 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,845 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:28,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,845 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:16:28,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:16:28,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:16:28,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:16:28,854 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:16:28,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:16:28,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:16:28,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:16:28,855 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:16:28,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:16:28,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:16:28,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:16:28,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 00:16:28,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-23 00:16:28,859 INFO L87 Difference]: Start difference. First operand 425 states and 449 transitions. cyclomatic complexity: 28 Second operand 16 states. [2018-11-23 00:16:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:16:29,401 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2018-11-23 00:16:29,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 00:16:29,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 366 transitions. [2018-11-23 00:16:29,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:16:29,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 0 states and 0 transitions. [2018-11-23 00:16:29,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 00:16:29,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 00:16:29,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 00:16:29,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:16:29,403 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:16:29,403 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:16:29,403 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 00:16:29,403 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-23 00:16:29,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 00:16:29,403 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 00:16:29,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 00:16:29,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:16:29 BoogieIcfgContainer [2018-11-23 00:16:29,412 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:16:29,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:16:29,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:16:29,412 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:16:29,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:15:17" (3/4) ... [2018-11-23 00:16:29,416 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 00:16:29,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:16:29,417 INFO L168 Benchmark]: Toolchain (without parser) took 72613.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.9 MB). Free memory was 958.1 MB in the beginning and 1.1 GB in the end (delta: -175.4 MB). Peak memory consumption was 242.5 MB. Max. memory is 11.5 GB. [2018-11-23 00:16:29,417 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:16:29,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.88 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.4 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 00:16:29,418 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -221.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 00:16:29,418 INFO L168 Benchmark]: Boogie Preprocessor took 20.14 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-23 00:16:29,419 INFO L168 Benchmark]: RCFGBuilder took 270.62 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:16:29,419 INFO L168 Benchmark]: BuchiAutomizer took 72047.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.2 MB). Peak memory consumption was 251.8 MB. Max. memory is 11.5 GB. [2018-11-23 00:16:29,419 INFO L168 Benchmark]: Witness Printer took 4.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:16:29,422 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.88 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 944.4 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 65.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 944.4 MB in the beginning and 1.2 GB in the end (delta: -221.1 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.14 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 270.62 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 72047.29 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 250.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.2 MB). Peak memory consumption was 251.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.12 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 25 terminating modules (25 trivial, 0 deterministic, 0 nondeterministic). 25 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 72.0s and 26 iterations. TraceHistogramMax:7. Analysis of lassos took 45.2s. Construction of modules took 17.8s. Büchi inclusion checks took 8.3s. Highest rank in rank-based complementation 0. Minimization of det autom 25. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 5992 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1701 states and ocurred in iteration 18. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1042 SDtfs, 5092 SDslu, 2064 SDs, 0 SdLazy, 9236 SolverSat, 834 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 17.8s Time LassoAnalysisResults: nont0 unkn0 SFLI15 SFLT0 conc4 concLT0 SILN0 SILU2 SILI4 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf98 lsp64 ukn100 mio100 lsp100 div580 bol100 ite100 ukn100 eq143 hnf42 smp84 dnf100 smp100 tf102 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 13ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 34.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...