./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-0ed9222-m [2019-01-14 02:50:00,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:50:00,873 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:50:00,886 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:50:00,886 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:50:00,887 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:50:00,888 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:50:00,891 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:50:00,893 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:50:00,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:50:00,895 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:50:00,895 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:50:00,897 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:50:00,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:50:00,899 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:50:00,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:50:00,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:50:00,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:50:00,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:50:00,908 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:50:00,909 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:50:00,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:50:00,913 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:50:00,914 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:50:00,914 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:50:00,915 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:50:00,916 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:50:00,917 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:50:00,919 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:50:00,920 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:50:00,920 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:50:00,921 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:50:00,922 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:50:00,922 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:50:00,923 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:50:00,924 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:50:00,925 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:50:00,943 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:50:00,943 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:50:00,945 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:50:00,945 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:50:00,945 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:50:00,945 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:50:00,945 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:50:00,946 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:50:00,946 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:50:00,947 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:50:00,947 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:50:00,947 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:50:00,947 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:50:00,947 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:50:00,947 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:50:00,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:50:00,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:50:00,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:50:00,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:50:00,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:50:00,948 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:50:00,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:50:00,950 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:50:00,950 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:50:00,950 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:50:00,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:50:00,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:50:00,951 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:50:00,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:50:00,951 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:50:00,952 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:50:00,952 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:50:00,954 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2019-01-14 02:50:00,989 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:50:01,002 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:50:01,008 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:50:01,010 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:50:01,011 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:50:01,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:01,079 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94edfda4f/daa09e49b71c4c1998a3839286dd797d/FLAG4235f42e2 [2019-01-14 02:50:01,541 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:50:01,545 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:01,557 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94edfda4f/daa09e49b71c4c1998a3839286dd797d/FLAG4235f42e2 [2019-01-14 02:50:01,860 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94edfda4f/daa09e49b71c4c1998a3839286dd797d [2019-01-14 02:50:01,866 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:50:01,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:50:01,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:01,870 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:50:01,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:50:01,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:01" (1/1) ... [2019-01-14 02:50:01,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4b0452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:01, skipping insertion in model container [2019-01-14 02:50:01,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:50:01" (1/1) ... [2019-01-14 02:50:01,886 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:50:01,916 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:50:02,194 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:02,201 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:50:02,268 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:50:02,290 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:50:02,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02 WrapperNode [2019-01-14 02:50:02,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:50:02,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:02,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:50:02,293 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:50:02,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:50:02,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:50:02,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:50:02,356 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:50:02,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... [2019-01-14 02:50:02,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:50:02,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:50:02,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:50:02,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:50:02,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:02,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:50:02,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:50:03,080 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:50:03,081 INFO L286 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-14 02:50:03,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:03 BoogieIcfgContainer [2019-01-14 02:50:03,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:50:03,083 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:50:03,083 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:50:03,087 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:50:03,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:03,088 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:50:01" (1/3) ... [2019-01-14 02:50:03,089 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aca110f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:03, skipping insertion in model container [2019-01-14 02:50:03,089 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:03,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:50:02" (2/3) ... [2019-01-14 02:50:03,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7aca110f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:50:03, skipping insertion in model container [2019-01-14 02:50:03,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:50:03,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:03" (3/3) ... [2019-01-14 02:50:03,095 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_2_true-unreach-call_true-no-overflow_true-termination.i [2019-01-14 02:50:03,155 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:50:03,156 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:50:03,156 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:50:03,157 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:50:03,157 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:50:03,157 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:50:03,157 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:50:03,157 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:50:03,158 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:50:03,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-14 02:50:03,209 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-14 02:50:03,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:03,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:03,217 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:50:03,218 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:03,218 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:50:03,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-14 02:50:03,221 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-14 02:50:03,222 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:03,222 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:03,222 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:50:03,223 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:03,229 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 [2019-01-14 02:50:03,230 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 [2019-01-14 02:50:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2019-01-14 02:50:03,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:03,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:03,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:03,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:03,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:03,389 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2019-01-14 02:50:03,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:03,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:03,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:03,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:03,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:03,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:03,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:50:03,493 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:03,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:03,508 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-14 02:50:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:04,020 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2019-01-14 02:50:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:04,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2019-01-14 02:50:04,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2019-01-14 02:50:04,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2019-01-14 02:50:04,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-14 02:50:04,034 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-01-14 02:50:04,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2019-01-14 02:50:04,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:04,035 INFO L706 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2019-01-14 02:50:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2019-01-14 02:50:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-01-14 02:50:04,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 02:50:04,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2019-01-14 02:50:04,065 INFO L729 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-14 02:50:04,066 INFO L609 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-14 02:50:04,066 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:50:04,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2019-01-14 02:50:04,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-01-14 02:50:04,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:04,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:04,069 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:04,069 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:04,069 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 [2019-01-14 02:50:04,069 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 [2019-01-14 02:50:04,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:04,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2019-01-14 02:50:04,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:04,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:04,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:04,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:04,511 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-01-14 02:50:04,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:04,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:04,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:04,549 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2019-01-14 02:50:04,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:04,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:04,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:04,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:04,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:04,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:04,704 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:04,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:50:04,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:50:04,705 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-14 02:50:05,166 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2019-01-14 02:50:06,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:06,800 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2019-01-14 02:50:06,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:50:06,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2019-01-14 02:50:06,808 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2019-01-14 02:50:06,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2019-01-14 02:50:06,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-01-14 02:50:06,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2019-01-14 02:50:06,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2019-01-14 02:50:06,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:06,815 INFO L706 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-01-14 02:50:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2019-01-14 02:50:06,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2019-01-14 02:50:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 02:50:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2019-01-14 02:50:06,831 INFO L729 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-14 02:50:06,831 INFO L609 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-14 02:50:06,831 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:50:06,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2019-01-14 02:50:06,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2019-01-14 02:50:06,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:06,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:06,835 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:06,835 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:06,836 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 [2019-01-14 02:50:06,836 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 [2019-01-14 02:50:06,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:06,836 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2019-01-14 02:50:06,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:06,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:06,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:07,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:07,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:07,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:50:07,137 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:07,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:07,137 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2019-01-14 02:50:07,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:07,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:07,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:07,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:07,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:07,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:07,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:07,227 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:07,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:50:07,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:50:07,227 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2019-01-14 02:50:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:08,607 INFO L93 Difference]: Finished difference Result 373 states and 546 transitions. [2019-01-14 02:50:08,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:50:08,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 373 states and 546 transitions. [2019-01-14 02:50:08,616 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 255 [2019-01-14 02:50:08,621 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 373 states to 373 states and 546 transitions. [2019-01-14 02:50:08,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2019-01-14 02:50:08,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2019-01-14 02:50:08,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 546 transitions. [2019-01-14 02:50:08,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:08,627 INFO L706 BuchiCegarLoop]: Abstraction has 373 states and 546 transitions. [2019-01-14 02:50:08,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 546 transitions. [2019-01-14 02:50:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 201. [2019-01-14 02:50:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-14 02:50:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 289 transitions. [2019-01-14 02:50:08,647 INFO L729 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2019-01-14 02:50:08,647 INFO L609 BuchiCegarLoop]: Abstraction has 201 states and 289 transitions. [2019-01-14 02:50:08,647 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:50:08,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 289 transitions. [2019-01-14 02:50:08,650 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2019-01-14 02:50:08,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:08,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:08,651 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:08,652 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:08,653 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 [2019-01-14 02:50:08,653 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 [2019-01-14 02:50:08,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:08,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1341941206, now seen corresponding path program 1 times [2019-01-14 02:50:08,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:08,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:08,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:08,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:50:08,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:08,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 3 times [2019-01-14 02:50:08,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:08,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:08,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:09,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:09,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:09,009 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:09,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:09,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:09,010 INFO L87 Difference]: Start difference. First operand 201 states and 289 transitions. cyclomatic complexity: 93 Second operand 8 states. [2019-01-14 02:50:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:11,373 INFO L93 Difference]: Finished difference Result 418 states and 616 transitions. [2019-01-14 02:50:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:50:11,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 418 states and 616 transitions. [2019-01-14 02:50:11,379 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 306 [2019-01-14 02:50:11,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 418 states to 418 states and 616 transitions. [2019-01-14 02:50:11,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 418 [2019-01-14 02:50:11,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 418 [2019-01-14 02:50:11,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 418 states and 616 transitions. [2019-01-14 02:50:11,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:11,387 INFO L706 BuchiCegarLoop]: Abstraction has 418 states and 616 transitions. [2019-01-14 02:50:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states and 616 transitions. [2019-01-14 02:50:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 276. [2019-01-14 02:50:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-14 02:50:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 395 transitions. [2019-01-14 02:50:11,415 INFO L729 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2019-01-14 02:50:11,415 INFO L609 BuchiCegarLoop]: Abstraction has 276 states and 395 transitions. [2019-01-14 02:50:11,416 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:50:11,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 276 states and 395 transitions. [2019-01-14 02:50:11,419 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 166 [2019-01-14 02:50:11,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:11,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:11,421 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:11,421 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:11,421 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 [2019-01-14 02:50:11,421 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 [2019-01-14 02:50:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:11,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199508, now seen corresponding path program 1 times [2019-01-14 02:50:11,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:11,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:11,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:11,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:11,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:50:11,697 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:11,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:11,698 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 4 times [2019-01-14 02:50:11,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:11,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:11,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:11,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:11,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:11,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:11,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:11,859 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:11,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:11,859 INFO L87 Difference]: Start difference. First operand 276 states and 395 transitions. cyclomatic complexity: 126 Second operand 8 states. [2019-01-14 02:50:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:13,432 INFO L93 Difference]: Finished difference Result 375 states and 533 transitions. [2019-01-14 02:50:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 02:50:13,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 533 transitions. [2019-01-14 02:50:13,438 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2019-01-14 02:50:13,440 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 533 transitions. [2019-01-14 02:50:13,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2019-01-14 02:50:13,441 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2019-01-14 02:50:13,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 533 transitions. [2019-01-14 02:50:13,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:13,442 INFO L706 BuchiCegarLoop]: Abstraction has 375 states and 533 transitions. [2019-01-14 02:50:13,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 533 transitions. [2019-01-14 02:50:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 300. [2019-01-14 02:50:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-01-14 02:50:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 431 transitions. [2019-01-14 02:50:13,453 INFO L729 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2019-01-14 02:50:13,453 INFO L609 BuchiCegarLoop]: Abstraction has 300 states and 431 transitions. [2019-01-14 02:50:13,453 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:50:13,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 300 states and 431 transitions. [2019-01-14 02:50:13,455 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2019-01-14 02:50:13,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:13,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:13,456 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:13,456 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:13,456 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 [2019-01-14 02:50:13,457 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 [2019-01-14 02:50:13,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 1 times [2019-01-14 02:50:13,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:13,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:13,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 5 times [2019-01-14 02:50:13,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:13,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:13,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:13,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:13,498 INFO L82 PathProgramCache]: Analyzing trace with hash -833715526, now seen corresponding path program 1 times [2019-01-14 02:50:13,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:13,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:13,860 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 02:50:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:13,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:13,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 02:50:14,080 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-01-14 02:50:14,117 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:14,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:14,118 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:14,118 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:14,118 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:14,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:14,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:14,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:14,119 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2019-01-14 02:50:14,119 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:14,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:14,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:14,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:14,480 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:14,481 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:14,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:14,491 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:14,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:14,541 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:16,377 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:16,379 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:16,380 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:16,380 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:16,380 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:16,380 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:16,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:16,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:16,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:16,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration6_Loop [2019-01-14 02:50:16,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:16,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:16,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:16,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:16,522 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-14 02:50:16,760 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 02:50:16,762 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:16,767 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:16,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:16,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:16,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:16,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:16,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,792 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:50:16,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,796 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:16,799 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:16,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,803 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:16,807 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:16,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,813 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:50:16,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:16,820 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:16,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:16,829 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:16,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,836 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:50:16,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,838 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:16,842 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:16,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:16,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,848 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:16,852 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:16,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,860 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:50:16,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,861 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:16,861 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:16,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,865 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:16,868 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:16,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:16,874 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:16,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,874 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:16,879 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:16,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,894 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:50:16,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:16,895 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:16,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,898 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:16,904 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:16,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,911 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:16,912 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:16,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,914 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:16,919 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:16,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,939 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:50:16,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,940 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:16,940 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:16,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,941 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:16,952 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:16,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,957 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:16,957 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:16,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,960 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:16,968 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:16,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:16,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:16,985 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:50:16,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:16,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:16,987 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:16,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:16,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:16,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:16,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:16,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:16,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:17,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,002 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:17,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,005 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:17,008 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:17,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,019 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:50:17,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:17,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,020 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:17,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,020 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:17,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:17,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:17,046 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:17,046 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:17,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:17,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:17,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:17,046 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:17,051 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:17,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:17,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:17,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:50:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:50:17,072 INFO L87 Difference]: Start difference. First operand 300 states and 431 transitions. cyclomatic complexity: 139 Second operand 6 states. [2019-01-14 02:50:17,376 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-01-14 02:50:17,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:17,995 INFO L93 Difference]: Finished difference Result 612 states and 882 transitions. [2019-01-14 02:50:17,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:50:17,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 612 states and 882 transitions. [2019-01-14 02:50:18,005 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 325 [2019-01-14 02:50:18,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 612 states to 612 states and 882 transitions. [2019-01-14 02:50:18,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 612 [2019-01-14 02:50:18,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 612 [2019-01-14 02:50:18,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 612 states and 882 transitions. [2019-01-14 02:50:18,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:18,012 INFO L706 BuchiCegarLoop]: Abstraction has 612 states and 882 transitions. [2019-01-14 02:50:18,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states and 882 transitions. [2019-01-14 02:50:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 380. [2019-01-14 02:50:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-14 02:50:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 520 transitions. [2019-01-14 02:50:18,026 INFO L729 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2019-01-14 02:50:18,026 INFO L609 BuchiCegarLoop]: Abstraction has 380 states and 520 transitions. [2019-01-14 02:50:18,026 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:50:18,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 380 states and 520 transitions. [2019-01-14 02:50:18,031 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 193 [2019-01-14 02:50:18,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:18,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:18,032 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:18,032 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:18,032 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 [2019-01-14 02:50:18,032 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 [2019-01-14 02:50:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash -438599534, now seen corresponding path program 1 times [2019-01-14 02:50:18,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:18,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:18,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:18,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:18,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:18,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:50:18,177 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:50:18,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:18,178 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 6 times [2019-01-14 02:50:18,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:18,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:18,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:18,311 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:18,311 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:18,311 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:18,311 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:18,312 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:18,312 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:18,312 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:18,312 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:18,312 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2019-01-14 02:50:18,312 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:18,313 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:18,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:18,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:18,457 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-14 02:50:18,648 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:18,648 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:18,654 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:18,655 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:18,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:18,709 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:30,740 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:50:30,742 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:30,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:30,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:30,743 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:30,743 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:30,743 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:30,743 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:30,743 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:30,743 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration7_Loop [2019-01-14 02:50:30,743 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:30,744 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:30,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:30,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:30,903 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-14 02:50:31,013 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-14 02:50:31,129 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:31,130 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:31,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:31,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:31,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:31,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:31,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,153 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:50:31,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,163 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:31,164 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:31,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:31,173 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:31,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,179 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:50:31,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,181 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:31,182 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:31,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,192 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:31,193 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:31,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,202 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:50:31,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,209 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:31,210 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:31,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:31,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,225 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:31,229 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:31,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,234 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:50:31,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,235 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,235 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:31,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,236 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:31,244 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:31,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:31,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,260 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:31,264 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:31,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,276 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:50:31,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,277 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,282 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:31,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:31,288 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:31,288 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,323 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:31,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,324 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:31,326 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:31,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,331 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:50:31,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,333 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:31,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,333 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:31,336 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:31,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,353 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:31,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,354 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:31,364 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:31,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,368 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:50:31,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:31,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,374 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:31,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:31,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,392 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:31,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:31,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:31,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,410 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:50:31,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 [2019-01-14 02:50:31,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:31,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,417 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:31,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:31,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:31,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:31,448 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:31,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:31,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:31,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:31,449 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:31,456 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:31,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:31,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:31,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:31,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:31,470 INFO L87 Difference]: Start difference. First operand 380 states and 520 transitions. cyclomatic complexity: 148 Second operand 3 states. [2019-01-14 02:50:31,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:31,498 INFO L93 Difference]: Finished difference Result 295 states and 401 transitions. [2019-01-14 02:50:31,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:31,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 401 transitions. [2019-01-14 02:50:31,503 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2019-01-14 02:50:31,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 295 states and 401 transitions. [2019-01-14 02:50:31,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 295 [2019-01-14 02:50:31,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 295 [2019-01-14 02:50:31,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 401 transitions. [2019-01-14 02:50:31,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:31,507 INFO L706 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2019-01-14 02:50:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 401 transitions. [2019-01-14 02:50:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2019-01-14 02:50:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-01-14 02:50:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 401 transitions. [2019-01-14 02:50:31,515 INFO L729 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2019-01-14 02:50:31,515 INFO L609 BuchiCegarLoop]: Abstraction has 295 states and 401 transitions. [2019-01-14 02:50:31,515 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:50:31,515 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 295 states and 401 transitions. [2019-01-14 02:50:31,519 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 163 [2019-01-14 02:50:31,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:31,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:31,521 INFO L867 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] [2019-01-14 02:50:31,521 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:31,521 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 [2019-01-14 02:50:31,521 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 [2019-01-14 02:50:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 1 times [2019-01-14 02:50:31,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:31,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:31,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:31,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:31,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:31,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1235554401, now seen corresponding path program 1 times [2019-01-14 02:50:31,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:31,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:31,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:31,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:31,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash 350902213, now seen corresponding path program 1 times [2019-01-14 02:50:31,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:31,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:31,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:31,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:31,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:31,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:31,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:31,808 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:31,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:31,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:31,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:31,809 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:31,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:31,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:31,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:31,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-14 02:50:31,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:31,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:31,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:31,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:32,314 WARN L181 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-01-14 02:50:32,472 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-14 02:50:32,646 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-14 02:50:32,648 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:32,648 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:32,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:32,652 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:32,689 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:32,689 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:33,863 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:33,865 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:33,865 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:33,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:33,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:33,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:33,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:33,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:33,866 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:33,866 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-14 02:50:33,866 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:33,866 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:33,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:33,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:34,171 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-14 02:50:34,283 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:34,284 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:34,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 [2019-01-14 02:50:34,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:34,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:34,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:34,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:34,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,294 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:50:34,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,295 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:34,296 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:34,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,301 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:34,302 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:34,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,304 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:50:34,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,305 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:34,306 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:34,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:34,314 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:34,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,316 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:50:34,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,317 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:34,318 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:34,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:34,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,326 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:34,327 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:34,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,329 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:50:34,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,330 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,330 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:34,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,331 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:34,332 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:34,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,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 [2019-01-14 02:50:34,341 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,341 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:34,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:34,343 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:34,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,346 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:50:34,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,347 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:34,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,348 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:34,349 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:34,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,380 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:34,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:34,386 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:34,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,393 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:50:34,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,394 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:34,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,394 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:34,402 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:34,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,423 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,423 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:34,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,424 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:34,434 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:34,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,437 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:50:34,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,438 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:34,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:34,444 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:34,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,459 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,460 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,460 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:34,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,469 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:34,470 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:34,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,486 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:50:34,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 [2019-01-14 02:50:34,487 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,487 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:34,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,488 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:34,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:34,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:34,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:34,523 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:34,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:34,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:34,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:34,526 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:34,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:34,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:34,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:50:34,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:50:34,549 INFO L87 Difference]: Start difference. First operand 295 states and 401 transitions. cyclomatic complexity: 113 Second operand 4 states. [2019-01-14 02:50:35,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:35,505 INFO L93 Difference]: Finished difference Result 404 states and 572 transitions. [2019-01-14 02:50:35,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:50:35,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 572 transitions. [2019-01-14 02:50:35,513 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 283 [2019-01-14 02:50:35,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 402 states and 570 transitions. [2019-01-14 02:50:35,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 402 [2019-01-14 02:50:35,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 402 [2019-01-14 02:50:35,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 402 states and 570 transitions. [2019-01-14 02:50:35,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:35,520 INFO L706 BuchiCegarLoop]: Abstraction has 402 states and 570 transitions. [2019-01-14 02:50:35,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states and 570 transitions. [2019-01-14 02:50:35,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 364. [2019-01-14 02:50:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2019-01-14 02:50:35,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 507 transitions. [2019-01-14 02:50:35,530 INFO L729 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2019-01-14 02:50:35,530 INFO L609 BuchiCegarLoop]: Abstraction has 364 states and 507 transitions. [2019-01-14 02:50:35,531 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:50:35,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 364 states and 507 transitions. [2019-01-14 02:50:35,534 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 245 [2019-01-14 02:50:35,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:35,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:35,537 INFO L867 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] [2019-01-14 02:50:35,538 INFO L868 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] [2019-01-14 02:50:35,538 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 [2019-01-14 02:50:35,541 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 [2019-01-14 02:50:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 2 times [2019-01-14 02:50:35,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:35,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:35,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:35,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:35,587 INFO L82 PathProgramCache]: Analyzing trace with hash -929180227, now seen corresponding path program 1 times [2019-01-14 02:50:35,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:35,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:35,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:35,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 02:50:35,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:35,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:50:35,652 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:35,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:35,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:35,656 INFO L87 Difference]: Start difference. First operand 364 states and 507 transitions. cyclomatic complexity: 150 Second operand 3 states. [2019-01-14 02:50:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:35,881 INFO L93 Difference]: Finished difference Result 454 states and 625 transitions. [2019-01-14 02:50:35,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:35,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 454 states and 625 transitions. [2019-01-14 02:50:35,887 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 329 [2019-01-14 02:50:35,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 454 states to 454 states and 625 transitions. [2019-01-14 02:50:35,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 454 [2019-01-14 02:50:35,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 454 [2019-01-14 02:50:35,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 454 states and 625 transitions. [2019-01-14 02:50:35,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:35,893 INFO L706 BuchiCegarLoop]: Abstraction has 454 states and 625 transitions. [2019-01-14 02:50:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states and 625 transitions. [2019-01-14 02:50:35,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 407. [2019-01-14 02:50:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-14 02:50:35,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 565 transitions. [2019-01-14 02:50:35,903 INFO L729 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2019-01-14 02:50:35,903 INFO L609 BuchiCegarLoop]: Abstraction has 407 states and 565 transitions. [2019-01-14 02:50:35,903 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:50:35,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 407 states and 565 transitions. [2019-01-14 02:50:35,908 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 285 [2019-01-14 02:50:35,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:35,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:35,909 INFO L867 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] [2019-01-14 02:50:35,910 INFO L868 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] [2019-01-14 02:50:35,912 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 [2019-01-14 02:50:35,912 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 [2019-01-14 02:50:35,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:35,912 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 3 times [2019-01-14 02:50:35,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:35,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:35,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:35,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:35,943 INFO L82 PathProgramCache]: Analyzing trace with hash 440290813, now seen corresponding path program 1 times [2019-01-14 02:50:35,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:35,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:35,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:36,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:36,065 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:36,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:36,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:36,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:36,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:36,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 6 [2019-01-14 02:50:36,278 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:36,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:50:36,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:50:36,278 INFO L87 Difference]: Start difference. First operand 407 states and 565 transitions. cyclomatic complexity: 164 Second operand 6 states. [2019-01-14 02:50:37,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:37,264 INFO L93 Difference]: Finished difference Result 482 states and 628 transitions. [2019-01-14 02:50:37,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:50:37,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 628 transitions. [2019-01-14 02:50:37,269 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 341 [2019-01-14 02:50:37,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 476 states and 619 transitions. [2019-01-14 02:50:37,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 476 [2019-01-14 02:50:37,272 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 476 [2019-01-14 02:50:37,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 476 states and 619 transitions. [2019-01-14 02:50:37,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:37,273 INFO L706 BuchiCegarLoop]: Abstraction has 476 states and 619 transitions. [2019-01-14 02:50:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states and 619 transitions. [2019-01-14 02:50:37,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 372. [2019-01-14 02:50:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-14 02:50:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 477 transitions. [2019-01-14 02:50:37,285 INFO L729 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2019-01-14 02:50:37,285 INFO L609 BuchiCegarLoop]: Abstraction has 372 states and 477 transitions. [2019-01-14 02:50:37,285 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:50:37,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 477 transitions. [2019-01-14 02:50:37,290 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 241 [2019-01-14 02:50:37,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:37,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:37,294 INFO L867 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] [2019-01-14 02:50:37,294 INFO L868 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] [2019-01-14 02:50:37,294 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 [2019-01-14 02:50:37,295 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 [2019-01-14 02:50:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:37,295 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 4 times [2019-01-14 02:50:37,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:37,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:37,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:37,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:37,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:37,346 INFO L82 PathProgramCache]: Analyzing trace with hash 293037747, now seen corresponding path program 1 times [2019-01-14 02:50:37,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:37,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:37,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:37,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 02:50:37,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:37,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:50:37,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:37,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:37,422 INFO L87 Difference]: Start difference. First operand 372 states and 477 transitions. cyclomatic complexity: 111 Second operand 3 states. [2019-01-14 02:50:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:37,928 INFO L93 Difference]: Finished difference Result 422 states and 539 transitions. [2019-01-14 02:50:37,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:37,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 422 states and 539 transitions. [2019-01-14 02:50:37,933 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 289 [2019-01-14 02:50:37,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 422 states to 422 states and 539 transitions. [2019-01-14 02:50:37,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 422 [2019-01-14 02:50:37,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 422 [2019-01-14 02:50:37,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 422 states and 539 transitions. [2019-01-14 02:50:37,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:37,937 INFO L706 BuchiCegarLoop]: Abstraction has 422 states and 539 transitions. [2019-01-14 02:50:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states and 539 transitions. [2019-01-14 02:50:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 375. [2019-01-14 02:50:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-01-14 02:50:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 483 transitions. [2019-01-14 02:50:37,945 INFO L729 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2019-01-14 02:50:37,946 INFO L609 BuchiCegarLoop]: Abstraction has 375 states and 483 transitions. [2019-01-14 02:50:37,946 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:50:37,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 375 states and 483 transitions. [2019-01-14 02:50:37,948 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 247 [2019-01-14 02:50:37,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:37,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:37,949 INFO L867 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] [2019-01-14 02:50:37,951 INFO L868 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] [2019-01-14 02:50:37,951 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 [2019-01-14 02:50:37,951 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 [2019-01-14 02:50:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 5 times [2019-01-14 02:50:37,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:37,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:37,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:37,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:37,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:37,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1585928527, now seen corresponding path program 1 times [2019-01-14 02:50:37,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:37,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:37,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:37,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 02:50:38,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:38,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:50:38,048 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:38,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:50:38,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:50:38,048 INFO L87 Difference]: Start difference. First operand 375 states and 483 transitions. cyclomatic complexity: 113 Second operand 3 states. [2019-01-14 02:50:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:38,299 INFO L93 Difference]: Finished difference Result 419 states and 534 transitions. [2019-01-14 02:50:38,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:50:38,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 534 transitions. [2019-01-14 02:50:38,304 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 289 [2019-01-14 02:50:38,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 534 transitions. [2019-01-14 02:50:38,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2019-01-14 02:50:38,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2019-01-14 02:50:38,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 534 transitions. [2019-01-14 02:50:38,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:38,309 INFO L706 BuchiCegarLoop]: Abstraction has 419 states and 534 transitions. [2019-01-14 02:50:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 534 transitions. [2019-01-14 02:50:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 398. [2019-01-14 02:50:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-01-14 02:50:38,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 511 transitions. [2019-01-14 02:50:38,320 INFO L729 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2019-01-14 02:50:38,320 INFO L609 BuchiCegarLoop]: Abstraction has 398 states and 511 transitions. [2019-01-14 02:50:38,322 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:50:38,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 398 states and 511 transitions. [2019-01-14 02:50:38,325 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 268 [2019-01-14 02:50:38,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:38,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:38,326 INFO L867 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] [2019-01-14 02:50:38,326 INFO L868 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] [2019-01-14 02:50:38,327 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 [2019-01-14 02:50:38,327 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 [2019-01-14 02:50:38,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:38,327 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 6 times [2019-01-14 02:50:38,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:38,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:38,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:38,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:38,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:38,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash 278948913, now seen corresponding path program 1 times [2019-01-14 02:50:38,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:38,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:38,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:38,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:38,596 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:38,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:38,596 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:38,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:38,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:38,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:38,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:50:38,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-14 02:50:38,700 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:38,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:50:38,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:50:38,701 INFO L87 Difference]: Start difference. First operand 398 states and 511 transitions. cyclomatic complexity: 118 Second operand 7 states. [2019-01-14 02:50:39,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:39,980 INFO L93 Difference]: Finished difference Result 1137 states and 1501 transitions. [2019-01-14 02:50:39,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 02:50:39,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1501 transitions. [2019-01-14 02:50:39,988 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 988 [2019-01-14 02:50:39,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 1137 states and 1501 transitions. [2019-01-14 02:50:39,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1137 [2019-01-14 02:50:39,997 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1137 [2019-01-14 02:50:39,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1137 states and 1501 transitions. [2019-01-14 02:50:39,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:40,000 INFO L706 BuchiCegarLoop]: Abstraction has 1137 states and 1501 transitions. [2019-01-14 02:50:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states and 1501 transitions. [2019-01-14 02:50:40,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 516. [2019-01-14 02:50:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-01-14 02:50:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 669 transitions. [2019-01-14 02:50:40,014 INFO L729 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2019-01-14 02:50:40,015 INFO L609 BuchiCegarLoop]: Abstraction has 516 states and 669 transitions. [2019-01-14 02:50:40,015 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 02:50:40,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 669 transitions. [2019-01-14 02:50:40,017 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 386 [2019-01-14 02:50:40,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:40,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:40,018 INFO L867 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] [2019-01-14 02:50:40,018 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:40,018 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 [2019-01-14 02:50:40,019 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 [2019-01-14 02:50:40,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:40,019 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 7 times [2019-01-14 02:50:40,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:40,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:40,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:40,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:40,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash -459730205, now seen corresponding path program 1 times [2019-01-14 02:50:40,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:40,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1126726409, now seen corresponding path program 1 times [2019-01-14 02:50:40,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:40,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:40,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:40,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:40,424 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-14 02:50:40,823 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-14 02:50:40,878 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:40,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:40,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:40,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:40,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 02:50:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:50:41,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 8 [2019-01-14 02:50:41,623 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-14 02:50:41,644 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:41,645 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:41,645 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:41,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:41,645 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:50:41,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:41,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:41,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:41,646 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2019-01-14 02:50:41,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:41,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:41,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:41,787 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 02:50:41,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:42,108 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-14 02:50:42,232 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:42,233 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:42,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:50:42,239 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:42,276 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:50:42,277 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:50:43,043 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:50:43,045 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:50:43,045 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:50:43,046 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:50:43,046 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:50:43,046 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:50:43,046 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:50:43,046 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:50:43,046 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:50:43,046 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration14_Loop [2019-01-14 02:50:43,046 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:50:43,046 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:50:43,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:43,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:50:43,336 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-14 02:50:43,466 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:50:43,467 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:50:43,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:43,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:43,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:50:43,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:50:43,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,476 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:50:43,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:43,478 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:43,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,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 [2019-01-14 02:50:43,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:43,483 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:43,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,487 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:50:43,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,489 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:43,490 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:43,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,496 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:43,497 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:43,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,499 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:50:43,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,501 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:43,502 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:43,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:50:43,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,508 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:43,510 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:43,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,512 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:50:43,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 [2019-01-14 02:50:43,513 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,513 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:43,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,513 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:43,514 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:43,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,524 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,525 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:43,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,525 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,525 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:50:43,527 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:50:43,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,530 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:50:43,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,530 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,531 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:43,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:43,533 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:43,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,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 [2019-01-14 02:50:43,550 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,550 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:50:43,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,551 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:43,554 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:43,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,559 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:50:43,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,560 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:43,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,560 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:43,564 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:43,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,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 [2019-01-14 02:50:43,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,578 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:43,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,579 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:50:43,584 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:50:43,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,586 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:50:43,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,587 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:43,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,588 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:43,589 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:43,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,598 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:50:43,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,599 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:50:43,600 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:50:43,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,608 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:50:43,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 [2019-01-14 02:50:43,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:43,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,609 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:43,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:43,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:50:43,650 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:50:43,650 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:50:43,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:50:43,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:50:43,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:50:43,650 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:50:43,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:50:43,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:50:43,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:50:43,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:50:43,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:50:43,674 INFO L87 Difference]: Start difference. First operand 516 states and 669 transitions. cyclomatic complexity: 159 Second operand 8 states. [2019-01-14 02:50:44,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:44,286 INFO L93 Difference]: Finished difference Result 656 states and 821 transitions. [2019-01-14 02:50:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:50:44,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 821 transitions. [2019-01-14 02:50:44,294 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 514 [2019-01-14 02:50:44,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 647 states and 808 transitions. [2019-01-14 02:50:44,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 647 [2019-01-14 02:50:44,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 647 [2019-01-14 02:50:44,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 647 states and 808 transitions. [2019-01-14 02:50:44,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:44,304 INFO L706 BuchiCegarLoop]: Abstraction has 647 states and 808 transitions. [2019-01-14 02:50:44,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states and 808 transitions. [2019-01-14 02:50:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 574. [2019-01-14 02:50:44,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-01-14 02:50:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 729 transitions. [2019-01-14 02:50:44,320 INFO L729 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2019-01-14 02:50:44,320 INFO L609 BuchiCegarLoop]: Abstraction has 574 states and 729 transitions. [2019-01-14 02:50:44,321 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 02:50:44,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 574 states and 729 transitions. [2019-01-14 02:50:44,326 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 447 [2019-01-14 02:50:44,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:44,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:44,327 INFO L867 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] [2019-01-14 02:50:44,327 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:44,327 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 [2019-01-14 02:50:44,327 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 [2019-01-14 02:50:44,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:44,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 1 times [2019-01-14 02:50:44,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:44,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1434173717, now seen corresponding path program 1 times [2019-01-14 02:50:44,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:44,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:44,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:44,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:50:44,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:50:44,495 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:44,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:50:44,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:50:44,496 INFO L87 Difference]: Start difference. First operand 574 states and 729 transitions. cyclomatic complexity: 163 Second operand 5 states. [2019-01-14 02:50:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:50:44,683 INFO L93 Difference]: Finished difference Result 896 states and 1144 transitions. [2019-01-14 02:50:44,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:50:44,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 896 states and 1144 transitions. [2019-01-14 02:50:44,690 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 763 [2019-01-14 02:50:44,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 896 states to 896 states and 1144 transitions. [2019-01-14 02:50:44,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2019-01-14 02:50:44,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 896 [2019-01-14 02:50:44,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 896 states and 1144 transitions. [2019-01-14 02:50:44,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:50:44,698 INFO L706 BuchiCegarLoop]: Abstraction has 896 states and 1144 transitions. [2019-01-14 02:50:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states and 1144 transitions. [2019-01-14 02:50:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 644. [2019-01-14 02:50:44,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-01-14 02:50:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 817 transitions. [2019-01-14 02:50:44,711 INFO L729 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2019-01-14 02:50:44,711 INFO L609 BuchiCegarLoop]: Abstraction has 644 states and 817 transitions. [2019-01-14 02:50:44,711 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-14 02:50:44,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 644 states and 817 transitions. [2019-01-14 02:50:44,714 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 523 [2019-01-14 02:50:44,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:50:44,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:50:44,715 INFO L867 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] [2019-01-14 02:50:44,715 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:50:44,715 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 [2019-01-14 02:50:44,715 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 [2019-01-14 02:50:44,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:44,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 2 times [2019-01-14 02:50:44,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:44,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:44,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:44,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:50:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:50:44,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1615640065, now seen corresponding path program 1 times [2019-01-14 02:50:44,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:50:44,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:50:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:50:44,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:50:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:45,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:50:45,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:50:45,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:50:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:50:45,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:50:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:50:45,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:50:45,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2019-01-14 02:50:45,976 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:50:45,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:50:45,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=104, Unknown=1, NotChecked=0, Total=132 [2019-01-14 02:50:45,977 INFO L87 Difference]: Start difference. First operand 644 states and 817 transitions. cyclomatic complexity: 181 Second operand 12 states. [2019-01-14 02:50:47,768 WARN L181 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-14 02:50:48,556 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-14 02:50:51,381 WARN L181 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-14 02:50:54,234 WARN L181 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-01-14 02:50:56,122 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2019-01-14 02:50:57,001 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-01-14 02:51:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:17,435 INFO L93 Difference]: Finished difference Result 1620 states and 1999 transitions. [2019-01-14 02:51:17,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-14 02:51:17,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1620 states and 1999 transitions. [2019-01-14 02:51:17,444 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1446 [2019-01-14 02:51:17,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1620 states to 1585 states and 1936 transitions. [2019-01-14 02:51:17,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1585 [2019-01-14 02:51:17,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1585 [2019-01-14 02:51:17,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1585 states and 1936 transitions. [2019-01-14 02:51:17,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:17,458 INFO L706 BuchiCegarLoop]: Abstraction has 1585 states and 1936 transitions. [2019-01-14 02:51:17,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states and 1936 transitions. [2019-01-14 02:51:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1070. [2019-01-14 02:51:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2019-01-14 02:51:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1345 transitions. [2019-01-14 02:51:17,484 INFO L729 BuchiCegarLoop]: Abstraction has 1070 states and 1345 transitions. [2019-01-14 02:51:17,484 INFO L609 BuchiCegarLoop]: Abstraction has 1070 states and 1345 transitions. [2019-01-14 02:51:17,484 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-14 02:51:17,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1070 states and 1345 transitions. [2019-01-14 02:51:17,491 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 987 [2019-01-14 02:51:17,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:17,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:17,492 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:17,492 INFO L868 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] [2019-01-14 02:51:17,492 INFO L794 eck$LassoCheckResult]: Stem: 14871#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 14841#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14843#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14869#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 14838#L40-1 mp_add_~nb~0 := 4; 14839#L50 assume !(0 == mp_add_~b3~0 % 256); 14865#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14866#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15526#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14849#L65 [2019-01-14 02:51:17,492 INFO L796 eck$LassoCheckResult]: Loop: 14849#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14850#L65-2 assume !(1 == mp_add_~i~0 % 256); 15798#L66-1 assume !(2 == mp_add_~i~0 % 256); 15797#L67-1 assume !(3 == mp_add_~i~0 % 256); 15796#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15795#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15794#L71-2 assume !(1 == mp_add_~i~0 % 256); 15793#L72-1 assume !(2 == mp_add_~i~0 % 256); 15792#L73-1 assume !(3 == mp_add_~i~0 % 256); 15791#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15790#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15789#L80-1 assume !(1 == mp_add_~i~0 % 256); 15788#L81-1 assume !(2 == mp_add_~i~0 % 256); 15787#L82-1 assume !(3 == mp_add_~i~0 % 256); 15786#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15785#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15784#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15783#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15782#L71 assume !(0 == mp_add_~i~0 % 256); 15774#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 15685#L72-1 assume !(2 == mp_add_~i~0 % 256); 15773#L73-1 assume !(3 == mp_add_~i~0 % 256); 15772#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15771#L76-1 assume !(0 == mp_add_~i~0 % 256); 15758#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15741#L81-1 assume !(2 == mp_add_~i~0 % 256); 15740#L82-1 assume !(3 == mp_add_~i~0 % 256); 15739#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14907#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14908#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15299#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15716#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15715#L76-1 assume !(0 == mp_add_~i~0 % 256); 15714#L80-1 assume !(1 == mp_add_~i~0 % 256); 15284#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15283#L82-1 assume !(3 == mp_add_~i~0 % 256); 14910#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14911#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15711#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15709#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15707#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15705#L76-1 assume !(0 == mp_add_~i~0 % 256); 15702#L80-1 assume !(1 == mp_add_~i~0 % 256); 15698#L81-1 assume !(2 == mp_add_~i~0 % 256); 15695#L82-1 assume !(3 == mp_add_~i~0 % 256); 15696#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15671#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15672#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14849#L65 [2019-01-14 02:51:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 2 times [2019-01-14 02:51:17,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:17,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:17,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:17,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2024966345, now seen corresponding path program 1 times [2019-01-14 02:51:17,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:17,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:17,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:17,670 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2019-01-14 02:51:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 02:51:17,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:17,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:17,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:17,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 02:51:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:51:17,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-01-14 02:51:17,835 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:17,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:51:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:51:17,836 INFO L87 Difference]: Start difference. First operand 1070 states and 1345 transitions. cyclomatic complexity: 283 Second operand 8 states. [2019-01-14 02:51:18,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:18,048 INFO L93 Difference]: Finished difference Result 1780 states and 2149 transitions. [2019-01-14 02:51:18,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:51:18,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1780 states and 2149 transitions. [2019-01-14 02:51:18,058 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1682 [2019-01-14 02:51:18,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1780 states to 1780 states and 2149 transitions. [2019-01-14 02:51:18,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1780 [2019-01-14 02:51:18,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1780 [2019-01-14 02:51:18,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1780 states and 2149 transitions. [2019-01-14 02:51:18,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:18,071 INFO L706 BuchiCegarLoop]: Abstraction has 1780 states and 2149 transitions. [2019-01-14 02:51:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1780 states and 2149 transitions. [2019-01-14 02:51:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1780 to 1555. [2019-01-14 02:51:18,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-01-14 02:51:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1905 transitions. [2019-01-14 02:51:18,103 INFO L729 BuchiCegarLoop]: Abstraction has 1555 states and 1905 transitions. [2019-01-14 02:51:18,103 INFO L609 BuchiCegarLoop]: Abstraction has 1555 states and 1905 transitions. [2019-01-14 02:51:18,103 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-14 02:51:18,103 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1555 states and 1905 transitions. [2019-01-14 02:51:18,111 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1472 [2019-01-14 02:51:18,112 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:18,112 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:18,112 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:18,112 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:18,113 INFO L794 eck$LassoCheckResult]: Stem: 17879#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 17846#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17848#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17876#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 17842#L40-1 mp_add_~nb~0 := 4; 17843#L50 assume !(0 == mp_add_~b3~0 % 256); 17867#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 17868#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18467#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18468#L65 [2019-01-14 02:51:18,117 INFO L796 eck$LassoCheckResult]: Loop: 18468#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 19212#L65-2 assume !(1 == mp_add_~i~0 % 256); 19210#L66-1 assume !(2 == mp_add_~i~0 % 256); 17856#L67-1 assume !(3 == mp_add_~i~0 % 256); 17857#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19232#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 19231#L71-2 assume !(1 == mp_add_~i~0 % 256); 19230#L72-1 assume !(2 == mp_add_~i~0 % 256); 19229#L73-1 assume !(3 == mp_add_~i~0 % 256); 19228#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 19227#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 19226#L80-1 assume !(1 == mp_add_~i~0 % 256); 19225#L81-1 assume !(2 == mp_add_~i~0 % 256); 19224#L82-1 assume !(3 == mp_add_~i~0 % 256); 19223#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19222#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19221#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19220#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 19203#L71 assume !(0 == mp_add_~i~0 % 256); 19200#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 19038#L72-1 assume !(2 == mp_add_~i~0 % 256); 19197#L73-1 assume !(3 == mp_add_~i~0 % 256); 19193#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19191#L76-1 assume !(0 == mp_add_~i~0 % 256); 19188#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 19189#L81-1 assume !(2 == mp_add_~i~0 % 256); 19219#L82-1 assume !(3 == mp_add_~i~0 % 256); 19218#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19178#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19175#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19176#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19168#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19169#L76-1 assume !(0 == mp_add_~i~0 % 256); 19167#L80-1 assume !(1 == mp_add_~i~0 % 256); 19165#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 19161#L82-1 assume !(3 == mp_add_~i~0 % 256); 19128#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19129#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19122#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 19123#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 19147#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 19130#L76-1 assume !(0 == mp_add_~i~0 % 256); 19131#L80-1 assume !(1 == mp_add_~i~0 % 256); 19111#L81-1 assume !(2 == mp_add_~i~0 % 256); 19080#L82-1 assume !(3 == mp_add_~i~0 % 256); 19070#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 19097#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 19095#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18468#L65 [2019-01-14 02:51:18,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:18,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 3 times [2019-01-14 02:51:18,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:18,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:18,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:18,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash 310688569, now seen corresponding path program 1 times [2019-01-14 02:51:18,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:18,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:18,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:18,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:18,506 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 02:51:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 02:51:18,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:51:18,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 02:51:18,511 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:18,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:51:18,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:51:18,511 INFO L87 Difference]: Start difference. First operand 1555 states and 1905 transitions. cyclomatic complexity: 358 Second operand 4 states. [2019-01-14 02:51:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:18,672 INFO L93 Difference]: Finished difference Result 1925 states and 2297 transitions. [2019-01-14 02:51:18,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:51:18,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2297 transitions. [2019-01-14 02:51:18,683 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1827 [2019-01-14 02:51:18,691 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1925 states and 2297 transitions. [2019-01-14 02:51:18,691 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1925 [2019-01-14 02:51:18,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1925 [2019-01-14 02:51:18,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1925 states and 2297 transitions. [2019-01-14 02:51:18,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:18,694 INFO L706 BuchiCegarLoop]: Abstraction has 1925 states and 2297 transitions. [2019-01-14 02:51:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states and 2297 transitions. [2019-01-14 02:51:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1624. [2019-01-14 02:51:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1624 states. [2019-01-14 02:51:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 1958 transitions. [2019-01-14 02:51:18,721 INFO L729 BuchiCegarLoop]: Abstraction has 1624 states and 1958 transitions. [2019-01-14 02:51:18,721 INFO L609 BuchiCegarLoop]: Abstraction has 1624 states and 1958 transitions. [2019-01-14 02:51:18,721 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-14 02:51:18,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1624 states and 1958 transitions. [2019-01-14 02:51:18,726 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1541 [2019-01-14 02:51:18,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:18,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:18,726 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:18,727 INFO L868 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] [2019-01-14 02:51:18,727 INFO L794 eck$LassoCheckResult]: Stem: 21364#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 21332#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21334#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21361#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 21367#L40-1 mp_add_~nb~0 := 4; 21357#L50 assume !(0 == mp_add_~b3~0 % 256); 21358#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22576#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22545#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22544#L65 [2019-01-14 02:51:18,727 INFO L796 eck$LassoCheckResult]: Loop: 22544#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22543#L65-2 assume !(1 == mp_add_~i~0 % 256); 22542#L66-1 assume !(2 == mp_add_~i~0 % 256); 22541#L67-1 assume !(3 == mp_add_~i~0 % 256); 22540#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22539#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22538#L71-2 assume !(1 == mp_add_~i~0 % 256); 22537#L72-1 assume !(2 == mp_add_~i~0 % 256); 22536#L73-1 assume !(3 == mp_add_~i~0 % 256); 22535#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22533#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22531#L80-1 assume !(1 == mp_add_~i~0 % 256); 22529#L81-1 assume !(2 == mp_add_~i~0 % 256); 22527#L82-1 assume !(3 == mp_add_~i~0 % 256); 22525#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22523#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22518#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22516#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22514#L71 assume !(0 == mp_add_~i~0 % 256); 22513#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 22380#L72-1 assume !(2 == mp_add_~i~0 % 256); 22512#L73-1 assume !(3 == mp_add_~i~0 % 256); 22511#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22509#L76-1 assume !(0 == mp_add_~i~0 % 256); 22507#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22505#L81-1 assume !(2 == mp_add_~i~0 % 256); 22503#L82-1 assume !(3 == mp_add_~i~0 % 256); 22501#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22498#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22499#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22477#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22475#L71 assume !(0 == mp_add_~i~0 % 256); 22473#L71-2 assume !(1 == mp_add_~i~0 % 256); 22469#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 22468#L73-1 assume !(3 == mp_add_~i~0 % 256); 22466#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22465#L76-1 assume !(0 == mp_add_~i~0 % 256); 22464#L80-1 assume !(1 == mp_add_~i~0 % 256); 22463#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22393#L82-1 assume !(3 == mp_add_~i~0 % 256); 22462#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22461#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22459#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22456#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22453#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22450#L76-1 assume !(0 == mp_add_~i~0 % 256); 22445#L80-1 assume !(1 == mp_add_~i~0 % 256); 22411#L81-1 assume !(2 == mp_add_~i~0 % 256); 22408#L82-1 assume !(3 == mp_add_~i~0 % 256); 22409#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22571#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22572#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22544#L65 [2019-01-14 02:51:18,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:18,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 4 times [2019-01-14 02:51:18,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:18,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:18,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:18,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash 982437249, now seen corresponding path program 1 times [2019-01-14 02:51:18,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:18,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:18,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:18,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:19,005 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 12 [2019-01-14 02:51:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-14 02:51:19,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:19,165 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:19,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:19,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 02:51:19,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:19,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-01-14 02:51:19,293 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:51:19,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:51:19,294 INFO L87 Difference]: Start difference. First operand 1624 states and 1958 transitions. cyclomatic complexity: 342 Second operand 10 states. [2019-01-14 02:51:21,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:21,247 INFO L93 Difference]: Finished difference Result 2110 states and 2374 transitions. [2019-01-14 02:51:21,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 02:51:21,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2110 states and 2374 transitions. [2019-01-14 02:51:21,256 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1482 [2019-01-14 02:51:21,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2110 states to 2036 states and 2293 transitions. [2019-01-14 02:51:21,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2036 [2019-01-14 02:51:21,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2036 [2019-01-14 02:51:21,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2036 states and 2293 transitions. [2019-01-14 02:51:21,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:21,274 INFO L706 BuchiCegarLoop]: Abstraction has 2036 states and 2293 transitions. [2019-01-14 02:51:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states and 2293 transitions. [2019-01-14 02:51:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1155. [2019-01-14 02:51:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2019-01-14 02:51:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1341 transitions. [2019-01-14 02:51:21,298 INFO L729 BuchiCegarLoop]: Abstraction has 1155 states and 1341 transitions. [2019-01-14 02:51:21,298 INFO L609 BuchiCegarLoop]: Abstraction has 1155 states and 1341 transitions. [2019-01-14 02:51:21,298 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-14 02:51:21,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1155 states and 1341 transitions. [2019-01-14 02:51:21,304 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 890 [2019-01-14 02:51:21,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:21,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:21,307 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:21,307 INFO L868 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] [2019-01-14 02:51:21,307 INFO L794 eck$LassoCheckResult]: Stem: 25333#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 25307#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25308#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25331#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 25335#L40-1 mp_add_~nb~0 := 4; 25586#L50 assume !(0 == mp_add_~b3~0 % 256); 25583#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25584#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25580#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25579#L65 [2019-01-14 02:51:21,307 INFO L796 eck$LassoCheckResult]: Loop: 25579#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25578#L65-2 assume !(1 == mp_add_~i~0 % 256); 25577#L66-1 assume !(2 == mp_add_~i~0 % 256); 25576#L67-1 assume !(3 == mp_add_~i~0 % 256); 25575#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25574#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25573#L71-2 assume !(1 == mp_add_~i~0 % 256); 25572#L72-1 assume !(2 == mp_add_~i~0 % 256); 25571#L73-1 assume !(3 == mp_add_~i~0 % 256); 25569#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25568#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 25567#L80-1 assume !(1 == mp_add_~i~0 % 256); 25566#L81-1 assume !(2 == mp_add_~i~0 % 256); 25565#L82-1 assume !(3 == mp_add_~i~0 % 256); 25562#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25560#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25558#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25556#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25554#L71 assume !(0 == mp_add_~i~0 % 256); 25552#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 25550#L72-1 assume !(2 == mp_add_~i~0 % 256); 25548#L73-1 assume !(3 == mp_add_~i~0 % 256); 25544#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25542#L76-1 assume !(0 == mp_add_~i~0 % 256); 25539#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25540#L81-1 assume !(2 == mp_add_~i~0 % 256); 25535#L82-1 assume !(3 == mp_add_~i~0 % 256); 25536#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25531#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25532#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25526#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25527#L71 assume !(0 == mp_add_~i~0 % 256); 25457#L71-2 assume !(1 == mp_add_~i~0 % 256); 25458#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 25453#L73-1 assume !(3 == mp_add_~i~0 % 256); 25454#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25448#L76-1 assume !(0 == mp_add_~i~0 % 256); 25449#L80-1 assume !(1 == mp_add_~i~0 % 256); 25444#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25445#L82-1 assume !(3 == mp_add_~i~0 % 256); 25440#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25441#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25436#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25437#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25522#L71 assume !(0 == mp_add_~i~0 % 256); 25603#L71-2 assume !(1 == mp_add_~i~0 % 256); 25602#L72-1 assume !(2 == mp_add_~i~0 % 256); 25601#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 25600#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25599#L76-1 assume !(0 == mp_add_~i~0 % 256); 25598#L80-1 assume !(1 == mp_add_~i~0 % 256); 25597#L81-1 assume !(2 == mp_add_~i~0 % 256); 25596#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25595#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25594#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25593#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25592#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25591#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25590#L76-1 assume !(0 == mp_add_~i~0 % 256); 25589#L80-1 assume !(1 == mp_add_~i~0 % 256); 25588#L81-1 assume !(2 == mp_add_~i~0 % 256); 25587#L82-1 assume !(3 == mp_add_~i~0 % 256); 25585#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25581#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25582#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25579#L65 [2019-01-14 02:51:21,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:21,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1399199534, now seen corresponding path program 5 times [2019-01-14 02:51:21,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:21,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:21,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:21,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2060926355, now seen corresponding path program 1 times [2019-01-14 02:51:21,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:21,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:21,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:21,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 52 proven. 53 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 02:51:21,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:21,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:21,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:21,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-14 02:51:22,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2019-01-14 02:51:22,079 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 02:51:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-01-14 02:51:22,080 INFO L87 Difference]: Start difference. First operand 1155 states and 1341 transitions. cyclomatic complexity: 193 Second operand 14 states. [2019-01-14 02:51:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:24,065 INFO L93 Difference]: Finished difference Result 2314 states and 2592 transitions. [2019-01-14 02:51:24,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 02:51:24,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2314 states and 2592 transitions. [2019-01-14 02:51:24,074 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 1068 [2019-01-14 02:51:24,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2314 states to 2279 states and 2529 transitions. [2019-01-14 02:51:24,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2279 [2019-01-14 02:51:24,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2279 [2019-01-14 02:51:24,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2279 states and 2529 transitions. [2019-01-14 02:51:24,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:24,089 INFO L706 BuchiCegarLoop]: Abstraction has 2279 states and 2529 transitions. [2019-01-14 02:51:24,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states and 2529 transitions. [2019-01-14 02:51:24,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 1142. [2019-01-14 02:51:24,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2019-01-14 02:51:24,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1333 transitions. [2019-01-14 02:51:24,119 INFO L729 BuchiCegarLoop]: Abstraction has 1142 states and 1333 transitions. [2019-01-14 02:51:24,119 INFO L609 BuchiCegarLoop]: Abstraction has 1142 states and 1333 transitions. [2019-01-14 02:51:24,119 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-14 02:51:24,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1142 states and 1333 transitions. [2019-01-14 02:51:24,125 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 811 [2019-01-14 02:51:24,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:24,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:24,129 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:24,129 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:24,129 INFO L794 eck$LassoCheckResult]: Stem: 29066#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 29043#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 29045#L42 assume !(0 == mp_add_~a2~0 % 256); 29065#L40-1 mp_add_~nb~0 := 4; 29469#L50 assume !(0 == mp_add_~b3~0 % 256); 29466#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29464#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29465#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29459#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29460#L65-2 assume !(1 == mp_add_~i~0 % 256); 29455#L66-1 assume !(2 == mp_add_~i~0 % 256); 29456#L67-1 assume !(3 == mp_add_~i~0 % 256); 29451#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29452#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 29447#L71-2 assume !(1 == mp_add_~i~0 % 256); 29448#L72-1 assume !(2 == mp_add_~i~0 % 256); 29443#L73-1 assume !(3 == mp_add_~i~0 % 256); 29444#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29439#L76-1 [2019-01-14 02:51:24,130 INFO L796 eck$LassoCheckResult]: Loop: 29439#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 29440#L80-1 assume !(1 == mp_add_~i~0 % 256); 29435#L81-1 assume !(2 == mp_add_~i~0 % 256); 29436#L82-1 assume !(3 == mp_add_~i~0 % 256); 29431#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29432#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30109#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29299#L65 assume !(0 == mp_add_~i~0 % 256); 29138#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 29139#L66-1 assume !(2 == mp_add_~i~0 % 256); 29132#L67-1 assume !(3 == mp_add_~i~0 % 256); 29133#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29126#L71 assume !(0 == mp_add_~i~0 % 256); 29127#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 29119#L72-1 assume !(2 == mp_add_~i~0 % 256); 29120#L73-1 assume !(3 == mp_add_~i~0 % 256); 29110#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29111#L76-1 assume !(0 == mp_add_~i~0 % 256); 29341#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 29339#L81-1 assume !(2 == mp_add_~i~0 % 256); 29337#L82-1 assume !(3 == mp_add_~i~0 % 256); 29335#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29333#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29329#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29328#L65 assume !(0 == mp_add_~i~0 % 256); 29326#L65-2 assume !(1 == mp_add_~i~0 % 256); 29325#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 29324#L67-1 assume !(3 == mp_add_~i~0 % 256); 29322#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29319#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29318#L76-1 assume !(0 == mp_add_~i~0 % 256); 29317#L80-1 assume !(1 == mp_add_~i~0 % 256); 29316#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 29311#L82-1 assume !(3 == mp_add_~i~0 % 256); 29315#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29314#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29306#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29301#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29300#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29297#L76-1 assume !(0 == mp_add_~i~0 % 256); 29294#L80-1 assume !(1 == mp_add_~i~0 % 256); 29224#L81-1 assume !(2 == mp_add_~i~0 % 256); 29223#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 29222#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29221#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29220#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29219#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29218#L71 assume !(0 == mp_add_~i~0 % 256); 29217#L71-2 assume !(1 == mp_add_~i~0 % 256); 29216#L72-1 assume !(2 == mp_add_~i~0 % 256); 29215#L73-1 assume !(3 == mp_add_~i~0 % 256); 29214#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29213#L76-1 assume !(0 == mp_add_~i~0 % 256); 29212#L80-1 assume !(1 == mp_add_~i~0 % 256); 29211#L81-1 assume !(2 == mp_add_~i~0 % 256); 29209#L82-1 assume !(3 == mp_add_~i~0 % 256); 29208#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29207#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29205#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 29206#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29198#L71 assume !(0 == mp_add_~i~0 % 256); 29199#L71-2 assume !(1 == mp_add_~i~0 % 256); 29190#L72-1 assume !(2 == mp_add_~i~0 % 256); 29186#L73-1 assume !(3 == mp_add_~i~0 % 256); 29184#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29182#L76-1 assume !(0 == mp_add_~i~0 % 256); 29180#L80-1 assume !(1 == mp_add_~i~0 % 256); 29176#L81-1 assume !(2 == mp_add_~i~0 % 256); 29177#L82-1 assume !(3 == mp_add_~i~0 % 256); 29095#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29096#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29144#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29145#L65 assume !(0 == mp_add_~i~0 % 256); 29161#L65-2 assume !(1 == mp_add_~i~0 % 256); 29159#L66-1 assume !(2 == mp_add_~i~0 % 256); 29160#L67-1 assume !(3 == mp_add_~i~0 % 256); 29204#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29474#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29473#L76-1 assume !(0 == mp_add_~i~0 % 256); 29472#L80-1 assume !(1 == mp_add_~i~0 % 256); 29471#L81-1 assume !(2 == mp_add_~i~0 % 256); 29470#L82-1 assume !(3 == mp_add_~i~0 % 256); 29467#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29468#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29461#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29462#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29457#L65-2 assume !(1 == mp_add_~i~0 % 256); 29458#L66-1 assume !(2 == mp_add_~i~0 % 256); 29453#L67-1 assume !(3 == mp_add_~i~0 % 256); 29454#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 29449#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 29450#L71-2 assume !(1 == mp_add_~i~0 % 256); 29445#L72-1 assume !(2 == mp_add_~i~0 % 256); 29446#L73-1 assume !(3 == mp_add_~i~0 % 256); 29441#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29439#L76-1 [2019-01-14 02:51:24,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:24,130 INFO L82 PathProgramCache]: Analyzing trace with hash 149431148, now seen corresponding path program 1 times [2019-01-14 02:51:24,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:24,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:24,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:24,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:24,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:24,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash 989628977, now seen corresponding path program 1 times [2019-01-14 02:51:24,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:24,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:24,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:24,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:24,628 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-14 02:51:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 181 proven. 7 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-01-14 02:51:24,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:24,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:24,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:24,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 173 proven. 3 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-01-14 02:51:24,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:24,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-01-14 02:51:24,915 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:24,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:51:24,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:51:24,915 INFO L87 Difference]: Start difference. First operand 1142 states and 1333 transitions. cyclomatic complexity: 199 Second operand 8 states. [2019-01-14 02:51:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:25,432 INFO L93 Difference]: Finished difference Result 1313 states and 1500 transitions. [2019-01-14 02:51:25,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:51:25,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1313 states and 1500 transitions. [2019-01-14 02:51:25,438 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 673 [2019-01-14 02:51:25,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1313 states to 1303 states and 1490 transitions. [2019-01-14 02:51:25,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1303 [2019-01-14 02:51:25,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1303 [2019-01-14 02:51:25,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1303 states and 1490 transitions. [2019-01-14 02:51:25,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:25,445 INFO L706 BuchiCegarLoop]: Abstraction has 1303 states and 1490 transitions. [2019-01-14 02:51:25,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states and 1490 transitions. [2019-01-14 02:51:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1046. [2019-01-14 02:51:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-01-14 02:51:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1220 transitions. [2019-01-14 02:51:25,462 INFO L729 BuchiCegarLoop]: Abstraction has 1046 states and 1220 transitions. [2019-01-14 02:51:25,462 INFO L609 BuchiCegarLoop]: Abstraction has 1046 states and 1220 transitions. [2019-01-14 02:51:25,462 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-14 02:51:25,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1046 states and 1220 transitions. [2019-01-14 02:51:25,469 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 586 [2019-01-14 02:51:25,470 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:25,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:25,471 INFO L867 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] [2019-01-14 02:51:25,471 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:25,472 INFO L794 eck$LassoCheckResult]: Stem: 31828#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 31800#L40 assume !(0 == mp_add_~a3~0 % 256); 31801#L40-1 mp_add_~nb~0 := 4; 31822#L50 assume !(0 == mp_add_~b3~0 % 256); 31823#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 32425#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32426#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32421#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32419#L65-2 assume !(1 == mp_add_~i~0 % 256); 32420#L66-1 assume !(2 == mp_add_~i~0 % 256); 32415#L67-1 assume !(3 == mp_add_~i~0 % 256); 32416#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32411#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32412#L71-2 assume !(1 == mp_add_~i~0 % 256); 32407#L72-1 assume !(2 == mp_add_~i~0 % 256); 32408#L73-1 assume !(3 == mp_add_~i~0 % 256); 32403#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32404#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32796#L80-1 assume !(1 == mp_add_~i~0 % 256); 32328#L81-1 assume !(2 == mp_add_~i~0 % 256); 32329#L82-1 assume !(3 == mp_add_~i~0 % 256); 32320#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32321#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32281#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32278#L65 [2019-01-14 02:51:25,474 INFO L796 eck$LassoCheckResult]: Loop: 32278#L65 assume !(0 == mp_add_~i~0 % 256); 32277#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 32232#L66-1 assume !(2 == mp_add_~i~0 % 256); 32276#L67-1 assume !(3 == mp_add_~i~0 % 256); 32275#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32274#L71 assume !(0 == mp_add_~i~0 % 256); 32273#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 32272#L72-1 assume !(2 == mp_add_~i~0 % 256); 32271#L73-1 assume !(3 == mp_add_~i~0 % 256); 32269#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32265#L76-1 assume !(0 == mp_add_~i~0 % 256); 32266#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 32301#L81-1 assume !(2 == mp_add_~i~0 % 256); 32302#L82-1 assume !(3 == mp_add_~i~0 % 256); 32297#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32298#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32238#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32239#L65 assume !(0 == mp_add_~i~0 % 256); 32230#L65-2 assume !(1 == mp_add_~i~0 % 256); 32226#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 32227#L67-1 assume !(3 == mp_add_~i~0 % 256); 32466#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32465#L71 assume !(0 == mp_add_~i~0 % 256); 32464#L71-2 assume !(1 == mp_add_~i~0 % 256); 32463#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 32462#L73-1 assume !(3 == mp_add_~i~0 % 256); 32460#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32393#L76-1 assume !(0 == mp_add_~i~0 % 256); 32391#L80-1 assume !(1 == mp_add_~i~0 % 256); 32392#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 32368#L82-1 assume !(3 == mp_add_~i~0 % 256); 32387#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32379#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32380#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32451#L65 assume !(0 == mp_add_~i~0 % 256); 32450#L65-2 assume !(1 == mp_add_~i~0 % 256); 32449#L66-1 assume !(2 == mp_add_~i~0 % 256); 32229#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 32334#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32448#L71 assume !(0 == mp_add_~i~0 % 256); 32447#L71-2 assume !(1 == mp_add_~i~0 % 256); 32446#L72-1 assume !(2 == mp_add_~i~0 % 256); 32445#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 32443#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32442#L76-1 assume !(0 == mp_add_~i~0 % 256); 32441#L80-1 assume !(1 == mp_add_~i~0 % 256); 32440#L81-1 assume !(2 == mp_add_~i~0 % 256); 32439#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 32438#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32437#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32436#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 32434#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32433#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32432#L76-1 assume !(0 == mp_add_~i~0 % 256); 32431#L80-1 assume !(1 == mp_add_~i~0 % 256); 32430#L81-1 assume !(2 == mp_add_~i~0 % 256); 32429#L82-1 assume !(3 == mp_add_~i~0 % 256); 32427#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32428#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32422#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32423#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32476#L65-2 assume !(1 == mp_add_~i~0 % 256); 32417#L66-1 assume !(2 == mp_add_~i~0 % 256); 32418#L67-1 assume !(3 == mp_add_~i~0 % 256); 32413#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32414#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32409#L71-2 assume !(1 == mp_add_~i~0 % 256); 32410#L72-1 assume !(2 == mp_add_~i~0 % 256); 32405#L73-1 assume !(3 == mp_add_~i~0 % 256); 32406#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32772#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32770#L80-1 assume !(1 == mp_add_~i~0 % 256); 32768#L81-1 assume !(2 == mp_add_~i~0 % 256); 32766#L82-1 assume !(3 == mp_add_~i~0 % 256); 32764#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32754#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32747#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32278#L65 [2019-01-14 02:51:25,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:25,477 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 8 times [2019-01-14 02:51:25,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:25,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:25,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:25,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:25,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash -872206489, now seen corresponding path program 1 times [2019-01-14 02:51:25,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:25,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:25,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:25,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 02:51:26,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:26,088 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:26,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:26,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 104 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 02:51:26,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:26,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-01-14 02:51:26,525 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:26,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:51:26,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:51:26,526 INFO L87 Difference]: Start difference. First operand 1046 states and 1220 transitions. cyclomatic complexity: 184 Second operand 8 states. [2019-01-14 02:51:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:28,177 INFO L93 Difference]: Finished difference Result 1367 states and 1526 transitions. [2019-01-14 02:51:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 02:51:28,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1367 states and 1526 transitions. [2019-01-14 02:51:28,183 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 647 [2019-01-14 02:51:28,188 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1367 states to 1287 states and 1426 transitions. [2019-01-14 02:51:28,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1287 [2019-01-14 02:51:28,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1287 [2019-01-14 02:51:28,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1287 states and 1426 transitions. [2019-01-14 02:51:28,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:28,191 INFO L706 BuchiCegarLoop]: Abstraction has 1287 states and 1426 transitions. [2019-01-14 02:51:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states and 1426 transitions. [2019-01-14 02:51:28,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 870. [2019-01-14 02:51:28,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2019-01-14 02:51:28,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 971 transitions. [2019-01-14 02:51:28,207 INFO L729 BuchiCegarLoop]: Abstraction has 870 states and 971 transitions. [2019-01-14 02:51:28,207 INFO L609 BuchiCegarLoop]: Abstraction has 870 states and 971 transitions. [2019-01-14 02:51:28,207 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-14 02:51:28,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 870 states and 971 transitions. [2019-01-14 02:51:28,214 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 479 [2019-01-14 02:51:28,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:28,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:28,217 INFO L867 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] [2019-01-14 02:51:28,217 INFO L868 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] [2019-01-14 02:51:28,218 INFO L794 eck$LassoCheckResult]: Stem: 34479#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 34472#L40 assume !(0 == mp_add_~a3~0 % 256); 34473#L40-1 mp_add_~nb~0 := 4; 34470#L50 assume !(0 == mp_add_~b3~0 % 256); 34471#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34539#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34540#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34527#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34528#L65-2 assume !(1 == mp_add_~i~0 % 256); 34523#L66-1 assume !(2 == mp_add_~i~0 % 256); 34524#L67-1 assume !(3 == mp_add_~i~0 % 256); 34519#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34520#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34515#L71-2 assume !(1 == mp_add_~i~0 % 256); 34516#L72-1 assume !(2 == mp_add_~i~0 % 256); 34511#L73-1 assume !(3 == mp_add_~i~0 % 256); 34512#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34940#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 34939#L80-1 assume !(1 == mp_add_~i~0 % 256); 34938#L81-1 assume !(2 == mp_add_~i~0 % 256); 34937#L82-1 assume !(3 == mp_add_~i~0 % 256); 34936#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34935#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34934#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34933#L65 assume !(0 == mp_add_~i~0 % 256); 34486#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 34487#L66-1 [2019-01-14 02:51:28,218 INFO L796 eck$LassoCheckResult]: Loop: 34487#L66-1 assume !(2 == mp_add_~i~0 % 256); 34863#L67-1 assume !(3 == mp_add_~i~0 % 256); 34862#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34861#L71 assume !(0 == mp_add_~i~0 % 256); 34860#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 34859#L72-1 assume !(2 == mp_add_~i~0 % 256); 34858#L73-1 assume !(3 == mp_add_~i~0 % 256); 34856#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34855#L76-1 assume !(0 == mp_add_~i~0 % 256); 34854#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 34853#L81-1 assume !(2 == mp_add_~i~0 % 256); 34852#L82-1 assume !(3 == mp_add_~i~0 % 256); 34851#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34849#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34850#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34917#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34945#L71 assume !(0 == mp_add_~i~0 % 256); 34914#L71-2 assume !(1 == mp_add_~i~0 % 256); 34913#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 34912#L73-1 assume !(3 == mp_add_~i~0 % 256); 34910#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34909#L76-1 assume !(0 == mp_add_~i~0 % 256); 34908#L80-1 assume !(1 == mp_add_~i~0 % 256); 34907#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 34906#L82-1 assume !(3 == mp_add_~i~0 % 256); 34905#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34811#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34812#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34806#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34808#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34802#L76-1 assume !(0 == mp_add_~i~0 % 256); 34803#L80-1 assume !(1 == mp_add_~i~0 % 256); 34798#L81-1 assume !(2 == mp_add_~i~0 % 256); 34799#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 34794#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34795#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34790#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34791#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34786#L71 assume !(0 == mp_add_~i~0 % 256); 34787#L71-2 assume !(1 == mp_add_~i~0 % 256); 34782#L72-1 assume !(2 == mp_add_~i~0 % 256); 34783#L73-1 assume !(3 == mp_add_~i~0 % 256); 34778#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34779#L76-1 assume !(0 == mp_add_~i~0 % 256); 34774#L80-1 assume !(1 == mp_add_~i~0 % 256); 34775#L81-1 assume !(2 == mp_add_~i~0 % 256); 34770#L82-1 assume !(3 == mp_add_~i~0 % 256); 34771#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34766#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34767#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34762#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34763#L71 assume !(0 == mp_add_~i~0 % 256); 34758#L71-2 assume !(1 == mp_add_~i~0 % 256); 34759#L72-1 assume !(2 == mp_add_~i~0 % 256); 34754#L73-1 assume !(3 == mp_add_~i~0 % 256); 34755#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34750#L76-1 assume !(0 == mp_add_~i~0 % 256); 34751#L80-1 assume !(1 == mp_add_~i~0 % 256); 34746#L81-1 assume !(2 == mp_add_~i~0 % 256); 34747#L82-1 assume !(3 == mp_add_~i~0 % 256); 34742#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34743#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34737#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 34739#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 35134#L71 assume !(0 == mp_add_~i~0 % 256); 35133#L71-2 assume !(1 == mp_add_~i~0 % 256); 34951#L72-1 assume !(2 == mp_add_~i~0 % 256); 34953#L73-1 assume !(3 == mp_add_~i~0 % 256); 34949#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 34950#L76-1 assume !(0 == mp_add_~i~0 % 256); 35126#L80-1 assume !(1 == mp_add_~i~0 % 256); 35125#L81-1 assume !(2 == mp_add_~i~0 % 256); 34902#L82-1 assume !(3 == mp_add_~i~0 % 256); 34714#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34715#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34709#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34710#L65 assume !(0 == mp_add_~i~0 % 256); 34819#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 34487#L66-1 [2019-01-14 02:51:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:28,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1420944545, now seen corresponding path program 3 times [2019-01-14 02:51:28,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:28,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:28,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:28,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:28,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1984374623, now seen corresponding path program 1 times [2019-01-14 02:51:28,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:28,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:28,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:28,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 139 proven. 11 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-14 02:51:28,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:28,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:28,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:28,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:29,558 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 02:51:29,964 WARN L860 $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 [2019-01-14 02:51:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 32 not checked. [2019-01-14 02:51:31,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:31,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-01-14 02:51:31,708 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:51:31,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 02:51:31,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=89, Unknown=2, NotChecked=20, Total=156 [2019-01-14 02:51:31,708 INFO L87 Difference]: Start difference. First operand 870 states and 971 transitions. cyclomatic complexity: 109 Second operand 13 states. [2019-01-14 02:51:32,961 WARN L181 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-14 02:51:33,640 WARN L181 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-14 02:51:34,316 WARN L181 SmtUtils]: Spent 662.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-01-14 02:51:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:34,346 INFO L93 Difference]: Finished difference Result 645 states and 679 transitions. [2019-01-14 02:51:34,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 02:51:34,349 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 645 states and 679 transitions. [2019-01-14 02:51:34,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2019-01-14 02:51:34,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 645 states to 522 states and 553 transitions. [2019-01-14 02:51:34,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 522 [2019-01-14 02:51:34,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 522 [2019-01-14 02:51:34,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 522 states and 553 transitions. [2019-01-14 02:51:34,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:34,354 INFO L706 BuchiCegarLoop]: Abstraction has 522 states and 553 transitions. [2019-01-14 02:51:34,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states and 553 transitions. [2019-01-14 02:51:34,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 472. [2019-01-14 02:51:34,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-01-14 02:51:34,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 502 transitions. [2019-01-14 02:51:34,361 INFO L729 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2019-01-14 02:51:34,361 INFO L609 BuchiCegarLoop]: Abstraction has 472 states and 502 transitions. [2019-01-14 02:51:34,361 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-14 02:51:34,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 472 states and 502 transitions. [2019-01-14 02:51:34,362 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2019-01-14 02:51:34,362 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:34,362 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:34,363 INFO L867 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] [2019-01-14 02:51:34,363 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:34,363 INFO L794 eck$LassoCheckResult]: Stem: 36256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 36249#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 36251#L42 assume !(0 == mp_add_~a2~0 % 256); 36244#L40-1 mp_add_~nb~0 := 4; 36245#L50 assume !(0 == mp_add_~b3~0 % 256); 36240#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 36241#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36265#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 36266#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 36304#L65-2 assume !(1 == mp_add_~i~0 % 256); 36305#L66-1 assume !(2 == mp_add_~i~0 % 256); 36300#L67-1 assume !(3 == mp_add_~i~0 % 256); 36301#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36296#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 36297#L71-2 assume !(1 == mp_add_~i~0 % 256); 36292#L72-1 assume !(2 == mp_add_~i~0 % 256); 36293#L73-1 assume !(3 == mp_add_~i~0 % 256); 36287#L70 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 36289#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 36283#L80-1 assume !(1 == mp_add_~i~0 % 256); 36284#L81-1 assume !(2 == mp_add_~i~0 % 256); 36279#L82-1 assume !(3 == mp_add_~i~0 % 256); 36280#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36665#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36660#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36658#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36656#L71 assume !(0 == mp_add_~i~0 % 256); 36654#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 36652#L72-1 assume !(2 == mp_add_~i~0 % 256); 36650#L73-1 assume !(3 == mp_add_~i~0 % 256); 36648#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36645#L76-1 assume !(0 == mp_add_~i~0 % 256); 36643#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 36641#L81-1 assume !(2 == mp_add_~i~0 % 256); 36639#L82-1 assume !(3 == mp_add_~i~0 % 256); 36637#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36635#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36633#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36631#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36629#L71 assume !(0 == mp_add_~i~0 % 256); 36627#L71-2 assume !(1 == mp_add_~i~0 % 256); 36625#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 36623#L73-1 assume !(3 == mp_add_~i~0 % 256); 36620#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36621#L76-1 assume !(0 == mp_add_~i~0 % 256); 36700#L80-1 assume !(1 == mp_add_~i~0 % 256); 36699#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 36698#L82-1 assume !(3 == mp_add_~i~0 % 256); 36697#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36696#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36695#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36694#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36693#L71 assume !(0 == mp_add_~i~0 % 256); 36692#L71-2 assume !(1 == mp_add_~i~0 % 256); 36691#L72-1 assume !(2 == mp_add_~i~0 % 256); 36690#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 36236#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36237#L76-1 assume !(0 == mp_add_~i~0 % 256); 36229#L80-1 assume !(1 == mp_add_~i~0 % 256); 36230#L81-1 assume !(2 == mp_add_~i~0 % 256); 36233#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 36239#L83-1 [2019-01-14 02:51:34,363 INFO L796 eck$LassoCheckResult]: Loop: 36239#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 36234#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36235#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36252#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 36242#L71 assume !(0 == mp_add_~i~0 % 256); 36231#L71-2 assume !(1 == mp_add_~i~0 % 256); 36232#L72-1 assume !(2 == mp_add_~i~0 % 256); 36243#L73-1 assume !(3 == mp_add_~i~0 % 256); 36248#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 36689#L76-1 assume !(0 == mp_add_~i~0 % 256); 36688#L80-1 assume !(1 == mp_add_~i~0 % 256); 36687#L81-1 assume !(2 == mp_add_~i~0 % 256); 36238#L82-1 assume !(3 == mp_add_~i~0 % 256); 36239#L83-1 [2019-01-14 02:51:34,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:34,364 INFO L82 PathProgramCache]: Analyzing trace with hash -959140882, now seen corresponding path program 1 times [2019-01-14 02:51:34,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:34,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:34,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:34,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:34,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 02:51:34,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:34,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:34,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:34,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:34,754 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 43 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 02:51:34,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:34,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-01-14 02:51:34,782 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:51:34,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:34,782 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 1 times [2019-01-14 02:51:34,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:34,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:34,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:34,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:34,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:34,907 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-01-14 02:51:34,937 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:34,938 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:34,938 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:34,938 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:34,938 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:51:34,938 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:34,938 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:34,939 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:34,939 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2019-01-14 02:51:34,939 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:34,939 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:34,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:34,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:35,209 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-14 02:51:35,269 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:35,270 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:35,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:35,275 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:51:35,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:51:35,286 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:35,310 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:35,310 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:51:35,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:51:35,432 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:47,446 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-14 02:51:47,449 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:47,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:47,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:47,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:47,450 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:51:47,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:47,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:47,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:47,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration24_Loop [2019-01-14 02:51:47,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:47,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:47,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:47,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:47,660 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-14 02:51:47,816 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:47,816 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:51:47,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 [2019-01-14 02:51:47,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:47,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:47,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,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 [2019-01-14 02:51:47,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:47,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:47,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,823 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:51:47,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:47,825 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:47,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:47,827 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:47,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,830 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:51:47,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:47,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:47,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:47,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:47,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,838 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:51:47,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,839 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:47,839 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:47,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:47,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,841 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:47,842 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:47,842 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,846 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:51:47,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,847 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:47,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,847 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:47,848 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:47,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,850 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:47,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,850 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:47,851 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:47,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,857 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:51:47,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,858 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,858 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:47,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,859 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:47,860 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:47,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,862 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:47,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:47,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:47,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,874 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:51:47,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,875 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:47,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,875 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:47,877 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:47,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,879 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:47,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:47,882 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:47,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,898 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:51:47,899 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,899 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:47,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,900 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:47,900 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:47,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,904 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:47,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,904 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:47,905 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:47,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,911 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:51:47,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,912 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,912 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:47,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,913 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:47,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:47,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:47,919 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:47,919 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:47,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:47,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:47,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:47,919 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:47,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:47,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:47,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:47,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 02:51:47,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-01-14 02:51:47,933 INFO L87 Difference]: Start difference. First operand 472 states and 502 transitions. cyclomatic complexity: 34 Second operand 12 states. [2019-01-14 02:51:48,602 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 15 [2019-01-14 02:51:48,957 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-01-14 02:51:49,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:51:49,899 INFO L93 Difference]: Finished difference Result 580 states and 608 transitions. [2019-01-14 02:51:49,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 02:51:49,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 608 transitions. [2019-01-14 02:51:49,903 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 123 [2019-01-14 02:51:49,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 561 states and 589 transitions. [2019-01-14 02:51:49,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 561 [2019-01-14 02:51:49,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 561 [2019-01-14 02:51:49,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 561 states and 589 transitions. [2019-01-14 02:51:49,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:51:49,906 INFO L706 BuchiCegarLoop]: Abstraction has 561 states and 589 transitions. [2019-01-14 02:51:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states and 589 transitions. [2019-01-14 02:51:49,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 425. [2019-01-14 02:51:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-01-14 02:51:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 449 transitions. [2019-01-14 02:51:49,920 INFO L729 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2019-01-14 02:51:49,920 INFO L609 BuchiCegarLoop]: Abstraction has 425 states and 449 transitions. [2019-01-14 02:51:49,920 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2019-01-14 02:51:49,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 425 states and 449 transitions. [2019-01-14 02:51:49,924 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 61 [2019-01-14 02:51:49,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:51:49,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:51:49,925 INFO L867 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] [2019-01-14 02:51:49,925 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:51:49,925 INFO L794 eck$LassoCheckResult]: Stem: 37509#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~ret1, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 37502#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37504#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37508#L44 assume 0 == mp_add_~a1~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 37514#L40-1 mp_add_~nb~0 := 4; 37555#L50 assume !(0 == mp_add_~b3~0 % 256); 37493#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 37494#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37558#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 37556#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 37557#L65-2 assume !(1 == mp_add_~i~0 % 256); 37512#L66-1 assume !(2 == mp_add_~i~0 % 256); 37513#L67-1 assume !(3 == mp_add_~i~0 % 256); 37516#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37906#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 37904#L71-2 assume !(1 == mp_add_~i~0 % 256); 37902#L72-1 assume !(2 == mp_add_~i~0 % 256); 37900#L73-1 assume !(3 == mp_add_~i~0 % 256); 37898#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37897#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 37896#L80-1 assume !(1 == mp_add_~i~0 % 256); 37895#L81-1 assume !(2 == mp_add_~i~0 % 256); 37894#L82-1 assume !(3 == mp_add_~i~0 % 256); 37893#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37892#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37890#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37888#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37886#L71 assume !(0 == mp_add_~i~0 % 256); 37884#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 37882#L72-1 assume !(2 == mp_add_~i~0 % 256); 37880#L73-1 assume !(3 == mp_add_~i~0 % 256); 37878#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37876#L76-1 assume !(0 == mp_add_~i~0 % 256); 37874#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 37872#L81-1 assume !(2 == mp_add_~i~0 % 256); 37870#L82-1 assume !(3 == mp_add_~i~0 % 256); 37868#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37866#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37864#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37862#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37860#L71 assume !(0 == mp_add_~i~0 % 256); 37858#L71-2 assume !(1 == mp_add_~i~0 % 256); 37856#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 37854#L73-1 assume !(3 == mp_add_~i~0 % 256); 37852#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37850#L76-1 assume !(0 == mp_add_~i~0 % 256); 37848#L80-1 assume !(1 == mp_add_~i~0 % 256); 37846#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 37844#L82-1 assume !(3 == mp_add_~i~0 % 256); 37842#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37840#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37838#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37836#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37834#L71 assume !(0 == mp_add_~i~0 % 256); 37832#L71-2 assume !(1 == mp_add_~i~0 % 256); 37830#L72-1 assume !(2 == mp_add_~i~0 % 256); 37828#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 37826#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37825#L76-1 assume !(0 == mp_add_~i~0 % 256); 37824#L80-1 assume !(1 == mp_add_~i~0 % 256); 37823#L81-1 assume !(2 == mp_add_~i~0 % 256); 37822#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 37495#L83-1 [2019-01-14 02:51:49,928 INFO L796 eck$LassoCheckResult]: Loop: 37495#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 37489#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 37490#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 37507#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 37498#L71 assume !(0 == mp_add_~i~0 % 256); 37486#L71-2 assume !(1 == mp_add_~i~0 % 256); 37487#L72-1 assume !(2 == mp_add_~i~0 % 256); 37499#L73-1 assume !(3 == mp_add_~i~0 % 256); 37491#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 37492#L76-1 assume !(0 == mp_add_~i~0 % 256); 37484#L80-1 assume !(1 == mp_add_~i~0 % 256); 37485#L81-1 assume !(2 == mp_add_~i~0 % 256); 37488#L82-1 assume !(3 == mp_add_~i~0 % 256); 37495#L83-1 [2019-01-14 02:51:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash 773605064, now seen corresponding path program 1 times [2019-01-14 02:51:49,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:49,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:49,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash 72112647, now seen corresponding path program 2 times [2019-01-14 02:51:49,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:49,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:49,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:49,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:51:49,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:51:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:51:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash -600207712, now seen corresponding path program 2 times [2019-01-14 02:51:49,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:51:49,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:51:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:49,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:51:49,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:51:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:51:50,636 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 57 proven. 32 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-01-14 02:51:50,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:51:50,636 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:51:50,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 02:51:50,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:51:50,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:51:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-01-14 02:51:50,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:51:50,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-01-14 02:51:50,925 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:50,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:50,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:50,926 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:50,926 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:51:50,926 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:50,926 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:50,926 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:50,926 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2019-01-14 02:51:50,926 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:50,927 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:50,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:50,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:51,079 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-14 02:51:51,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:51,171 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:51,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:51:51,180 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 02:51:51,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:51:51,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:51:59,450 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:51:59,453 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:51:59,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:51:59,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:51:59,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:51:59,453 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:51:59,453 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:51:59,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:51:59,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:51:59,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_2_true-unreach-call_true-no-overflow_true-termination.i_Iteration25_Loop [2019-01-14 02:51:59,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:51:59,454 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:51:59,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:59,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:51:59,663 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-01-14 02:51:59,756 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:51:59,756 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:51:59,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:59,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:59,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:51:59,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:51:59,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,763 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-14 02:51:59,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,764 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:59,764 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:59,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,768 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:59,768 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:59,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,769 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-14 02:51:59,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:59,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:59,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,775 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:59,776 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:59,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,777 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-14 02:51:59,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 [2019-01-14 02:51:59,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,778 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:59,779 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:59,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:51:59,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,784 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:59,785 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:59,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,785 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-14 02:51:59,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,786 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,786 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:59,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,787 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:59,788 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:59,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,798 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:59,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,799 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-14 02:51:59,799 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-14 02:51:59,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,800 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-14 02:51:59,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,801 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,801 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:59,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:59,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:59,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,822 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,826 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-14 02:51:59,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,826 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:59,827 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:59,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,832 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-14 02:51:59,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,835 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:59,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,835 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:59,841 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:59,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,864 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:59,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,867 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-14 02:51:59,869 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-14 02:51:59,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,873 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-14 02:51:59,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,874 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:59,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,875 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:59,875 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:59,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,889 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,889 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-14 02:51:59,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-14 02:51:59,890 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:51:59,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,898 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-14 02:51:59,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,899 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,899 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:59,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,899 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:59,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:59,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:51:59,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-14 02:51:59,929 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-14 02:51:59,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:51:59,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:51:59,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:51:59,930 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-14 02:51:59,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:51:59,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:51:59,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:51:59,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 02:51:59,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-01-14 02:51:59,944 INFO L87 Difference]: Start difference. First operand 425 states and 449 transitions. cyclomatic complexity: 28 Second operand 16 states. [2019-01-14 02:52:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:52:01,170 INFO L93 Difference]: Finished difference Result 349 states and 366 transitions. [2019-01-14 02:52:01,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:52:01,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 366 transitions. [2019-01-14 02:52:01,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:52:01,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 0 states and 0 transitions. [2019-01-14 02:52:01,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:52:01,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:52:01,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:52:01,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:52:01,175 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:52:01,175 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:52:01,175 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:52:01,175 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2019-01-14 02:52:01,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:52:01,175 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:52:01,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:52:01,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:52:01 BoogieIcfgContainer [2019-01-14 02:52:01,191 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:52:01,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:52:01,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:52:01,192 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:52:01,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:50:03" (3/4) ... [2019-01-14 02:52:01,196 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:52:01,196 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:52:01,197 INFO L168 Benchmark]: Toolchain (without parser) took 119330.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.5 MB). Free memory was 944.6 MB in the beginning and 1.1 GB in the end (delta: -201.0 MB). Peak memory consumption was 177.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:52:01,198 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:52:01,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.87 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:52:01,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.84 ms. Allocated memory is still 1.0 GB. Free memory was 933.9 MB in the beginning and 928.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:52:01,200 INFO L168 Benchmark]: Boogie Preprocessor took 113.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:52:01,201 INFO L168 Benchmark]: RCFGBuilder took 612.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:52:01,204 INFO L168 Benchmark]: BuchiAutomizer took 118108.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.3 MB). Peak memory consumption was 202.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:52:01,205 INFO L168 Benchmark]: Witness Printer took 5.31 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. [2019-01-14 02:52:01,216 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 421.87 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.84 ms. Allocated memory is still 1.0 GB. Free memory was 933.9 MB in the beginning and 928.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 928.5 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 612.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 118108.32 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.3 MB). Peak memory consumption was 202.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.31 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 118.0s and 26 iterations. TraceHistogramMax:7. Analysis of lassos took 59.3s. Construction of modules took 45.2s. Büchi inclusion checks took 12.4s. Highest rank in rank-based complementation 0. Minimization of det autom 25. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 24 MinimizatonAttempts, 5831 StatesRemovedByMinimization, 23 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1624 states and ocurred in iteration 18. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1047 SDtfs, 4961 SDslu, 2034 SDs, 0 SdLazy, 8996 SolverSat, 816 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 45.2s 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: 23ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 36.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...