./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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_1_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 6e973c5cecb5d30af2cf4ea74d1b0b1563334ffe ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:07:39,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:07:39,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:07:39,104 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:07:39,104 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:07:39,105 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:07:39,107 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:07:39,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:07:39,111 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:07:39,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:07:39,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:07:39,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:07:39,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:07:39,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:07:39,117 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:07:39,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:07:39,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:07:39,121 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:07:39,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:07:39,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:07:39,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:07:39,128 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:07:39,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:07:39,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:07:39,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:07:39,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:07:39,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:07:39,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:07:39,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:07:39,137 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:07:39,137 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:07:39,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:07:39,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:07:39,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:07:39,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:07:39,143 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:07:39,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:07:39,176 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:07:39,176 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:07:39,177 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:07:39,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:07:39,179 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:07:39,179 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:07:39,179 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:07:39,180 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:07:39,180 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:07:39,180 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:07:39,180 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:07:39,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:07:39,180 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:07:39,181 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:07:39,182 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:07:39,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:07:39,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:07:39,183 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:07:39,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:07:39,184 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:07:39,185 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:07:39,186 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:07:39,186 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:07:39,186 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:07:39,186 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:07:39,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:07:39,187 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:07:39,187 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:07:39,187 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:07:39,187 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:07:39,187 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:07:39,188 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:07:39,190 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 -> 6e973c5cecb5d30af2cf4ea74d1b0b1563334ffe [2019-01-01 22:07:39,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:07:39,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:07:39,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:07:39,265 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:07:39,266 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:07:39,267 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 22:07:39,336 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cde0bbae/a69daf5b67fa442d9e45cf118df9e81e/FLAGeeef45a42 [2019-01-01 22:07:39,855 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:07:39,856 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 22:07:39,864 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cde0bbae/a69daf5b67fa442d9e45cf118df9e81e/FLAGeeef45a42 [2019-01-01 22:07:40,173 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cde0bbae/a69daf5b67fa442d9e45cf118df9e81e [2019-01-01 22:07:40,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:07:40,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:07:40,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:07:40,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:07:40,185 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:07:40,186 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453557c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40, skipping insertion in model container [2019-01-01 22:07:40,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,198 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:07:40,229 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:07:40,543 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:07:40,548 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:07:40,616 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:07:40,644 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:07:40,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40 WrapperNode [2019-01-01 22:07:40,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:07:40,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:07:40,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:07:40,647 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:07:40,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:07:40,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:07:40,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:07:40,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:07:40,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,798 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,798 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (1/1) ... [2019-01-01 22:07:40,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:07:40,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:07:40,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:07:40,818 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:07:40,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (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-01 22:07:40,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:07:40,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:07:41,468 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:07:41,468 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2019-01-01 22:07:41,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:41 BoogieIcfgContainer [2019-01-01 22:07:41,469 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:07:41,470 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:07:41,470 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:07:41,474 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:07:41,475 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:41,475 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:07:40" (1/3) ... [2019-01-01 22:07:41,476 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa619c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:07:41, skipping insertion in model container [2019-01-01 22:07:41,477 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:41,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:40" (2/3) ... [2019-01-01 22:07:41,477 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fa619c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:07:41, skipping insertion in model container [2019-01-01 22:07:41,477 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:41,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:41" (3/3) ... [2019-01-01 22:07:41,479 INFO L375 chiAutomizerObserver]: Analyzing ICFG byte_add_1_true-unreach-call_true-no-overflow_true-termination.i [2019-01-01 22:07:41,545 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:07:41,545 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:07:41,546 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:07:41,546 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:07:41,547 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:07:41,547 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:07:41,547 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:07:41,547 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:07:41,547 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:07:41,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-01 22:07:41,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-01 22:07:41,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:41,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:41,596 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:41,597 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:41,597 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:07:41,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-01-01 22:07:41,601 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-01-01 22:07:41,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:41,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:41,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:41,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:41,610 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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 30#L50true assume !(0 == mp_add_~b3~0 % 256); 28#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 24#L61-2true [2019-01-01 22:07:41,610 INFO L796 eck$LassoCheckResult]: Loop: 24#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); 26#L70true assume !(mp_add_~partial_sum~0 % 65536 > 255); 14#L76-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 23#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; 24#L61-2true [2019-01-01 22:07:41,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:41,616 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2019-01-01 22:07:41,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:41,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:41,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:41,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:41,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2019-01-01 22:07:41,788 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:41,788 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:41,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:41,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:41,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:41,864 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-01 22:07:41,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:41,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:07:41,873 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:41,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:41,895 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-01-01 22:07:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:42,411 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2019-01-01 22:07:42,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:42,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2019-01-01 22:07:42,418 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2019-01-01 22:07:42,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2019-01-01 22:07:42,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-01 22:07:42,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-01-01 22:07:42,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2019-01-01 22:07:42,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:42,428 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2019-01-01 22:07:42,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2019-01-01 22:07:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-01-01 22:07:42,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-01 22:07:42,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2019-01-01 22:07:42,462 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-01 22:07:42,462 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-01-01 22:07:42,462 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:07:42,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2019-01-01 22:07:42,467 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-01-01 22:07:42,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:42,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:42,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:42,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:42,469 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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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-01 22:07:42,469 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-01 22:07:42,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:42,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2019-01-01 22:07:42,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:42,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:42,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:42,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:42,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:42,958 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-01-01 22:07:43,065 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-01 22:07:43,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:43,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:43,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:43,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:43,067 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2019-01-01 22:07:43,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:43,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:43,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:43,237 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-01 22:07:43,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:43,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:43,238 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:43,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:07:43,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:07:43,239 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-01-01 22:07:43,710 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 14 [2019-01-01 22:07:45,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:45,213 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2019-01-01 22:07:45,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:07:45,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2019-01-01 22:07:45,221 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2019-01-01 22:07:45,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2019-01-01 22:07:45,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-01-01 22:07:45,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2019-01-01 22:07:45,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2019-01-01 22:07:45,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:45,229 INFO L705 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-01-01 22:07:45,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2019-01-01 22:07:45,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2019-01-01 22:07:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-01 22:07:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2019-01-01 22:07:45,245 INFO L728 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-01 22:07:45,245 INFO L608 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-01-01 22:07:45,245 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:07:45,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2019-01-01 22:07:45,248 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2019-01-01 22:07:45,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:45,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:45,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:45,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:45,250 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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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-01 22:07:45,250 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-01 22:07:45,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:45,250 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2019-01-01 22:07:45,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:45,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:45,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:45,330 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-01 22:07:45,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:45,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:07:45,333 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:45,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2019-01-01 22:07:45,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:45,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:45,488 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-01 22:07:45,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:45,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:07:45,489 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:45,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:45,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:45,491 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 3 states. [2019-01-01 22:07:45,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:45,496 INFO L93 Difference]: Finished difference Result 116 states and 161 transitions. [2019-01-01 22:07:45,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:45,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 161 transitions. [2019-01-01 22:07:45,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2019-01-01 22:07:45,503 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 116 states and 161 transitions. [2019-01-01 22:07:45,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2019-01-01 22:07:45,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2019-01-01 22:07:45,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 161 transitions. [2019-01-01 22:07:45,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:45,505 INFO L705 BuchiCegarLoop]: Abstraction has 116 states and 161 transitions. [2019-01-01 22:07:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 161 transitions. [2019-01-01 22:07:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-01-01 22:07:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-01 22:07:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2019-01-01 22:07:45,517 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 161 transitions. [2019-01-01 22:07:45,517 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 161 transitions. [2019-01-01 22:07:45,517 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:07:45,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 161 transitions. [2019-01-01 22:07:45,520 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2019-01-01 22:07:45,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:45,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:45,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:45,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:45,522 INFO L794 eck$LassoCheckResult]: Stem: 686#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 661#L40 assume !(0 == mp_add_~a3~0 % 256); 658#L40-1 mp_add_~nb~0 := 4; 659#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 683#L52 assume !(0 == mp_add_~b2~0 % 256); 668#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 716#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 715#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 714#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 713#L65-2 assume !(1 == mp_add_~i~0 % 256); 712#L66-1 assume !(2 == mp_add_~i~0 % 256); 711#L67-1 assume !(3 == mp_add_~i~0 % 256); 710#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 709#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; 739#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 738#L80-1 assume !(1 == mp_add_~i~0 % 256); 737#L81-1 assume !(2 == mp_add_~i~0 % 256); 735#L82-1 assume !(3 == mp_add_~i~0 % 256); 734#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 730#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 724#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 722#L65 [2019-01-01 22:07:45,523 INFO L796 eck$LassoCheckResult]: Loop: 722#L65 assume !(0 == mp_add_~i~0 % 256); 721#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; 720#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; 717#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; 707#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 705#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 701#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 702#L80-1 assume !(1 == mp_add_~i~0 % 256); 697#L81-1 assume !(2 == mp_add_~i~0 % 256); 694#L82-1 assume !(3 == mp_add_~i~0 % 256); 691#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 692#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 725#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 722#L65 [2019-01-01 22:07:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash -421280975, now seen corresponding path program 1 times [2019-01-01 22:07:45,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:45,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:45,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:45,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:45,781 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-01 22:07:45,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:45,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:07:45,782 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:45,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:45,783 INFO L82 PathProgramCache]: Analyzing trace with hash -792442257, now seen corresponding path program 1 times [2019-01-01 22:07:45,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:45,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:45,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:45,822 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-01 22:07:45,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:45,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:07:45,823 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:45,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:45,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:45,823 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. cyclomatic complexity: 48 Second operand 3 states. [2019-01-01 22:07:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:46,000 INFO L93 Difference]: Finished difference Result 145 states and 201 transitions. [2019-01-01 22:07:46,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:46,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 201 transitions. [2019-01-01 22:07:46,002 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 99 [2019-01-01 22:07:46,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 145 states and 201 transitions. [2019-01-01 22:07:46,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2019-01-01 22:07:46,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2019-01-01 22:07:46,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 201 transitions. [2019-01-01 22:07:46,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:46,007 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 201 transitions. [2019-01-01 22:07:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 201 transitions. [2019-01-01 22:07:46,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2019-01-01 22:07:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-01 22:07:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 192 transitions. [2019-01-01 22:07:46,017 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 192 transitions. [2019-01-01 22:07:46,017 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 192 transitions. [2019-01-01 22:07:46,017 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:07:46,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 192 transitions. [2019-01-01 22:07:46,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 90 [2019-01-01 22:07:46,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:46,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:46,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,020 INFO L794 eck$LassoCheckResult]: Stem: 956#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 933#L40 assume !(0 == mp_add_~a3~0 % 256); 930#L40-1 mp_add_~nb~0 := 4; 931#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 954#L52 assume !(0 == mp_add_~b2~0 % 256); 940#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; 982#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 981#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 980#L65-2 assume !(1 == mp_add_~i~0 % 256); 979#L66-1 assume !(2 == mp_add_~i~0 % 256); 978#L67-1 assume !(3 == mp_add_~i~0 % 256); 976#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 975#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; 970#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 971#L80-1 assume !(1 == mp_add_~i~0 % 256); 966#L81-1 assume !(2 == mp_add_~i~0 % 256); 967#L82-1 assume !(3 == mp_add_~i~0 % 256); 955#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 949#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 950#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 957#L65 [2019-01-01 22:07:46,020 INFO L796 eck$LassoCheckResult]: Loop: 957#L65 assume !(0 == mp_add_~i~0 % 256); 1015#L65-2 assume !(1 == mp_add_~i~0 % 256); 1014#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; 1012#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; 1008#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1007#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1001#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1002#L80-1 assume !(1 == mp_add_~i~0 % 256); 1029#L81-1 assume !(2 == mp_add_~i~0 % 256); 1028#L82-1 assume !(3 == mp_add_~i~0 % 256); 1025#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1024#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1013#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 957#L65 [2019-01-01 22:07:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:46,021 INFO L82 PathProgramCache]: Analyzing trace with hash -421280975, now seen corresponding path program 2 times [2019-01-01 22:07:46,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:46,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:46,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:46,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:46,231 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-01 22:07:46,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:46,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:07:46,233 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:46,233 INFO L82 PathProgramCache]: Analyzing trace with hash -534276819, now seen corresponding path program 1 times [2019-01-01 22:07:46,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:46,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:46,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:46,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:46,268 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-01 22:07:46,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:46,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:07:46,269 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:46,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:46,270 INFO L87 Difference]: Start difference. First operand 136 states and 192 transitions. cyclomatic complexity: 59 Second operand 3 states. [2019-01-01 22:07:46,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:46,385 INFO L93 Difference]: Finished difference Result 162 states and 233 transitions. [2019-01-01 22:07:46,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:46,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 233 transitions. [2019-01-01 22:07:46,389 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 116 [2019-01-01 22:07:46,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 162 states and 233 transitions. [2019-01-01 22:07:46,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 162 [2019-01-01 22:07:46,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 162 [2019-01-01 22:07:46,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 233 transitions. [2019-01-01 22:07:46,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:46,392 INFO L705 BuchiCegarLoop]: Abstraction has 162 states and 233 transitions. [2019-01-01 22:07:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 233 transitions. [2019-01-01 22:07:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 156. [2019-01-01 22:07:46,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-01 22:07:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 227 transitions. [2019-01-01 22:07:46,402 INFO L728 BuchiCegarLoop]: Abstraction has 156 states and 227 transitions. [2019-01-01 22:07:46,402 INFO L608 BuchiCegarLoop]: Abstraction has 156 states and 227 transitions. [2019-01-01 22:07:46,402 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:07:46,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 227 transitions. [2019-01-01 22:07:46,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2019-01-01 22:07:46,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:46,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:46,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,405 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,405 INFO L794 eck$LassoCheckResult]: Stem: 1266#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 1242#L40 assume !(0 == mp_add_~a3~0 % 256); 1239#L40-1 mp_add_~nb~0 := 4; 1240#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1264#L52 assume !(0 == mp_add_~b2~0 % 256); 1249#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1262#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1335#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1250#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1251#L65-2 assume !(1 == mp_add_~i~0 % 256); 1346#L66-1 assume !(2 == mp_add_~i~0 % 256); 1344#L67-1 assume !(3 == mp_add_~i~0 % 256); 1341#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1339#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; 1338#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1337#L80-1 assume !(1 == mp_add_~i~0 % 256); 1336#L81-1 assume !(2 == mp_add_~i~0 % 256); 1237#L82-1 assume !(3 == mp_add_~i~0 % 256); 1238#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1305#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1301#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1300#L65 [2019-01-01 22:07:46,406 INFO L796 eck$LassoCheckResult]: Loop: 1300#L65 assume !(0 == mp_add_~i~0 % 256); 1298#L65-2 assume !(1 == mp_add_~i~0 % 256); 1296#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; 1297#L67-1 assume !(3 == mp_add_~i~0 % 256); 1378#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1376#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1374#L76-1 assume !(0 == mp_add_~i~0 % 256); 1373#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1232#L81-1 assume !(2 == mp_add_~i~0 % 256); 1258#L82-1 assume !(3 == mp_add_~i~0 % 256); 1275#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1268#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1269#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1300#L65 [2019-01-01 22:07:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash -421280975, now seen corresponding path program 3 times [2019-01-01 22:07:46,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:46,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:46,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:46,545 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-01 22:07:46,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:46,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:07:46,546 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash 790445231, now seen corresponding path program 1 times [2019-01-01 22:07:46,546 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:46,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:46,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:46,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:46,572 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-01 22:07:46,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:46,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:07:46,573 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:46,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:46,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:46,573 INFO L87 Difference]: Start difference. First operand 156 states and 227 transitions. cyclomatic complexity: 74 Second operand 3 states. [2019-01-01 22:07:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:46,690 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2019-01-01 22:07:46,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:46,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 264 transitions. [2019-01-01 22:07:46,694 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 140 [2019-01-01 22:07:46,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 264 transitions. [2019-01-01 22:07:46,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2019-01-01 22:07:46,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2019-01-01 22:07:46,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 264 transitions. [2019-01-01 22:07:46,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:46,697 INFO L705 BuchiCegarLoop]: Abstraction has 186 states and 264 transitions. [2019-01-01 22:07:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 264 transitions. [2019-01-01 22:07:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2019-01-01 22:07:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-01 22:07:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2019-01-01 22:07:46,706 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 253 transitions. [2019-01-01 22:07:46,706 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 253 transitions. [2019-01-01 22:07:46,706 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:07:46,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 253 transitions. [2019-01-01 22:07:46,708 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2019-01-01 22:07:46,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:46,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:46,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:46,710 INFO L794 eck$LassoCheckResult]: Stem: 1625#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 1595#L40 assume !(0 == mp_add_~a3~0 % 256); 1593#L40-1 mp_add_~nb~0 := 4; 1594#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1621#L52 assume !(0 == mp_add_~b2~0 % 256); 1602#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1652#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1651#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1650#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1649#L65-2 assume !(1 == mp_add_~i~0 % 256); 1648#L66-1 assume !(2 == mp_add_~i~0 % 256); 1647#L67-1 assume !(3 == mp_add_~i~0 % 256); 1645#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1644#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; 1639#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1640#L80-1 assume !(1 == mp_add_~i~0 % 256); 1635#L81-1 assume !(2 == mp_add_~i~0 % 256); 1636#L82-1 assume !(3 == mp_add_~i~0 % 256); 1619#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1620#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1623#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1624#L65 [2019-01-01 22:07:46,710 INFO L796 eck$LassoCheckResult]: Loop: 1624#L65 assume !(0 == mp_add_~i~0 % 256); 1686#L65-2 assume !(1 == mp_add_~i~0 % 256); 1684#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; 1683#L67-1 assume !(3 == mp_add_~i~0 % 256); 1681#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1680#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1675#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1584#L80-1 assume !(1 == mp_add_~i~0 % 256); 1585#L81-1 assume !(2 == mp_add_~i~0 % 256); 1611#L82-1 assume !(3 == mp_add_~i~0 % 256); 1631#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1632#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1689#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1624#L65 [2019-01-01 22:07:46,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash -421280975, now seen corresponding path program 4 times [2019-01-01 22:07:46,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:46,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:47,213 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-01 22:07:47,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:47,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:07:47,214 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:47,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash -927303829, now seen corresponding path program 1 times [2019-01-01 22:07:47,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:47,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:47,269 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-01 22:07:47,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:47,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:07:47,270 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:07:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:47,270 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. cyclomatic complexity: 81 Second operand 3 states. [2019-01-01 22:07:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:47,374 INFO L93 Difference]: Finished difference Result 186 states and 250 transitions. [2019-01-01 22:07:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:47,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 250 transitions. [2019-01-01 22:07:47,378 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 140 [2019-01-01 22:07:47,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 186 states and 250 transitions. [2019-01-01 22:07:47,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 186 [2019-01-01 22:07:47,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 186 [2019-01-01 22:07:47,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 250 transitions. [2019-01-01 22:07:47,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:47,381 INFO L705 BuchiCegarLoop]: Abstraction has 186 states and 250 transitions. [2019-01-01 22:07:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states and 250 transitions. [2019-01-01 22:07:47,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 175. [2019-01-01 22:07:47,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-01 22:07:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2019-01-01 22:07:47,389 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 239 transitions. [2019-01-01 22:07:47,389 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 239 transitions. [2019-01-01 22:07:47,389 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:07:47,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 239 transitions. [2019-01-01 22:07:47,390 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 129 [2019-01-01 22:07:47,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:47,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:47,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:47,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:47,392 INFO L794 eck$LassoCheckResult]: Stem: 1998#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 1970#L40 assume !(0 == mp_add_~a3~0 % 256); 1966#L40-1 mp_add_~nb~0 := 4; 1967#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1994#L52 assume !(0 == mp_add_~b2~0 % 256); 1975#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2024#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2023#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2022#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2021#L65-2 assume !(1 == mp_add_~i~0 % 256); 2020#L66-1 assume !(2 == mp_add_~i~0 % 256); 2019#L67-1 assume !(3 == mp_add_~i~0 % 256); 2017#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2016#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; 2011#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2012#L80-1 assume !(1 == mp_add_~i~0 % 256); 2007#L81-1 assume !(2 == mp_add_~i~0 % 256); 2008#L82-1 assume !(3 == mp_add_~i~0 % 256); 1992#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1993#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1996#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1997#L65 [2019-01-01 22:07:47,392 INFO L796 eck$LassoCheckResult]: Loop: 1997#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1971#L65-2 assume !(1 == mp_add_~i~0 % 256); 1972#L66-1 assume !(2 == mp_add_~i~0 % 256); 1981#L67-1 assume !(3 == mp_add_~i~0 % 256); 1982#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1969#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 1989#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1956#L80-1 assume !(1 == mp_add_~i~0 % 256); 1957#L81-1 assume !(2 == mp_add_~i~0 % 256); 1985#L82-1 assume !(3 == mp_add_~i~0 % 256); 2003#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2004#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2060#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1997#L65 [2019-01-01 22:07:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:47,393 INFO L82 PathProgramCache]: Analyzing trace with hash -421280975, now seen corresponding path program 5 times [2019-01-01 22:07:47,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:47,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:47,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:47,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:47,836 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-01 22:07:47,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:47,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 22:07:47,837 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:47,837 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 3 times [2019-01-01 22:07:47,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:47,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:47,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:47,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:47,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:47,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:47,985 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:47,986 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:47,986 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:47,986 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:47,986 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:07:47,986 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:47,987 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:47,987 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:47,987 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-01 22:07:47,987 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:47,987 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:48,005 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-01 22:07:48,029 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-01 22:07:48,292 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:07:48,473 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-01 22:07:48,560 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:48,560 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-01 22:07:48,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:07:48,566 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-01 22:07:48,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:07:48,647 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:07:50,553 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:07:50,555 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:50,555 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:50,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:50,556 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:50,556 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:07:50,556 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:50,556 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:50,556 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:50,556 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration8_Loop [2019-01-01 22:07:50,556 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:50,556 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:50,558 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-01 22:07:50,568 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-01 22:07:50,715 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-01 22:07:50,957 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:07:51,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:51,087 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:07:51,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:51,095 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:51,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:51,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:51,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,105 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:07:51,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,107 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:51,110 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:51,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,114 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:51,117 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:51,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,123 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:07:51,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:51,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,125 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:51,129 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:51,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:51,136 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:51,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,142 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:07:51,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,144 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:51,147 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:51,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:51,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:51,154 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:51,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,162 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:07:51,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,163 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:51,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:51,168 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:51,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,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-01 22:07:51,173 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,173 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:51,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,174 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:07:51,177 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:07:51,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,193 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:07:51,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,194 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,194 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:07:51,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:51,201 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:51,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,211 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:07:51,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,211 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:51,218 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:51,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,260 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:07:51,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,261 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,261 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:51,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,267 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:51,279 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:51,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,288 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:51,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,289 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:07:51,295 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:07:51,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,314 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:07:51,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-01 22:07:51,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:51,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,318 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:51,320 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:51,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,328 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:07:51,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,329 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:07:51,332 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:07:51,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,349 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:07:51,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:07:51,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:51,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,352 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:07:51,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:51,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:51,370 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:07:51,370 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:07:51,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:51,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:51,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:51,372 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:07:51,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:51,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:51,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:51,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:07:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:07:51,408 INFO L87 Difference]: Start difference. First operand 175 states and 239 transitions. cyclomatic complexity: 67 Second operand 7 states. [2019-01-01 22:07:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:52,470 INFO L93 Difference]: Finished difference Result 340 states and 463 transitions. [2019-01-01 22:07:52,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 22:07:52,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 463 transitions. [2019-01-01 22:07:52,474 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 268 [2019-01-01 22:07:52,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 463 transitions. [2019-01-01 22:07:52,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2019-01-01 22:07:52,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2019-01-01 22:07:52,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 463 transitions. [2019-01-01 22:07:52,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:52,480 INFO L705 BuchiCegarLoop]: Abstraction has 340 states and 463 transitions. [2019-01-01 22:07:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 463 transitions. [2019-01-01 22:07:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 282. [2019-01-01 22:07:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-01 22:07:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 383 transitions. [2019-01-01 22:07:52,501 INFO L728 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-01 22:07:52,501 INFO L608 BuchiCegarLoop]: Abstraction has 282 states and 383 transitions. [2019-01-01 22:07:52,501 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 22:07:52,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 282 states and 383 transitions. [2019-01-01 22:07:52,504 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 216 [2019-01-01 22:07:52,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:52,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:52,507 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:52,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:52,510 INFO L794 eck$LassoCheckResult]: Stem: 2530#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 2501#L40 assume !(0 == mp_add_~a3~0 % 256); 2497#L40-1 mp_add_~nb~0 := 4; 2498#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 2526#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 2508#L54 assume !(0 == mp_add_~b1~0 % 256); 2509#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2523#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2531#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2532#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2734#L65-2 assume !(1 == mp_add_~i~0 % 256); 2733#L66-1 assume !(2 == mp_add_~i~0 % 256); 2731#L67-1 assume !(3 == mp_add_~i~0 % 256); 2728#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2726#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; 2724#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2647#L80-1 assume !(1 == mp_add_~i~0 % 256); 2643#L81-1 assume !(2 == mp_add_~i~0 % 256); 2641#L82-1 assume !(3 == mp_add_~i~0 % 256); 2527#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2520#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2521#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2510#L65 [2019-01-01 22:07:52,511 INFO L796 eck$LassoCheckResult]: Loop: 2510#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2504#L65-2 assume !(1 == mp_add_~i~0 % 256); 2505#L66-1 assume !(2 == mp_add_~i~0 % 256); 2762#L67-1 assume !(3 == mp_add_~i~0 % 256); 2759#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2757#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 2745#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2740#L80-1 assume !(1 == mp_add_~i~0 % 256); 2519#L81-1 assume !(2 == mp_add_~i~0 % 256); 2495#L82-1 assume !(3 == mp_add_~i~0 % 256); 2496#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2536#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2537#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2510#L65 [2019-01-01 22:07:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:52,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1690793890, now seen corresponding path program 1 times [2019-01-01 22:07:52,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:52,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:52,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:52,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:52,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:53,034 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-01 22:07:53,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:53,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-01 22:07:53,036 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:53,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:53,036 INFO L82 PathProgramCache]: Analyzing trace with hash 360566763, now seen corresponding path program 4 times [2019-01-01 22:07:53,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:53,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:53,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:53,193 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-01-01 22:07:53,259 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:53,260 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:53,260 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:53,260 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:53,260 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:07:53,260 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:53,260 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:53,261 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:53,261 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Loop [2019-01-01 22:07:53,261 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:53,261 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:53,262 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-01 22:07:53,289 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-01 22:07:53,514 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2019-01-01 22:07:53,603 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:53,603 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-01 22:07:53,608 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:07:53,608 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-01 22:07:53,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:07:53,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:05,702 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-01-01 22:08:05,706 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:05,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:05,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:05,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:05,707 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:05,707 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:05,707 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:05,707 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:05,707 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration9_Loop [2019-01-01 22:08:05,709 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:05,709 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:05,712 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-01 22:08:05,753 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-01 22:08:05,900 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-01-01 22:08:06,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:06,111 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:06,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:06,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:06,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:06,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:06,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,121 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:08:06,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,123 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:06,124 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:06,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,183 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:06,186 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:06,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,197 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:08:06,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,198 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,198 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:06,199 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:06,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,205 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:06,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:06,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,213 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:08:06,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,214 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:06,215 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:06,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:06,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:06,233 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:06,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,235 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:08:06,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,240 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,241 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:06,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,241 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:06,244 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:06,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:06,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:06,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:06,260 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:06,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,263 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:08:06,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:06,264 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,264 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:06,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,268 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:06,271 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:06,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,287 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:06,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,287 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:06,293 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:06,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,299 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:08:06,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-01 22:08:06,300 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,300 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:06,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,301 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:06,308 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:06,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:06,325 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,325 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:06,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,325 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:06,333 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:06,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,337 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:08:06,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:06,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,342 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:06,344 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:06,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:06,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:06,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,359 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:06,362 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:06,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,371 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:08:06,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:06,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,373 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:06,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,373 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:06,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:06,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:06,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:06,410 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:06,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:06,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:06,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:06,410 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:06,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:06,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:06,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:08:06,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:08:06,432 INFO L87 Difference]: Start difference. First operand 282 states and 383 transitions. cyclomatic complexity: 106 Second operand 8 states. [2019-01-01 22:08:06,913 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2019-01-01 22:08:08,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:08,706 INFO L93 Difference]: Finished difference Result 485 states and 649 transitions. [2019-01-01 22:08:08,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 22:08:08,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 485 states and 649 transitions. [2019-01-01 22:08:08,712 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 373 [2019-01-01 22:08:08,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 485 states to 465 states and 625 transitions. [2019-01-01 22:08:08,716 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 465 [2019-01-01 22:08:08,716 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 465 [2019-01-01 22:08:08,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 465 states and 625 transitions. [2019-01-01 22:08:08,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:08,717 INFO L705 BuchiCegarLoop]: Abstraction has 465 states and 625 transitions. [2019-01-01 22:08:08,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states and 625 transitions. [2019-01-01 22:08:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 378. [2019-01-01 22:08:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-01 22:08:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 513 transitions. [2019-01-01 22:08:08,726 INFO L728 BuchiCegarLoop]: Abstraction has 378 states and 513 transitions. [2019-01-01 22:08:08,726 INFO L608 BuchiCegarLoop]: Abstraction has 378 states and 513 transitions. [2019-01-01 22:08:08,726 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-01 22:08:08,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 378 states and 513 transitions. [2019-01-01 22:08:08,728 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 292 [2019-01-01 22:08:08,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:08,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:08,729 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:08,729 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:08,730 INFO L794 eck$LassoCheckResult]: Stem: 3319#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 3290#L40 assume !(0 == mp_add_~a3~0 % 256); 3288#L40-1 mp_add_~nb~0 := 4; 3289#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3316#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3296#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 3297#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3506#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3503#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3500#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3498#L65-2 assume !(1 == mp_add_~i~0 % 256); 3496#L66-1 assume !(2 == mp_add_~i~0 % 256); 3493#L67-1 assume !(3 == mp_add_~i~0 % 256); 3472#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3469#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; 3467#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3465#L80-1 assume !(1 == mp_add_~i~0 % 256); 3462#L81-1 assume !(2 == mp_add_~i~0 % 256); 3459#L82-1 assume !(3 == mp_add_~i~0 % 256); 3457#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3454#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3453#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3451#L65 [2019-01-01 22:08:08,730 INFO L796 eck$LassoCheckResult]: Loop: 3451#L65 assume !(0 == mp_add_~i~0 % 256); 3449#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; 3448#L66-1 assume !(2 == mp_add_~i~0 % 256); 3447#L67-1 assume !(3 == mp_add_~i~0 % 256); 3445#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3446#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 3528#L76-1 assume !(0 == mp_add_~i~0 % 256); 3434#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 3435#L81-1 assume !(2 == mp_add_~i~0 % 256); 3461#L82-1 assume !(3 == mp_add_~i~0 % 256); 3458#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3455#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3456#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3451#L65 [2019-01-01 22:08:08,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:08,730 INFO L82 PathProgramCache]: Analyzing trace with hash -102445988, now seen corresponding path program 1 times [2019-01-01 22:08:08,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:08,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:08,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:09,584 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2019-01-01 22:08:09,805 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-01 22:08:09,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:09,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-01 22:08:09,806 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:09,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:09,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1233344371, now seen corresponding path program 1 times [2019-01-01 22:08:09,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:09,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:09,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:09,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:09,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:10,168 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 37 [2019-01-01 22:08:10,188 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:10,188 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:10,189 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:10,189 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:10,189 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:10,189 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:10,189 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:10,189 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:10,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration10_Loop [2019-01-01 22:08:10,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:10,190 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:10,191 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-01 22:08:10,202 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-01 22:08:10,381 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-01-01 22:08:10,550 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:10,551 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-01 22:08:10,555 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:10,556 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-01 22:08:10,594 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:10,594 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:11,981 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:11,984 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:11,984 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:11,984 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:11,984 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:11,984 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:11,984 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:11,984 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:11,984 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:11,984 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration10_Loop [2019-01-01 22:08:11,985 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:11,985 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:11,986 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-01 22:08:11,996 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-01 22:08:12,272 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:12,273 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:12,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:12,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:12,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:12,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:12,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:12,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,282 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:08:12,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,283 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:12,283 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:12,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,290 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:12,291 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:12,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,293 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:08:12,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:12,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,294 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,295 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,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-01 22:08:12,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,301 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,303 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:08:12,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-01 22:08:12,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,305 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,306 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,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-01 22:08:12,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:12,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,313 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,314 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,315 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:08:12,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-01 22:08:12,316 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,316 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,317 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:12,318 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:12,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,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-01 22:08:12,326 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,326 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,327 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:12,328 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:12,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,330 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:08:12,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-01 22:08:12,331 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,331 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:12,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,331 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,333 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,343 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:12,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,344 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,346 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,350 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:08:12,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,351 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,354 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,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-01 22:08:12,368 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,368 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,369 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:12,373 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:12,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,376 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:08:12,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,376 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,377 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,377 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:12,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,389 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:12,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,389 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:12,391 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:12,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,398 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:08:12,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:12,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,399 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,400 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:12,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:12,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:12,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:12,444 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:12,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:12,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:12,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:12,444 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:12,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:12,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:12,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:12,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 22:08:12,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 22:08:12,470 INFO L87 Difference]: Start difference. First operand 378 states and 513 transitions. cyclomatic complexity: 142 Second operand 9 states. [2019-01-01 22:08:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:14,088 INFO L93 Difference]: Finished difference Result 393 states and 520 transitions. [2019-01-01 22:08:14,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 22:08:14,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 393 states and 520 transitions. [2019-01-01 22:08:14,093 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 304 [2019-01-01 22:08:14,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 393 states to 390 states and 517 transitions. [2019-01-01 22:08:14,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2019-01-01 22:08:14,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2019-01-01 22:08:14,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 390 states and 517 transitions. [2019-01-01 22:08:14,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:14,100 INFO L705 BuchiCegarLoop]: Abstraction has 390 states and 517 transitions. [2019-01-01 22:08:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states and 517 transitions. [2019-01-01 22:08:14,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 360. [2019-01-01 22:08:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-01-01 22:08:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 483 transitions. [2019-01-01 22:08:14,110 INFO L728 BuchiCegarLoop]: Abstraction has 360 states and 483 transitions. [2019-01-01 22:08:14,110 INFO L608 BuchiCegarLoop]: Abstraction has 360 states and 483 transitions. [2019-01-01 22:08:14,110 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-01 22:08:14,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 360 states and 483 transitions. [2019-01-01 22:08:14,115 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 274 [2019-01-01 22:08:14,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:14,115 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:14,116 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:14,116 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:14,116 INFO L794 eck$LassoCheckResult]: Stem: 4110#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 4081#L40 assume !(0 == mp_add_~a3~0 % 256); 4078#L40-1 mp_add_~nb~0 := 4; 4079#L50 assume !(0 == mp_add_~b3~0 % 256); 4107#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4203#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4201#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4198#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4191#L65-2 assume !(1 == mp_add_~i~0 % 256); 4190#L66-1 assume !(2 == mp_add_~i~0 % 256); 4189#L67-1 assume !(3 == mp_add_~i~0 % 256); 4187#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4185#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4183#L71-2 assume !(1 == mp_add_~i~0 % 256); 4180#L72-1 assume !(2 == mp_add_~i~0 % 256); 4178#L73-1 assume !(3 == mp_add_~i~0 % 256); 4176#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; 4174#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4171#L80-1 assume !(1 == mp_add_~i~0 % 256); 4166#L81-1 assume !(2 == mp_add_~i~0 % 256); 4161#L82-1 assume !(3 == mp_add_~i~0 % 256); 4160#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4159#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4155#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4152#L65 [2019-01-01 22:08:14,121 INFO L796 eck$LassoCheckResult]: Loop: 4152#L65 assume !(0 == mp_add_~i~0 % 256); 4149#L65-2 assume !(1 == mp_add_~i~0 % 256); 4146#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; 4147#L67-1 assume !(3 == mp_add_~i~0 % 256); 4141#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4208#L71 assume !(0 == mp_add_~i~0 % 256); 4206#L71-2 assume !(1 == mp_add_~i~0 % 256); 4204#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; 4131#L73-1 assume !(3 == mp_add_~i~0 % 256); 4129#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 4192#L76-1 assume !(0 == mp_add_~i~0 % 256); 4167#L80-1 assume !(1 == mp_add_~i~0 % 256); 4162#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4124#L82-1 assume !(3 == mp_add_~i~0 % 256); 4120#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4158#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4154#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4152#L65 [2019-01-01 22:08:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 1 times [2019-01-01 22:08:14,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:14,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:14,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:14,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:14,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:14,174 INFO L82 PathProgramCache]: Analyzing trace with hash 880314143, now seen corresponding path program 1 times [2019-01-01 22:08:14,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:14,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:14,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:14,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:14,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:14,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1828196539, now seen corresponding path program 1 times [2019-01-01 22:08:14,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:14,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:14,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:14,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:14,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:14,502 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-01-01 22:08:14,644 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-01 22:08:14,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:14,645 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-01 22:08:14,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:14,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:14,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:14,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-01-01 22:08:15,629 WARN L181 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-01 22:08:15,694 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:15,694 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:15,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:15,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:15,694 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:15,695 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:15,695 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:15,695 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:15,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Loop [2019-01-01 22:08:15,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:15,695 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:15,697 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-01 22:08:15,710 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-01 22:08:16,072 WARN L181 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-01 22:08:16,278 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:16,278 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:16,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:16,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:16,348 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:16,348 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~b2~0=-49152, ULTIMATE.start_mp_add_~carry~0=0, ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~a2~0=16960, ULTIMATE.start_mp_add_~r2~0=64} Honda state: {ULTIMATE.start_mp_add_~b2~0=-49152, ULTIMATE.start_mp_add_~carry~0=0, ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~a2~0=16960, ULTIMATE.start_mp_add_~r2~0=64} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:08:16,390 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:16,391 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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-01 22:08:16,482 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:16,482 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:17,165 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:17,167 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:17,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:17,168 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:17,168 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:17,168 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:17,168 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:17,168 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:17,168 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:17,168 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add_1_true-unreach-call_true-no-overflow_true-termination.i_Iteration11_Loop [2019-01-01 22:08:17,168 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:17,168 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:17,170 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-01 22:08:17,227 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-01 22:08:17,414 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-01-01 22:08:17,522 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-01-01 22:08:17,843 WARN L181 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-01-01 22:08:18,034 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 22:08:18,036 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:18,036 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:18,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:18,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:18,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:18,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:18,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,055 INFO L497 LassoAnalysis]: Using template '2-nested'. [2019-01-01 22:08:18,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:18,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,061 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:18,064 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:18,064 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,069 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:18,070 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:18,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,080 INFO L497 LassoAnalysis]: Using template '3-nested'. [2019-01-01 22:08:18,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,085 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:18,086 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:18,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,094 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:18,095 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:18,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,103 INFO L497 LassoAnalysis]: Using template '4-nested'. [2019-01-01 22:08:18,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:18,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,106 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:18,107 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:18,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:18,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,115 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:18,116 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:18,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,130 INFO L497 LassoAnalysis]: Using template '2-phase'. [2019-01-01 22:08:18,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-01 22:08:18,134 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,134 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:18,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,135 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:18,136 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:18,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,144 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,144 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:18,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,145 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2019-01-01 22:08:18,146 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-01-01 22:08:18,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,160 INFO L497 LassoAnalysis]: Using template '3-phase'. [2019-01-01 22:08:18,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,161 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:18,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,164 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:18,174 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:18,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,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-01 22:08:18,180 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,184 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2019-01-01 22:08:18,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,184 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:18,190 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:18,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,207 INFO L497 LassoAnalysis]: Using template '4-phase'. [2019-01-01 22:08:18,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,208 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,208 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:18,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,215 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:18,222 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:18,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,227 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:18,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,227 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2019-01-01 22:08:18,237 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-01-01 22:08:18,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,253 INFO L497 LassoAnalysis]: Using template '2-lex'. [2019-01-01 22:08:18,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-01 22:08:18,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:18,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,255 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:18,263 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:18,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:18,273 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,273 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2019-01-01 22:08:18,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,279 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2019-01-01 22:08:18,283 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 22:08:18,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,293 INFO L497 LassoAnalysis]: Using template '3-lex'. [2019-01-01 22:08:18,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:18,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,294 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:18,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,301 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:18,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:18,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:18,321 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-01-01 22:08:18,321 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2019-01-01 22:08:18,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:18,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:18,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:18,328 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2019-01-01 22:08:18,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:08:18,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:18,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:18,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:08:18,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:08:18,350 INFO L87 Difference]: Start difference. First operand 360 states and 483 transitions. cyclomatic complexity: 130 Second operand 7 states. [2019-01-01 22:08:19,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:19,776 INFO L93 Difference]: Finished difference Result 476 states and 598 transitions. [2019-01-01 22:08:19,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:08:19,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 476 states and 598 transitions. [2019-01-01 22:08:19,782 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 389 [2019-01-01 22:08:19,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 476 states to 475 states and 597 transitions. [2019-01-01 22:08:19,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 475 [2019-01-01 22:08:19,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 475 [2019-01-01 22:08:19,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 475 states and 597 transitions. [2019-01-01 22:08:19,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:19,787 INFO L705 BuchiCegarLoop]: Abstraction has 475 states and 597 transitions. [2019-01-01 22:08:19,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states and 597 transitions. [2019-01-01 22:08:19,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 374. [2019-01-01 22:08:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-01-01 22:08:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 487 transitions. [2019-01-01 22:08:19,799 INFO L728 BuchiCegarLoop]: Abstraction has 374 states and 487 transitions. [2019-01-01 22:08:19,799 INFO L608 BuchiCegarLoop]: Abstraction has 374 states and 487 transitions. [2019-01-01 22:08:19,799 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-01 22:08:19,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 374 states and 487 transitions. [2019-01-01 22:08:19,804 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 288 [2019-01-01 22:08:19,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:19,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:19,806 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:19,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:19,807 INFO L794 eck$LassoCheckResult]: Stem: 5073#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 5049#L40 assume !(0 == mp_add_~a3~0 % 256); 5046#L40-1 mp_add_~nb~0 := 4; 5047#L50 assume !(0 == mp_add_~b3~0 % 256); 5069#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5179#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5178#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5177#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5176#L65-2 assume !(1 == mp_add_~i~0 % 256); 5175#L66-1 assume !(2 == mp_add_~i~0 % 256); 5174#L67-1 assume !(3 == mp_add_~i~0 % 256); 5173#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5172#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5171#L71-2 assume !(1 == mp_add_~i~0 % 256); 5170#L72-1 assume !(2 == mp_add_~i~0 % 256); 5169#L73-1 assume !(3 == mp_add_~i~0 % 256); 5168#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; 5167#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5166#L80-1 assume !(1 == mp_add_~i~0 % 256); 5165#L81-1 assume !(2 == mp_add_~i~0 % 256); 5164#L82-1 assume !(3 == mp_add_~i~0 % 256); 5163#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5162#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5161#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5147#L65 [2019-01-01 22:08:19,807 INFO L796 eck$LassoCheckResult]: Loop: 5147#L65 assume !(0 == mp_add_~i~0 % 256); 5160#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; 5111#L66-1 assume !(2 == mp_add_~i~0 % 256); 5145#L67-1 assume !(3 == mp_add_~i~0 % 256); 5144#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5143#L71 assume !(0 == mp_add_~i~0 % 256); 5142#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; 5141#L72-1 assume !(2 == mp_add_~i~0 % 256); 5140#L73-1 assume !(3 == mp_add_~i~0 % 256); 5139#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5138#L76-1 assume !(0 == mp_add_~i~0 % 256); 5137#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5122#L81-1 assume !(2 == mp_add_~i~0 % 256); 5087#L82-1 assume !(3 == mp_add_~i~0 % 256); 5083#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5118#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5115#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5116#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5096#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5097#L71-2 assume !(1 == mp_add_~i~0 % 256); 5155#L72-1 assume !(2 == mp_add_~i~0 % 256); 5154#L73-1 assume !(3 == mp_add_~i~0 % 256); 5153#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5152#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5124#L80-1 assume !(1 == mp_add_~i~0 % 256); 5151#L81-1 assume !(2 == mp_add_~i~0 % 256); 5150#L82-1 assume !(3 == mp_add_~i~0 % 256); 5149#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5148#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5146#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5147#L65 [2019-01-01 22:08:19,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:19,807 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 2 times [2019-01-01 22:08:19,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:19,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:19,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:19,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:19,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:19,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1269437617, now seen corresponding path program 1 times [2019-01-01 22:08:19,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:19,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:19,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:19,974 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-01 22:08:19,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:19,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:08:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:20,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:20,170 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-01 22:08:20,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:08:20,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-01 22:08:20,202 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:08:20,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:08:20,202 INFO L87 Difference]: Start difference. First operand 374 states and 487 transitions. cyclomatic complexity: 119 Second operand 6 states. [2019-01-01 22:08:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:21,728 INFO L93 Difference]: Finished difference Result 1082 states and 1400 transitions. [2019-01-01 22:08:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 22:08:21,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1082 states and 1400 transitions. [2019-01-01 22:08:21,735 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 961 [2019-01-01 22:08:21,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1082 states to 1080 states and 1398 transitions. [2019-01-01 22:08:21,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1080 [2019-01-01 22:08:21,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1080 [2019-01-01 22:08:21,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1080 states and 1398 transitions. [2019-01-01 22:08:21,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:21,745 INFO L705 BuchiCegarLoop]: Abstraction has 1080 states and 1398 transitions. [2019-01-01 22:08:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states and 1398 transitions. [2019-01-01 22:08:21,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 641. [2019-01-01 22:08:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-01-01 22:08:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 827 transitions. [2019-01-01 22:08:21,762 INFO L728 BuchiCegarLoop]: Abstraction has 641 states and 827 transitions. [2019-01-01 22:08:21,762 INFO L608 BuchiCegarLoop]: Abstraction has 641 states and 827 transitions. [2019-01-01 22:08:21,762 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-01 22:08:21,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 641 states and 827 transitions. [2019-01-01 22:08:21,769 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 555 [2019-01-01 22:08:21,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:21,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:21,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:21,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:21,771 INFO L794 eck$LassoCheckResult]: Stem: 6651#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 6624#L40 assume !(0 == mp_add_~a3~0 % 256); 6620#L40-1 mp_add_~nb~0 := 4; 6621#L50 assume !(0 == mp_add_~b3~0 % 256); 6648#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6988#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6987#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6662#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6663#L65-2 assume !(1 == mp_add_~i~0 % 256); 7037#L66-1 assume !(2 == mp_add_~i~0 % 256); 7036#L67-1 assume !(3 == mp_add_~i~0 % 256); 7035#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7034#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7033#L71-2 assume !(1 == mp_add_~i~0 % 256); 7032#L72-1 assume !(2 == mp_add_~i~0 % 256); 7031#L73-1 assume !(3 == mp_add_~i~0 % 256); 7030#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; 7029#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7028#L80-1 assume !(1 == mp_add_~i~0 % 256); 7027#L81-1 assume !(2 == mp_add_~i~0 % 256); 7026#L82-1 assume !(3 == mp_add_~i~0 % 256); 6858#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6859#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6665#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6631#L65 [2019-01-01 22:08:21,776 INFO L796 eck$LassoCheckResult]: Loop: 6631#L65 assume !(0 == mp_add_~i~0 % 256); 6632#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; 7003#L66-1 assume !(2 == mp_add_~i~0 % 256); 7038#L67-1 assume !(3 == mp_add_~i~0 % 256); 7022#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7020#L71 assume !(0 == mp_add_~i~0 % 256); 7018#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; 7016#L72-1 assume !(2 == mp_add_~i~0 % 256); 7014#L73-1 assume !(3 == mp_add_~i~0 % 256); 7012#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7011#L76-1 assume !(0 == mp_add_~i~0 % 256); 7008#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7007#L81-1 assume !(2 == mp_add_~i~0 % 256); 7006#L82-1 assume !(3 == mp_add_~i~0 % 256); 7005#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7001#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6996#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6995#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6914#L71 assume !(0 == mp_add_~i~0 % 256); 6915#L71-2 assume !(1 == mp_add_~i~0 % 256); 6908#L72-1 assume !(2 == mp_add_~i~0 % 256); 6904#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; 6902#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6900#L76-1 assume !(0 == mp_add_~i~0 % 256); 6897#L80-1 assume !(1 == mp_add_~i~0 % 256); 6888#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 6866#L82-1 assume !(3 == mp_add_~i~0 % 256); 6861#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6926#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6655#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6656#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6625#L65-2 assume !(1 == mp_add_~i~0 % 256); 6626#L66-1 assume !(2 == mp_add_~i~0 % 256); 6652#L67-1 assume !(3 == mp_add_~i~0 % 256); 7047#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7046#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7045#L71-2 assume !(1 == mp_add_~i~0 % 256); 7044#L72-1 assume !(2 == mp_add_~i~0 % 256); 7043#L73-1 assume !(3 == mp_add_~i~0 % 256); 7042#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7041#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7040#L80-1 assume !(1 == mp_add_~i~0 % 256); 7039#L81-1 assume !(2 == mp_add_~i~0 % 256); 6989#L82-1 assume !(3 == mp_add_~i~0 % 256); 6990#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6677#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6678#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6631#L65 [2019-01-01 22:08:21,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:21,776 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 3 times [2019-01-01 22:08:21,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:21,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:21,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:21,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:21,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1211392973, now seen corresponding path program 1 times [2019-01-01 22:08:21,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:21,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:21,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:21,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:21,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:21,872 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 22:08:21,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:21,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:08:21,873 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:21,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:21,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:21,873 INFO L87 Difference]: Start difference. First operand 641 states and 827 transitions. cyclomatic complexity: 196 Second operand 3 states. [2019-01-01 22:08:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:22,043 INFO L93 Difference]: Finished difference Result 675 states and 861 transitions. [2019-01-01 22:08:22,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:22,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 675 states and 861 transitions. [2019-01-01 22:08:22,048 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 589 [2019-01-01 22:08:22,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 675 states to 675 states and 861 transitions. [2019-01-01 22:08:22,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 675 [2019-01-01 22:08:22,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 675 [2019-01-01 22:08:22,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 861 transitions. [2019-01-01 22:08:22,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:22,057 INFO L705 BuchiCegarLoop]: Abstraction has 675 states and 861 transitions. [2019-01-01 22:08:22,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 861 transitions. [2019-01-01 22:08:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 658. [2019-01-01 22:08:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-01-01 22:08:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 844 transitions. [2019-01-01 22:08:22,071 INFO L728 BuchiCegarLoop]: Abstraction has 658 states and 844 transitions. [2019-01-01 22:08:22,071 INFO L608 BuchiCegarLoop]: Abstraction has 658 states and 844 transitions. [2019-01-01 22:08:22,071 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-01 22:08:22,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 658 states and 844 transitions. [2019-01-01 22:08:22,077 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 572 [2019-01-01 22:08:22,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:22,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:22,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:22,078 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:22,078 INFO L794 eck$LassoCheckResult]: Stem: 7974#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 7945#L40 assume !(0 == mp_add_~a3~0 % 256); 7941#L40-1 mp_add_~nb~0 := 4; 7942#L50 assume !(0 == mp_add_~b3~0 % 256); 7966#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7967#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8502#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8479#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8480#L65-2 assume !(1 == mp_add_~i~0 % 256); 7976#L66-1 assume !(2 == mp_add_~i~0 % 256); 7958#L67-1 assume !(3 == mp_add_~i~0 % 256); 7959#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8572#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8570#L71-2 assume !(1 == mp_add_~i~0 % 256); 8568#L72-1 assume !(2 == mp_add_~i~0 % 256); 8566#L73-1 assume !(3 == mp_add_~i~0 % 256); 8564#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; 8562#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8560#L80-1 assume !(1 == mp_add_~i~0 % 256); 8521#L81-1 assume !(2 == mp_add_~i~0 % 256); 8522#L82-1 assume !(3 == mp_add_~i~0 % 256); 8517#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8518#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8482#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8481#L65 [2019-01-01 22:08:22,083 INFO L796 eck$LassoCheckResult]: Loop: 8481#L65 assume !(0 == mp_add_~i~0 % 256); 8476#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; 8477#L66-1 assume !(2 == mp_add_~i~0 % 256); 8497#L67-1 assume !(3 == mp_add_~i~0 % 256); 8496#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8495#L71 assume !(0 == mp_add_~i~0 % 256); 8494#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; 8493#L72-1 assume !(2 == mp_add_~i~0 % 256); 8492#L73-1 assume !(3 == mp_add_~i~0 % 256); 8491#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8490#L76-1 assume !(0 == mp_add_~i~0 % 256); 8489#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8488#L81-1 assume !(2 == mp_add_~i~0 % 256); 8487#L82-1 assume !(3 == mp_add_~i~0 % 256); 8486#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8485#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8483#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8484#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8475#L71 assume !(0 == mp_add_~i~0 % 256); 8353#L71-2 assume !(1 == mp_add_~i~0 % 256); 8355#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; 8530#L73-1 assume !(3 == mp_add_~i~0 % 256); 8529#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8527#L76-1 assume !(0 == mp_add_~i~0 % 256); 8525#L80-1 assume !(1 == mp_add_~i~0 % 256); 8523#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8446#L82-1 assume !(3 == mp_add_~i~0 % 256); 8323#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8507#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8503#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8504#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7948#L65-2 assume !(1 == mp_add_~i~0 % 256); 7949#L66-1 assume !(2 == mp_add_~i~0 % 256); 8574#L67-1 assume !(3 == mp_add_~i~0 % 256); 8573#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8571#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8569#L71-2 assume !(1 == mp_add_~i~0 % 256); 8567#L72-1 assume !(2 == mp_add_~i~0 % 256); 8565#L73-1 assume !(3 == mp_add_~i~0 % 256); 8563#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8561#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 8547#L80-1 assume !(1 == mp_add_~i~0 % 256); 8548#L81-1 assume !(2 == mp_add_~i~0 % 256); 8519#L82-1 assume !(3 == mp_add_~i~0 % 256); 8520#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8500#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8501#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8481#L65 [2019-01-01 22:08:22,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:22,084 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 4 times [2019-01-01 22:08:22,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:22,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:22,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:22,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:22,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1222385903, now seen corresponding path program 1 times [2019-01-01 22:08:22,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:22,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:22,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:22,448 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-01 22:08:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 22:08:22,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:22,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:08:22,455 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:22,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:08:22,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:08:22,456 INFO L87 Difference]: Start difference. First operand 658 states and 844 transitions. cyclomatic complexity: 196 Second operand 4 states. [2019-01-01 22:08:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:22,881 INFO L93 Difference]: Finished difference Result 1056 states and 1355 transitions. [2019-01-01 22:08:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:08:22,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1056 states and 1355 transitions. [2019-01-01 22:08:22,900 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 969 [2019-01-01 22:08:22,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1056 states to 1055 states and 1353 transitions. [2019-01-01 22:08:22,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1055 [2019-01-01 22:08:22,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1055 [2019-01-01 22:08:22,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1055 states and 1353 transitions. [2019-01-01 22:08:22,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:22,912 INFO L705 BuchiCegarLoop]: Abstraction has 1055 states and 1353 transitions. [2019-01-01 22:08:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states and 1353 transitions. [2019-01-01 22:08:22,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 678. [2019-01-01 22:08:22,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 678 states. [2019-01-01 22:08:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 874 transitions. [2019-01-01 22:08:22,928 INFO L728 BuchiCegarLoop]: Abstraction has 678 states and 874 transitions. [2019-01-01 22:08:22,928 INFO L608 BuchiCegarLoop]: Abstraction has 678 states and 874 transitions. [2019-01-01 22:08:22,929 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-01 22:08:22,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 678 states and 874 transitions. [2019-01-01 22:08:22,934 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 592 [2019-01-01 22:08:22,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:22,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:22,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:22,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:22,938 INFO L794 eck$LassoCheckResult]: Stem: 9697#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 9668#L40 assume !(0 == mp_add_~a3~0 % 256); 9665#L40-1 mp_add_~nb~0 := 4; 9666#L50 assume !(0 == mp_add_~b3~0 % 256); 9691#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 10326#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10325#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10324#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10323#L65-2 assume !(1 == mp_add_~i~0 % 256); 10322#L66-1 assume !(2 == mp_add_~i~0 % 256); 10321#L67-1 assume !(3 == mp_add_~i~0 % 256); 10320#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10319#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 10318#L71-2 assume !(1 == mp_add_~i~0 % 256); 10317#L72-1 assume !(2 == mp_add_~i~0 % 256); 10316#L73-1 assume !(3 == mp_add_~i~0 % 256); 10315#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; 10314#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10313#L80-1 assume !(1 == mp_add_~i~0 % 256); 10312#L81-1 assume !(2 == mp_add_~i~0 % 256); 10311#L82-1 assume !(3 == mp_add_~i~0 % 256); 10310#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10309#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10308#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10207#L65 [2019-01-01 22:08:22,939 INFO L796 eck$LassoCheckResult]: Loop: 10207#L65 assume !(0 == mp_add_~i~0 % 256); 9671#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; 9672#L66-1 assume !(2 == mp_add_~i~0 % 256); 9700#L67-1 assume !(3 == mp_add_~i~0 % 256); 10307#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10305#L71 assume !(0 == mp_add_~i~0 % 256); 10304#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; 10303#L72-1 assume !(2 == mp_add_~i~0 % 256); 10302#L73-1 assume !(3 == mp_add_~i~0 % 256); 10300#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 10298#L76-1 assume !(0 == mp_add_~i~0 % 256); 10296#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 10286#L81-1 assume !(2 == mp_add_~i~0 % 256); 9663#L82-1 assume !(3 == mp_add_~i~0 % 256); 9664#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10189#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10187#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 10082#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10077#L71 assume !(0 == mp_add_~i~0 % 256); 10078#L71-2 assume !(1 == mp_add_~i~0 % 256); 10202#L72-1 assume !(2 == mp_add_~i~0 % 256); 10068#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; 10069#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 10064#L76-1 assume !(0 == mp_add_~i~0 % 256); 10065#L80-1 assume !(1 == mp_add_~i~0 % 256); 10061#L81-1 assume !(2 == mp_add_~i~0 % 256); 10056#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 10057#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10126#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10127#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10175#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10176#L65-2 assume !(1 == mp_add_~i~0 % 256); 10221#L66-1 assume !(2 == mp_add_~i~0 % 256); 10220#L67-1 assume !(3 == mp_add_~i~0 % 256); 10219#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10218#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 10217#L71-2 assume !(1 == mp_add_~i~0 % 256); 10216#L72-1 assume !(2 == mp_add_~i~0 % 256); 10215#L73-1 assume !(3 == mp_add_~i~0 % 256); 10214#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 10213#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10212#L80-1 assume !(1 == mp_add_~i~0 % 256); 10211#L81-1 assume !(2 == mp_add_~i~0 % 256); 10210#L82-1 assume !(3 == mp_add_~i~0 % 256); 10209#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10208#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10206#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10207#L65 [2019-01-01 22:08:22,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:22,939 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 5 times [2019-01-01 22:08:22,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:22,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:22,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:23,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1415240081, now seen corresponding path program 1 times [2019-01-01 22:08:23,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:23,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:23,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:23,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:23,546 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-01-01 22:08:23,963 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 13 [2019-01-01 22:08:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 22:08:24,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:24,025 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-01 22:08:24,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:24,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 30 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 22:08:24,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:24,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-01-01 22:08:24,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:24,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-01 22:08:24,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 22:08:24,149 INFO L87 Difference]: Start difference. First operand 678 states and 874 transitions. cyclomatic complexity: 206 Second operand 8 states. [2019-01-01 22:08:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:24,511 INFO L93 Difference]: Finished difference Result 940 states and 1161 transitions. [2019-01-01 22:08:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 22:08:24,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 940 states and 1161 transitions. [2019-01-01 22:08:24,526 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 850 [2019-01-01 22:08:24,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 940 states to 936 states and 1157 transitions. [2019-01-01 22:08:24,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 936 [2019-01-01 22:08:24,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 936 [2019-01-01 22:08:24,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 936 states and 1157 transitions. [2019-01-01 22:08:24,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:24,538 INFO L705 BuchiCegarLoop]: Abstraction has 936 states and 1157 transitions. [2019-01-01 22:08:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states and 1157 transitions. [2019-01-01 22:08:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 762. [2019-01-01 22:08:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 762 states. [2019-01-01 22:08:24,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 967 transitions. [2019-01-01 22:08:24,554 INFO L728 BuchiCegarLoop]: Abstraction has 762 states and 967 transitions. [2019-01-01 22:08:24,555 INFO L608 BuchiCegarLoop]: Abstraction has 762 states and 967 transitions. [2019-01-01 22:08:24,557 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2019-01-01 22:08:24,557 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 762 states and 967 transitions. [2019-01-01 22:08:24,563 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 676 [2019-01-01 22:08:24,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:24,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:24,564 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:24,564 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:24,564 INFO L794 eck$LassoCheckResult]: Stem: 11470#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 11439#L40 assume !(0 == mp_add_~a3~0 % 256); 11436#L40-1 mp_add_~nb~0 := 4; 11437#L50 assume !(0 == mp_add_~b3~0 % 256); 11465#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11828#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11827#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11826#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11825#L65-2 assume !(1 == mp_add_~i~0 % 256); 11824#L66-1 assume !(2 == mp_add_~i~0 % 256); 11823#L67-1 assume !(3 == mp_add_~i~0 % 256); 11822#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11821#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11820#L71-2 assume !(1 == mp_add_~i~0 % 256); 11819#L72-1 assume !(2 == mp_add_~i~0 % 256); 11818#L73-1 assume !(3 == mp_add_~i~0 % 256); 11817#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; 11816#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11815#L80-1 assume !(1 == mp_add_~i~0 % 256); 11814#L81-1 assume !(2 == mp_add_~i~0 % 256); 11813#L82-1 assume !(3 == mp_add_~i~0 % 256); 11812#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11811#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11810#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11788#L65 [2019-01-01 22:08:24,570 INFO L796 eck$LassoCheckResult]: Loop: 11788#L65 assume !(0 == mp_add_~i~0 % 256); 11809#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; 11686#L66-1 assume !(2 == mp_add_~i~0 % 256); 11808#L67-1 assume !(3 == mp_add_~i~0 % 256); 11807#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11806#L71 assume !(0 == mp_add_~i~0 % 256); 11805#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; 11783#L72-1 assume !(2 == mp_add_~i~0 % 256); 11782#L73-1 assume !(3 == mp_add_~i~0 % 256); 11780#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11778#L76-1 assume !(0 == mp_add_~i~0 % 256); 11776#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11774#L81-1 assume !(2 == mp_add_~i~0 % 256); 11773#L82-1 assume !(3 == mp_add_~i~0 % 256); 11767#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11765#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11762#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 11755#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11752#L71 assume !(0 == mp_add_~i~0 % 256); 11749#L71-2 assume !(1 == mp_add_~i~0 % 256); 11742#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; 11740#L73-1 assume !(3 == mp_add_~i~0 % 256); 11738#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11736#L76-1 assume !(0 == mp_add_~i~0 % 256); 11734#L80-1 assume !(1 == mp_add_~i~0 % 256); 11731#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 11698#L82-1 assume !(3 == mp_add_~i~0 % 256); 11716#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11713#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11714#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 11803#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11746#L71 assume !(0 == mp_add_~i~0 % 256); 11666#L71-2 assume !(1 == mp_add_~i~0 % 256); 11668#L72-1 assume !(2 == mp_add_~i~0 % 256); 11660#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; 11661#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11656#L76-1 assume !(0 == mp_add_~i~0 % 256); 11657#L80-1 assume !(1 == mp_add_~i~0 % 256); 11652#L81-1 assume !(2 == mp_add_~i~0 % 256); 11653#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 11694#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11693#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11691#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11689#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 11690#L65-2 assume !(1 == mp_add_~i~0 % 256); 11802#L66-1 assume !(2 == mp_add_~i~0 % 256); 11801#L67-1 assume !(3 == mp_add_~i~0 % 256); 11800#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11799#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 11798#L71-2 assume !(1 == mp_add_~i~0 % 256); 11797#L72-1 assume !(2 == mp_add_~i~0 % 256); 11796#L73-1 assume !(3 == mp_add_~i~0 % 256); 11795#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 11794#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 11793#L80-1 assume !(1 == mp_add_~i~0 % 256); 11792#L81-1 assume !(2 == mp_add_~i~0 % 256); 11791#L82-1 assume !(3 == mp_add_~i~0 % 256); 11790#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11789#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11787#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11788#L65 [2019-01-01 22:08:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 6 times [2019-01-01 22:08:24,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:24,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:24,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:24,603 INFO L82 PathProgramCache]: Analyzing trace with hash 2010108989, now seen corresponding path program 1 times [2019-01-01 22:08:24,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:24,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:24,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:24,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:25,151 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2019-01-01 22:08:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 22:08:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:25,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 22:08:25,168 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:25,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:08:25,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:08:25,168 INFO L87 Difference]: Start difference. First operand 762 states and 967 transitions. cyclomatic complexity: 214 Second operand 5 states. [2019-01-01 22:08:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:25,546 INFO L93 Difference]: Finished difference Result 1214 states and 1542 transitions. [2019-01-01 22:08:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:08:25,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1214 states and 1542 transitions. [2019-01-01 22:08:25,557 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1100 [2019-01-01 22:08:25,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1214 states to 1205 states and 1532 transitions. [2019-01-01 22:08:25,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1205 [2019-01-01 22:08:25,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1205 [2019-01-01 22:08:25,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1205 states and 1532 transitions. [2019-01-01 22:08:25,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:25,571 INFO L705 BuchiCegarLoop]: Abstraction has 1205 states and 1532 transitions. [2019-01-01 22:08:25,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states and 1532 transitions. [2019-01-01 22:08:25,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 797. [2019-01-01 22:08:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-01-01 22:08:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1010 transitions. [2019-01-01 22:08:25,588 INFO L728 BuchiCegarLoop]: Abstraction has 797 states and 1010 transitions. [2019-01-01 22:08:25,588 INFO L608 BuchiCegarLoop]: Abstraction has 797 states and 1010 transitions. [2019-01-01 22:08:25,589 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2019-01-01 22:08:25,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 797 states and 1010 transitions. [2019-01-01 22:08:25,597 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 702 [2019-01-01 22:08:25,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:25,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:25,600 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:25,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:25,601 INFO L794 eck$LassoCheckResult]: Stem: 13456#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 13431#L40 assume !(0 == mp_add_~a3~0 % 256); 13427#L40-1 mp_add_~nb~0 := 4; 13428#L50 assume !(0 == mp_add_~b3~0 % 256); 13448#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 13445#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 13446#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14042#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14213#L65-2 assume !(1 == mp_add_~i~0 % 256); 13457#L66-1 assume !(2 == mp_add_~i~0 % 256); 13441#L67-1 assume !(3 == mp_add_~i~0 % 256); 13442#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 13426#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 13422#L71-2 assume !(1 == mp_add_~i~0 % 256); 13423#L72-1 assume !(2 == mp_add_~i~0 % 256); 13449#L73-1 assume !(3 == mp_add_~i~0 % 256); 14205#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; 14204#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 14203#L80-1 assume !(1 == mp_add_~i~0 % 256); 14202#L81-1 assume !(2 == mp_add_~i~0 % 256); 14201#L82-1 assume !(3 == mp_add_~i~0 % 256); 13450#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 13451#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14214#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 13438#L65 [2019-01-01 22:08:25,601 INFO L796 eck$LassoCheckResult]: Loop: 13438#L65 assume !(0 == mp_add_~i~0 % 256); 13432#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; 13433#L66-1 assume !(2 == mp_add_~i~0 % 256); 14195#L67-1 assume !(3 == mp_add_~i~0 % 256); 14193#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14191#L71 assume !(0 == mp_add_~i~0 % 256); 14189#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; 14187#L72-1 assume !(2 == mp_add_~i~0 % 256); 14186#L73-1 assume !(3 == mp_add_~i~0 % 256); 14184#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14181#L76-1 assume !(0 == mp_add_~i~0 % 256); 14179#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 14177#L81-1 assume !(2 == mp_add_~i~0 % 256); 14173#L82-1 assume !(3 == mp_add_~i~0 % 256); 14171#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14169#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14166#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 13455#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14160#L71 assume !(0 == mp_add_~i~0 % 256); 14157#L71-2 assume !(1 == mp_add_~i~0 % 256); 14154#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; 14153#L73-1 assume !(3 == mp_add_~i~0 % 256); 14152#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14151#L76-1 assume !(0 == mp_add_~i~0 % 256); 14150#L80-1 assume !(1 == mp_add_~i~0 % 256); 14147#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 14048#L82-1 assume !(3 == mp_add_~i~0 % 256); 14146#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14145#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14143#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14144#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14108#L71 assume !(0 == mp_add_~i~0 % 256); 14039#L71-2 assume !(1 == mp_add_~i~0 % 256); 14041#L72-1 assume !(2 == mp_add_~i~0 % 256); 13886#L73-1 assume !(3 == mp_add_~i~0 % 256); 14124#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 14123#L76-1 assume !(0 == mp_add_~i~0 % 256); 14122#L80-1 assume !(1 == mp_add_~i~0 % 256); 14121#L81-1 assume !(2 == mp_add_~i~0 % 256); 14120#L82-1 assume !(3 == mp_add_~i~0 % 256); 14119#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14118#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14114#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14115#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14212#L65-2 assume !(1 == mp_add_~i~0 % 256); 14211#L66-1 assume !(2 == mp_add_~i~0 % 256); 14210#L67-1 assume !(3 == mp_add_~i~0 % 256); 14209#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14208#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 14207#L71-2 assume !(1 == mp_add_~i~0 % 256); 14206#L72-1 assume !(2 == mp_add_~i~0 % 256); 13429#L73-1 assume !(3 == mp_add_~i~0 % 256); 13430#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 13434#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 13418#L80-1 assume !(1 == mp_add_~i~0 % 256); 13419#L81-1 assume !(2 == mp_add_~i~0 % 256); 13424#L82-1 assume !(3 == mp_add_~i~0 % 256); 13425#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14200#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14199#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 13438#L65 [2019-01-01 22:08:25,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:25,602 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 7 times [2019-01-01 22:08:25,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:25,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:25,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:25,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:25,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:25,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:25,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1800116867, now seen corresponding path program 2 times [2019-01-01 22:08:25,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:25,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:25,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:25,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:25,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:26,014 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 69 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:08:26,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:26,014 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-01 22:08:26,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:08:26,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:08:26,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:08:26,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 69 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 22:08:26,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:26,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-01-01 22:08:26,209 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:26,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:08:26,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:08:26,209 INFO L87 Difference]: Start difference. First operand 797 states and 1010 transitions. cyclomatic complexity: 222 Second operand 10 states. [2019-01-01 22:08:26,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:26,838 INFO L93 Difference]: Finished difference Result 1136 states and 1385 transitions. [2019-01-01 22:08:26,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-01 22:08:26,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1136 states and 1385 transitions. [2019-01-01 22:08:26,846 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 1017 [2019-01-01 22:08:26,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1136 states to 1124 states and 1373 transitions. [2019-01-01 22:08:26,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1124 [2019-01-01 22:08:26,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1124 [2019-01-01 22:08:26,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1124 states and 1373 transitions. [2019-01-01 22:08:26,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:26,858 INFO L705 BuchiCegarLoop]: Abstraction has 1124 states and 1373 transitions. [2019-01-01 22:08:26,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states and 1373 transitions. [2019-01-01 22:08:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 794. [2019-01-01 22:08:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2019-01-01 22:08:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1002 transitions. [2019-01-01 22:08:26,876 INFO L728 BuchiCegarLoop]: Abstraction has 794 states and 1002 transitions. [2019-01-01 22:08:26,877 INFO L608 BuchiCegarLoop]: Abstraction has 794 states and 1002 transitions. [2019-01-01 22:08:26,877 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2019-01-01 22:08:26,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 794 states and 1002 transitions. [2019-01-01 22:08:26,883 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 699 [2019-01-01 22:08:26,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:26,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:26,885 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:26,885 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:26,885 INFO L794 eck$LassoCheckResult]: Stem: 15587#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 15561#L40 assume !(0 == mp_add_~a3~0 % 256); 15558#L40-1 mp_add_~nb~0 := 4; 15559#L50 assume !(0 == mp_add_~b3~0 % 256); 15582#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 15583#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16221#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16217#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16218#L65-2 assume !(1 == mp_add_~i~0 % 256); 16211#L66-1 assume !(2 == mp_add_~i~0 % 256); 16212#L67-1 assume !(3 == mp_add_~i~0 % 256); 16207#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16208#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16203#L71-2 assume !(1 == mp_add_~i~0 % 256); 16204#L72-1 assume !(2 == mp_add_~i~0 % 256); 16199#L73-1 assume !(3 == mp_add_~i~0 % 256); 16200#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; 16195#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 16196#L80-1 assume !(1 == mp_add_~i~0 % 256); 16191#L81-1 assume !(2 == mp_add_~i~0 % 256); 16192#L82-1 assume !(3 == mp_add_~i~0 % 256); 16187#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16188#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16183#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16182#L65 [2019-01-01 22:08:26,885 INFO L796 eck$LassoCheckResult]: Loop: 16182#L65 assume !(0 == mp_add_~i~0 % 256); 16178#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; 16179#L66-1 assume !(2 == mp_add_~i~0 % 256); 16343#L67-1 assume !(3 == mp_add_~i~0 % 256); 16342#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16341#L71 assume !(0 == mp_add_~i~0 % 256); 16340#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; 16339#L72-1 assume !(2 == mp_add_~i~0 % 256); 16338#L73-1 assume !(3 == mp_add_~i~0 % 256); 15581#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15566#L76-1 assume !(0 == mp_add_~i~0 % 256); 15550#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15551#L81-1 assume !(2 == mp_add_~i~0 % 256); 15556#L82-1 assume !(3 == mp_add_~i~0 % 256); 15557#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16317#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16316#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15574#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15560#L71 assume !(0 == mp_add_~i~0 % 256); 15554#L71-2 assume !(1 == mp_add_~i~0 % 256); 15555#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; 15562#L73-1 assume !(3 == mp_add_~i~0 % 256); 15563#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16328#L76-1 assume !(0 == mp_add_~i~0 % 256); 16327#L80-1 assume !(1 == mp_add_~i~0 % 256); 16325#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15957#L82-1 assume !(3 == mp_add_~i~0 % 256); 16324#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16322#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16319#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16244#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16177#L71 assume !(0 == mp_add_~i~0 % 256); 16176#L71-2 assume !(1 == mp_add_~i~0 % 256); 16175#L72-1 assume !(2 == mp_add_~i~0 % 256); 16174#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; 16173#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16172#L76-1 assume !(0 == mp_add_~i~0 % 256); 16171#L80-1 assume !(1 == mp_add_~i~0 % 256); 16170#L81-1 assume !(2 == mp_add_~i~0 % 256); 16169#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 15785#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15786#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16219#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16220#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16308#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15903#L76-1 assume !(0 == mp_add_~i~0 % 256); 15904#L80-1 assume !(1 == mp_add_~i~0 % 256); 15956#L81-1 assume !(2 == mp_add_~i~0 % 256); 15958#L82-1 assume !(3 == mp_add_~i~0 % 256); 15775#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15776#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16224#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16225#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16213#L65-2 assume !(1 == mp_add_~i~0 % 256); 16214#L66-1 assume !(2 == mp_add_~i~0 % 256); 16209#L67-1 assume !(3 == mp_add_~i~0 % 256); 16210#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16205#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16206#L71-2 assume !(1 == mp_add_~i~0 % 256); 16201#L72-1 assume !(2 == mp_add_~i~0 % 256); 16202#L73-1 assume !(3 == mp_add_~i~0 % 256); 16197#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16198#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 16193#L80-1 assume !(1 == mp_add_~i~0 % 256); 16194#L81-1 assume !(2 == mp_add_~i~0 % 256); 16189#L82-1 assume !(3 == mp_add_~i~0 % 256); 16190#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16185#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16186#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16182#L65 [2019-01-01 22:08:26,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 8 times [2019-01-01 22:08:26,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:26,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:26,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:26,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1555685409, now seen corresponding path program 1 times [2019-01-01 22:08:26,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:26,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 96 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-01 22:08:27,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:27,085 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-01 22:08:27,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:27,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 93 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 22:08:27,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:27,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 22:08:27,249 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:27,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:08:27,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:08:27,249 INFO L87 Difference]: Start difference. First operand 794 states and 1002 transitions. cyclomatic complexity: 217 Second operand 6 states. [2019-01-01 22:08:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:27,493 INFO L93 Difference]: Finished difference Result 1411 states and 1704 transitions. [2019-01-01 22:08:27,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:08:27,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1411 states and 1704 transitions. [2019-01-01 22:08:27,501 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1189 [2019-01-01 22:08:27,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1411 states to 1388 states and 1679 transitions. [2019-01-01 22:08:27,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1388 [2019-01-01 22:08:27,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1388 [2019-01-01 22:08:27,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1388 states and 1679 transitions. [2019-01-01 22:08:27,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:27,513 INFO L705 BuchiCegarLoop]: Abstraction has 1388 states and 1679 transitions. [2019-01-01 22:08:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states and 1679 transitions. [2019-01-01 22:08:27,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 985. [2019-01-01 22:08:27,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 985 states. [2019-01-01 22:08:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1253 transitions. [2019-01-01 22:08:27,535 INFO L728 BuchiCegarLoop]: Abstraction has 985 states and 1253 transitions. [2019-01-01 22:08:27,535 INFO L608 BuchiCegarLoop]: Abstraction has 985 states and 1253 transitions. [2019-01-01 22:08:27,536 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2019-01-01 22:08:27,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 985 states and 1253 transitions. [2019-01-01 22:08:27,542 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 867 [2019-01-01 22:08:27,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:27,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:27,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:27,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:27,544 INFO L794 eck$LassoCheckResult]: Stem: 18016#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 17986#L40 assume !(0 == mp_add_~a3~0 % 256); 17982#L40-1 mp_add_~nb~0 := 4; 17983#L50 assume !(0 == mp_add_~b3~0 % 256); 18009#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 18010#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18777#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18778#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 17989#L65-2 assume !(1 == mp_add_~i~0 % 256); 17990#L66-1 assume !(2 == mp_add_~i~0 % 256); 18911#L67-1 assume !(3 == mp_add_~i~0 % 256); 18910#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18909#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18908#L71-2 assume !(1 == mp_add_~i~0 % 256); 18907#L72-1 assume !(2 == mp_add_~i~0 % 256); 18906#L73-1 assume !(3 == mp_add_~i~0 % 256); 18905#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; 18903#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 18901#L80-1 assume !(1 == mp_add_~i~0 % 256); 18891#L81-1 assume !(2 == mp_add_~i~0 % 256); 18892#L82-1 assume !(3 == mp_add_~i~0 % 256); 18886#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18887#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18776#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18775#L65 [2019-01-01 22:08:27,544 INFO L796 eck$LassoCheckResult]: Loop: 18775#L65 assume !(0 == mp_add_~i~0 % 256); 18774#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; 18757#L66-1 assume !(2 == mp_add_~i~0 % 256); 18773#L67-1 assume !(3 == mp_add_~i~0 % 256); 18772#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18771#L71 assume !(0 == mp_add_~i~0 % 256); 18770#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; 18769#L72-1 assume !(2 == mp_add_~i~0 % 256); 18768#L73-1 assume !(3 == mp_add_~i~0 % 256); 18767#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 18766#L76-1 assume !(0 == mp_add_~i~0 % 256); 18765#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 18764#L81-1 assume !(2 == mp_add_~i~0 % 256); 18763#L82-1 assume !(3 == mp_add_~i~0 % 256); 18762#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18759#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18754#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18755#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18880#L71 assume !(0 == mp_add_~i~0 % 256); 18879#L71-2 assume !(1 == mp_add_~i~0 % 256); 18878#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; 18877#L73-1 assume !(3 == mp_add_~i~0 % 256); 18876#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 18875#L76-1 assume !(0 == mp_add_~i~0 % 256); 18874#L80-1 assume !(1 == mp_add_~i~0 % 256); 18873#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 18489#L82-1 assume !(3 == mp_add_~i~0 % 256); 18790#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18782#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18783#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18788#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18868#L71 assume !(0 == mp_add_~i~0 % 256); 18866#L71-2 assume !(1 == mp_add_~i~0 % 256); 18864#L72-1 assume !(2 == mp_add_~i~0 % 256); 18810#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; 18808#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; 18809#L76-1 assume !(0 == mp_add_~i~0 % 256); 18802#L80-1 assume !(1 == mp_add_~i~0 % 256); 18803#L81-1 assume !(2 == mp_add_~i~0 % 256); 18794#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 18791#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18789#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18786#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18787#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18006#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 18007#L76-1 assume !(0 == mp_add_~i~0 % 256); 18502#L80-1 assume !(1 == mp_add_~i~0 % 256); 18488#L81-1 assume !(2 == mp_add_~i~0 % 256); 18490#L82-1 assume !(3 == mp_add_~i~0 % 256); 18262#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18263#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18854#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18784#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18785#L65-2 assume !(1 == mp_add_~i~0 % 256); 18017#L66-1 assume !(2 == mp_add_~i~0 % 256); 17999#L67-1 assume !(3 == mp_add_~i~0 % 256); 18000#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18916#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18915#L71-2 assume !(1 == mp_add_~i~0 % 256); 18914#L72-1 assume !(2 == mp_add_~i~0 % 256); 18913#L73-1 assume !(3 == mp_add_~i~0 % 256); 18912#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 18904#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 18902#L80-1 assume !(1 == mp_add_~i~0 % 256); 18900#L81-1 assume !(2 == mp_add_~i~0 % 256); 18889#L82-1 assume !(3 == mp_add_~i~0 % 256); 18890#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18851#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18852#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18775#L65 [2019-01-01 22:08:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 9 times [2019-01-01 22:08:27,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash -495298589, now seen corresponding path program 1 times [2019-01-01 22:08:27,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:27,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:27,971 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 87 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 22:08:27,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:27,972 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-01 22:08:27,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:28,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 88 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 22:08:28,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:28,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-01 22:08:28,476 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:28,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 22:08:28,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-01-01 22:08:28,476 INFO L87 Difference]: Start difference. First operand 985 states and 1253 transitions. cyclomatic complexity: 277 Second operand 9 states. [2019-01-01 22:08:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:30,565 INFO L93 Difference]: Finished difference Result 3010 states and 3594 transitions. [2019-01-01 22:08:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-01 22:08:30,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3010 states and 3594 transitions. [2019-01-01 22:08:30,580 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2382 [2019-01-01 22:08:30,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3010 states to 2984 states and 3566 transitions. [2019-01-01 22:08:30,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2984 [2019-01-01 22:08:30,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2984 [2019-01-01 22:08:30,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2984 states and 3566 transitions. [2019-01-01 22:08:30,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:30,599 INFO L705 BuchiCegarLoop]: Abstraction has 2984 states and 3566 transitions. [2019-01-01 22:08:30,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2984 states and 3566 transitions. [2019-01-01 22:08:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2984 to 1648. [2019-01-01 22:08:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-01-01 22:08:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2064 transitions. [2019-01-01 22:08:30,634 INFO L728 BuchiCegarLoop]: Abstraction has 1648 states and 2064 transitions. [2019-01-01 22:08:30,634 INFO L608 BuchiCegarLoop]: Abstraction has 1648 states and 2064 transitions. [2019-01-01 22:08:30,634 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2019-01-01 22:08:30,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1648 states and 2064 transitions. [2019-01-01 22:08:30,642 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1381 [2019-01-01 22:08:30,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:30,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:30,643 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:30,643 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:30,643 INFO L794 eck$LassoCheckResult]: Stem: 22319#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 22289#L40 assume !(0 == mp_add_~a3~0 % 256); 22285#L40-1 mp_add_~nb~0 := 4; 22286#L50 assume !(0 == mp_add_~b3~0 % 256); 22310#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22311#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23728#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23727#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 23726#L65-2 assume !(1 == mp_add_~i~0 % 256); 23725#L66-1 assume !(2 == mp_add_~i~0 % 256); 22300#L67-1 assume !(3 == mp_add_~i~0 % 256); 22301#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23805#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 23804#L71-2 assume !(1 == mp_add_~i~0 % 256); 23803#L72-1 assume !(2 == mp_add_~i~0 % 256); 23802#L73-1 assume !(3 == mp_add_~i~0 % 256); 23801#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; 23800#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 23799#L80-1 assume !(1 == mp_add_~i~0 % 256); 23798#L81-1 assume !(2 == mp_add_~i~0 % 256); 23797#L82-1 assume !(3 == mp_add_~i~0 % 256); 23796#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23767#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23757#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23704#L65 [2019-01-01 22:08:30,649 INFO L796 eck$LassoCheckResult]: Loop: 23704#L65 assume !(0 == mp_add_~i~0 % 256); 22290#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; 22291#L66-1 assume !(2 == mp_add_~i~0 % 256); 22320#L67-1 assume !(3 == mp_add_~i~0 % 256); 23702#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23701#L71 assume !(0 == mp_add_~i~0 % 256); 23699#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; 23700#L72-1 assume !(2 == mp_add_~i~0 % 256); 23695#L73-1 assume !(3 == mp_add_~i~0 % 256); 23696#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; 23761#L76-1 assume !(0 == mp_add_~i~0 % 256); 23689#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 23690#L81-1 assume !(2 == mp_add_~i~0 % 256); 23686#L82-1 assume !(3 == mp_add_~i~0 % 256); 23685#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23683#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23684#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 23680#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23679#L71 assume !(0 == mp_add_~i~0 % 256); 23594#L71-2 assume !(1 == mp_add_~i~0 % 256); 23568#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; 23567#L73-1 assume !(3 == mp_add_~i~0 % 256); 23565#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; 23564#L76-1 assume !(0 == mp_add_~i~0 % 256); 23563#L80-1 assume !(1 == mp_add_~i~0 % 256); 23561#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 23535#L82-1 assume !(3 == mp_add_~i~0 % 256); 23581#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23580#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23524#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 23520#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23519#L71 assume !(0 == mp_add_~i~0 % 256); 23518#L71-2 assume !(1 == mp_add_~i~0 % 256); 23517#L72-1 assume !(2 == mp_add_~i~0 % 256); 23449#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; 23450#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; 23444#L76-1 assume !(0 == mp_add_~i~0 % 256); 23445#L80-1 assume !(1 == mp_add_~i~0 % 256); 23435#L81-1 assume !(2 == mp_add_~i~0 % 256); 23436#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 23410#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23426#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23427#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 23533#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23419#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; 23421#L76-1 assume !(0 == mp_add_~i~0 % 256); 23415#L80-1 assume !(1 == mp_add_~i~0 % 256); 23416#L81-1 assume !(2 == mp_add_~i~0 % 256); 23409#L82-1 assume !(3 == mp_add_~i~0 % 256); 23411#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23403#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23404#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 23542#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23544#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23649#L76-1 assume !(0 == mp_add_~i~0 % 256); 23748#L80-1 assume !(1 == mp_add_~i~0 % 256); 22970#L81-1 assume !(2 == mp_add_~i~0 % 256); 22972#L82-1 assume !(3 == mp_add_~i~0 % 256); 22659#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22660#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23737#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23738#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 23732#L65-2 assume !(1 == mp_add_~i~0 % 256); 23730#L66-1 assume !(2 == mp_add_~i~0 % 256); 23719#L67-1 assume !(3 == mp_add_~i~0 % 256); 23718#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23717#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 23716#L71-2 assume !(1 == mp_add_~i~0 % 256); 23715#L72-1 assume !(2 == mp_add_~i~0 % 256); 23714#L73-1 assume !(3 == mp_add_~i~0 % 256); 23712#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23713#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 23859#L80-1 assume !(1 == mp_add_~i~0 % 256); 23858#L81-1 assume !(2 == mp_add_~i~0 % 256); 23857#L82-1 assume !(3 == mp_add_~i~0 % 256); 23856#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23855#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23854#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23704#L65 [2019-01-01 22:08:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 10 times [2019-01-01 22:08:30,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:30,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:30,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:30,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:30,677 INFO L82 PathProgramCache]: Analyzing trace with hash -293418435, now seen corresponding path program 2 times [2019-01-01 22:08:30,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:30,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:30,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-01 22:08:30,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:30,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:08:30,808 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:30,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:08:30,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:08:30,808 INFO L87 Difference]: Start difference. First operand 1648 states and 2064 transitions. cyclomatic complexity: 427 Second operand 4 states. [2019-01-01 22:08:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:30,875 INFO L93 Difference]: Finished difference Result 1151 states and 1321 transitions. [2019-01-01 22:08:30,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:08:30,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1151 states and 1321 transitions. [2019-01-01 22:08:30,881 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 930 [2019-01-01 22:08:30,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1151 states to 1151 states and 1321 transitions. [2019-01-01 22:08:30,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1151 [2019-01-01 22:08:30,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1151 [2019-01-01 22:08:30,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1151 states and 1321 transitions. [2019-01-01 22:08:30,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:30,888 INFO L705 BuchiCegarLoop]: Abstraction has 1151 states and 1321 transitions. [2019-01-01 22:08:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states and 1321 transitions. [2019-01-01 22:08:30,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 988. [2019-01-01 22:08:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-01-01 22:08:30,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1143 transitions. [2019-01-01 22:08:30,904 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1143 transitions. [2019-01-01 22:08:30,904 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1143 transitions. [2019-01-01 22:08:30,904 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2019-01-01 22:08:30,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1143 transitions. [2019-01-01 22:08:30,909 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 799 [2019-01-01 22:08:30,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:30,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:30,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:30,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:30,913 INFO L794 eck$LassoCheckResult]: Stem: 25119#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 25095#L40 assume !(0 == mp_add_~a3~0 % 256); 25091#L40-1 mp_add_~nb~0 := 4; 25092#L50 assume !(0 == mp_add_~b3~0 % 256); 25112#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25113#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25886#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25883#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25881#L65-2 assume !(1 == mp_add_~i~0 % 256); 25879#L66-1 assume !(2 == mp_add_~i~0 % 256); 25105#L67-1 assume !(3 == mp_add_~i~0 % 256); 25106#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26016#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 26015#L71-2 assume !(1 == mp_add_~i~0 % 256); 26014#L72-1 assume !(2 == mp_add_~i~0 % 256); 26013#L73-1 assume !(3 == mp_add_~i~0 % 256); 26012#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; 26011#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 26009#L80-1 assume !(1 == mp_add_~i~0 % 256); 26008#L81-1 assume !(2 == mp_add_~i~0 % 256); 26007#L82-1 assume !(3 == mp_add_~i~0 % 256); 26006#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26005#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25915#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25862#L65 [2019-01-01 22:08:30,913 INFO L796 eck$LassoCheckResult]: Loop: 25862#L65 assume !(0 == mp_add_~i~0 % 256); 25865#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; 25863#L66-1 assume !(2 == mp_add_~i~0 % 256); 25859#L67-1 assume !(3 == mp_add_~i~0 % 256); 25860#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25982#L71 assume !(0 == mp_add_~i~0 % 256); 25981#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; 25980#L72-1 assume !(2 == mp_add_~i~0 % 256); 25979#L73-1 assume !(3 == mp_add_~i~0 % 256); 25977#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; 25976#L76-1 assume !(0 == mp_add_~i~0 % 256); 25975#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25974#L81-1 assume !(2 == mp_add_~i~0 % 256); 25846#L82-1 assume !(3 == mp_add_~i~0 % 256); 25847#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25966#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25964#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25842#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25841#L71 assume !(0 == mp_add_~i~0 % 256); 25840#L71-2 assume !(1 == mp_add_~i~0 % 256); 25836#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; 25835#L73-1 assume !(3 == mp_add_~i~0 % 256); 25833#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; 25832#L76-1 assume !(0 == mp_add_~i~0 % 256); 25831#L80-1 assume !(1 == mp_add_~i~0 % 256); 25830#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25829#L82-1 assume !(3 == mp_add_~i~0 % 256); 25828#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25826#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25822#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25819#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25818#L71 assume !(0 == mp_add_~i~0 % 256); 25817#L71-2 assume !(1 == mp_add_~i~0 % 256); 25816#L72-1 assume !(2 == mp_add_~i~0 % 256); 25809#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; 25807#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; 25806#L76-1 assume !(0 == mp_add_~i~0 % 256); 25805#L80-1 assume !(1 == mp_add_~i~0 % 256); 25804#L81-1 assume !(2 == mp_add_~i~0 % 256); 25803#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25802#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25801#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25799#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25797#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25796#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25795#L76-1 assume !(0 == mp_add_~i~0 % 256); 25794#L80-1 assume !(1 == mp_add_~i~0 % 256); 25792#L81-1 assume !(2 == mp_add_~i~0 % 256); 25790#L82-1 assume !(3 == mp_add_~i~0 % 256); 25791#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25937#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25936#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25909#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25965#L71 assume !(0 == mp_add_~i~0 % 256); 25912#L71-2 assume !(1 == mp_add_~i~0 % 256); 25913#L72-1 assume !(2 == mp_add_~i~0 % 256); 25897#L73-1 assume !(3 == mp_add_~i~0 % 256); 25895#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25894#L76-1 assume !(0 == mp_add_~i~0 % 256); 25893#L80-1 assume !(1 == mp_add_~i~0 % 256); 25892#L81-1 assume !(2 == mp_add_~i~0 % 256); 25891#L82-1 assume !(3 == mp_add_~i~0 % 256); 25890#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25889#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25887#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25884#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25882#L65-2 assume !(1 == mp_add_~i~0 % 256); 25880#L66-1 assume !(2 == mp_add_~i~0 % 256); 25878#L67-1 assume !(3 == mp_add_~i~0 % 256); 25877#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25876#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25875#L71-2 assume !(1 == mp_add_~i~0 % 256); 25874#L72-1 assume !(2 == mp_add_~i~0 % 256); 25873#L73-1 assume !(3 == mp_add_~i~0 % 256); 25871#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25872#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 26004#L80-1 assume !(1 == mp_add_~i~0 % 256); 26003#L81-1 assume !(2 == mp_add_~i~0 % 256); 26002#L82-1 assume !(3 == mp_add_~i~0 % 256); 26001#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26000#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25999#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25862#L65 [2019-01-01 22:08:30,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:30,914 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 11 times [2019-01-01 22:08:30,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:30,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:30,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash -2120042935, now seen corresponding path program 3 times [2019-01-01 22:08:30,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:30,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:30,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:30,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-01 22:08:31,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:31,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 22:08:31,254 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:31,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:08:31,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:08:31,255 INFO L87 Difference]: Start difference. First operand 988 states and 1143 transitions. cyclomatic complexity: 161 Second operand 6 states. [2019-01-01 22:08:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:31,594 INFO L93 Difference]: Finished difference Result 1065 states and 1203 transitions. [2019-01-01 22:08:31,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 22:08:31,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1065 states and 1203 transitions. [2019-01-01 22:08:31,600 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 788 [2019-01-01 22:08:31,605 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1065 states to 1023 states and 1156 transitions. [2019-01-01 22:08:31,605 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1023 [2019-01-01 22:08:31,605 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1023 [2019-01-01 22:08:31,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1023 states and 1156 transitions. [2019-01-01 22:08:31,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:31,607 INFO L705 BuchiCegarLoop]: Abstraction has 1023 states and 1156 transitions. [2019-01-01 22:08:31,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states and 1156 transitions. [2019-01-01 22:08:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 934. [2019-01-01 22:08:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-01-01 22:08:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1063 transitions. [2019-01-01 22:08:31,619 INFO L728 BuchiCegarLoop]: Abstraction has 934 states and 1063 transitions. [2019-01-01 22:08:31,620 INFO L608 BuchiCegarLoop]: Abstraction has 934 states and 1063 transitions. [2019-01-01 22:08:31,620 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2019-01-01 22:08:31,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 934 states and 1063 transitions. [2019-01-01 22:08:31,622 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 736 [2019-01-01 22:08:31,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:31,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:31,623 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:31,623 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:31,623 INFO L794 eck$LassoCheckResult]: Stem: 27192#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 27162#L40 assume !(0 == mp_add_~a3~0 % 256); 27158#L40-1 mp_add_~nb~0 := 4; 27159#L50 assume !(0 == mp_add_~b3~0 % 256); 27184#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 27185#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27915#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27912#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 27910#L65-2 assume !(1 == mp_add_~i~0 % 256); 27908#L66-1 assume !(2 == mp_add_~i~0 % 256); 27174#L67-1 assume !(3 == mp_add_~i~0 % 256); 27175#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 28029#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 28028#L71-2 assume !(1 == mp_add_~i~0 % 256); 28027#L72-1 assume !(2 == mp_add_~i~0 % 256); 28026#L73-1 assume !(3 == mp_add_~i~0 % 256); 28025#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; 28024#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 28022#L80-1 assume !(1 == mp_add_~i~0 % 256); 28020#L81-1 assume !(2 == mp_add_~i~0 % 256); 28018#L82-1 assume !(3 == mp_add_~i~0 % 256); 28016#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 28014#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27938#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27890#L65 [2019-01-01 22:08:31,623 INFO L796 eck$LassoCheckResult]: Loop: 27890#L65 assume !(0 == mp_add_~i~0 % 256); 27894#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; 27892#L66-1 assume !(2 == mp_add_~i~0 % 256); 27888#L67-1 assume !(3 == mp_add_~i~0 % 256); 27887#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27886#L71 assume !(0 == mp_add_~i~0 % 256); 27885#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; 27883#L72-1 assume !(2 == mp_add_~i~0 % 256); 27884#L73-1 assume !(3 == mp_add_~i~0 % 256); 27975#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27974#L76-1 assume !(0 == mp_add_~i~0 % 256); 27973#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 27971#L81-1 assume !(2 == mp_add_~i~0 % 256); 27969#L82-1 assume !(3 == mp_add_~i~0 % 256); 27968#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27967#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27959#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27960#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27996#L71 assume !(0 == mp_add_~i~0 % 256); 27995#L71-2 assume !(1 == mp_add_~i~0 % 256); 27987#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; 27929#L73-1 assume !(3 == mp_add_~i~0 % 256); 27986#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27862#L76-1 assume !(0 == mp_add_~i~0 % 256); 27984#L80-1 assume !(1 == mp_add_~i~0 % 256); 27983#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 27982#L82-1 assume !(3 == mp_add_~i~0 % 256); 27980#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27965#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27963#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27964#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27994#L71 assume !(0 == mp_add_~i~0 % 256); 27993#L71-2 assume !(1 == mp_add_~i~0 % 256); 27991#L72-1 assume !(2 == mp_add_~i~0 % 256); 27989#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; 27840#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27831#L76-1 assume !(0 == mp_add_~i~0 % 256); 27839#L80-1 assume !(1 == mp_add_~i~0 % 256); 27833#L81-1 assume !(2 == mp_add_~i~0 % 256); 27834#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 27981#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27966#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27957#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27958#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27992#L71 assume !(0 == mp_add_~i~0 % 256); 27990#L71-2 assume !(1 == mp_add_~i~0 % 256); 27988#L72-1 assume !(2 == mp_add_~i~0 % 256); 27948#L73-1 assume !(3 == mp_add_~i~0 % 256); 27947#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27946#L76-1 assume !(0 == mp_add_~i~0 % 256); 27945#L80-1 assume !(1 == mp_add_~i~0 % 256); 27944#L81-1 assume !(2 == mp_add_~i~0 % 256); 27943#L82-1 assume !(3 == mp_add_~i~0 % 256); 27942#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27941#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27939#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27940#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27997#L71 assume !(0 == mp_add_~i~0 % 256); 27931#L71-2 assume !(1 == mp_add_~i~0 % 256); 27928#L72-1 assume !(2 == mp_add_~i~0 % 256); 27926#L73-1 assume !(3 == mp_add_~i~0 % 256); 27924#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27923#L76-1 assume !(0 == mp_add_~i~0 % 256); 27922#L80-1 assume !(1 == mp_add_~i~0 % 256); 27921#L81-1 assume !(2 == mp_add_~i~0 % 256); 27920#L82-1 assume !(3 == mp_add_~i~0 % 256); 27919#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27918#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27916#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27913#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 27911#L65-2 assume !(1 == mp_add_~i~0 % 256); 27909#L66-1 assume !(2 == mp_add_~i~0 % 256); 27907#L67-1 assume !(3 == mp_add_~i~0 % 256); 27906#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27905#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 27904#L71-2 assume !(1 == mp_add_~i~0 % 256); 27903#L72-1 assume !(2 == mp_add_~i~0 % 256); 27902#L73-1 assume !(3 == mp_add_~i~0 % 256); 27900#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; 27899#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 27898#L80-1 assume !(1 == mp_add_~i~0 % 256); 27897#L81-1 assume !(2 == mp_add_~i~0 % 256); 27896#L82-1 assume !(3 == mp_add_~i~0 % 256); 27895#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27893#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27889#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27890#L65 [2019-01-01 22:08:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash 820866843, now seen corresponding path program 12 times [2019-01-01 22:08:31,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:31,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:31,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:31,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:31,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:31,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1699425215, now seen corresponding path program 1 times [2019-01-01 22:08:31,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:31,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:31,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:31,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:08:31,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 147 proven. 29 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-01 22:08:31,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:31,973 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-01 22:08:31,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:32,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:32,628 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 22:08:32,941 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 22:08:33,260 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:08:33,573 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:08:33,688 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-01 22:08:33,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:08:33,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2019-01-01 22:08:33,708 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:08:33,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:08:33,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=115, Unknown=1, NotChecked=0, Total=156 [2019-01-01 22:08:33,708 INFO L87 Difference]: Start difference. First operand 934 states and 1063 transitions. cyclomatic complexity: 135 Second operand 13 states. [2019-01-01 22:08:39,759 WARN L181 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:08:40,746 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 22:08:41,214 WARN L181 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 22:08:41,828 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:08:44,080 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 22:08:44,828 WARN L181 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2019-01-01 22:08:47,223 WARN L181 SmtUtils]: Spent 639.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 22:08:49,929 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 22:08:52,389 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 22:08:52,721 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 22:08:55,497 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 22:08:56,427 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 22:08:57,071 WARN L181 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 22:08:59,976 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 22:09:00,578 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 22:09:01,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:01,568 INFO L93 Difference]: Finished difference Result 1506 states and 1678 transitions. [2019-01-01 22:09:01,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-01 22:09:01,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1506 states and 1678 transitions. [2019-01-01 22:09:01,575 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 883 [2019-01-01 22:09:01,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1506 states to 1132 states and 1244 transitions. [2019-01-01 22:09:01,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1132 [2019-01-01 22:09:01,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1132 [2019-01-01 22:09:01,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1132 states and 1244 transitions. [2019-01-01 22:09:01,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:01,585 INFO L705 BuchiCegarLoop]: Abstraction has 1132 states and 1244 transitions. [2019-01-01 22:09:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states and 1244 transitions. [2019-01-01 22:09:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 749. [2019-01-01 22:09:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-01-01 22:09:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 839 transitions. [2019-01-01 22:09:01,599 INFO L728 BuchiCegarLoop]: Abstraction has 749 states and 839 transitions. [2019-01-01 22:09:01,599 INFO L608 BuchiCegarLoop]: Abstraction has 749 states and 839 transitions. [2019-01-01 22:09:01,599 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2019-01-01 22:09:01,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 749 states and 839 transitions. [2019-01-01 22:09:01,605 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 643 [2019-01-01 22:09:01,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:01,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:01,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:01,606 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:01,606 INFO L794 eck$LassoCheckResult]: Stem: 29972#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 29967#L40 assume !(0 == mp_add_~a3~0 % 256); 29962#L40-1 mp_add_~nb~0 := 4; 29963#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 29965#L52 assume !(0 == mp_add_~b2~0 % 256); 29958#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29959#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29989#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29982#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29969#L65-2 [2019-01-01 22:09:01,606 INFO L796 eck$LassoCheckResult]: Loop: 29969#L65-2 assume !(1 == mp_add_~i~0 % 256); 29970#L66-1 assume !(2 == mp_add_~i~0 % 256); 29977#L67-1 assume !(3 == mp_add_~i~0 % 256); 30557#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30555#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 30553#L71-2 assume !(1 == mp_add_~i~0 % 256); 30552#L72-1 assume !(2 == mp_add_~i~0 % 256); 30534#L73-1 assume !(3 == mp_add_~i~0 % 256); 30532#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30502#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 30500#L80-1 assume !(1 == mp_add_~i~0 % 256); 30483#L81-1 assume !(2 == mp_add_~i~0 % 256); 30481#L82-1 assume !(3 == mp_add_~i~0 % 256); 30479#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30477#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30338#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30337#L65 assume !(0 == mp_add_~i~0 % 256); 30336#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; 30335#L66-1 assume !(2 == mp_add_~i~0 % 256); 30334#L67-1 assume !(3 == mp_add_~i~0 % 256); 30333#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30332#L71 assume !(0 == mp_add_~i~0 % 256); 30331#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; 30330#L72-1 assume !(2 == mp_add_~i~0 % 256); 30329#L73-1 assume !(3 == mp_add_~i~0 % 256); 30328#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30325#L76-1 assume !(0 == mp_add_~i~0 % 256); 30322#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 30319#L81-1 assume !(2 == mp_add_~i~0 % 256); 30316#L82-1 assume !(3 == mp_add_~i~0 % 256); 30313#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30284#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30281#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30280#L65 assume !(0 == mp_add_~i~0 % 256); 30279#L65-2 assume !(1 == mp_add_~i~0 % 256); 30278#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; 30277#L67-1 assume !(3 == mp_add_~i~0 % 256); 30276#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 30275#L71 assume !(0 == mp_add_~i~0 % 256); 30274#L71-2 assume !(1 == mp_add_~i~0 % 256); 30273#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; 30269#L73-1 assume !(3 == mp_add_~i~0 % 256); 30270#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; 30311#L76-1 assume !(0 == mp_add_~i~0 % 256); 30310#L80-1 assume !(1 == mp_add_~i~0 % 256); 30309#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 30308#L82-1 assume !(3 == mp_add_~i~0 % 256); 30307#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30306#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30305#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30304#L65 assume !(0 == mp_add_~i~0 % 256); 30303#L65-2 assume !(1 == mp_add_~i~0 % 256); 30302#L66-1 assume !(2 == mp_add_~i~0 % 256); 30300#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; 30299#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30298#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; 30297#L76-1 assume !(0 == mp_add_~i~0 % 256); 30296#L80-1 assume !(1 == mp_add_~i~0 % 256); 30295#L81-1 assume !(2 == mp_add_~i~0 % 256); 30294#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 30293#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30292#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30291#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30290#L65 assume !(0 == mp_add_~i~0 % 256); 30289#L65-2 assume !(1 == mp_add_~i~0 % 256); 30206#L66-1 assume !(2 == mp_add_~i~0 % 256); 30207#L67-1 assume !(3 == mp_add_~i~0 % 256); 30301#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30523#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30522#L76-1 assume !(0 == mp_add_~i~0 % 256); 30521#L80-1 assume !(1 == mp_add_~i~0 % 256); 30520#L81-1 assume !(2 == mp_add_~i~0 % 256); 30519#L82-1 assume !(3 == mp_add_~i~0 % 256); 30518#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30517#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30516#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30515#L65 assume !(0 == mp_add_~i~0 % 256); 30514#L65-2 assume !(1 == mp_add_~i~0 % 256); 30513#L66-1 assume !(2 == mp_add_~i~0 % 256); 30512#L67-1 assume !(3 == mp_add_~i~0 % 256); 30511#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30510#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 30509#L76-1 assume !(0 == mp_add_~i~0 % 256); 30508#L80-1 assume !(1 == mp_add_~i~0 % 256); 30507#L81-1 assume !(2 == mp_add_~i~0 % 256); 30506#L82-1 assume !(3 == mp_add_~i~0 % 256); 30505#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30504#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30503#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30179#L65 assume !(0 == mp_add_~i~0 % 256); 29984#L65-2 assume !(1 == mp_add_~i~0 % 256); 30501#L66-1 assume !(2 == mp_add_~i~0 % 256); 30174#L67-1 assume !(3 == mp_add_~i~0 % 256); 30003#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30000#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 29999#L76-1 assume !(0 == mp_add_~i~0 % 256); 29998#L80-1 assume !(1 == mp_add_~i~0 % 256); 29997#L81-1 assume !(2 == mp_add_~i~0 % 256); 29994#L82-1 assume !(3 == mp_add_~i~0 % 256); 29996#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29990#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29991#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29983#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29969#L65-2 [2019-01-01 22:09:01,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:01,610 INFO L82 PathProgramCache]: Analyzing trace with hash 563131225, now seen corresponding path program 1 times [2019-01-01 22:09:01,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:01,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:01,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1636629229, now seen corresponding path program 1 times [2019-01-01 22:09:01,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 156 proven. 69 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-01-01 22:09:02,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:02,002 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-01 22:09:02,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:02,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:03,498 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-01 22:09:03,922 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:09:04,259 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 22:09:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 157 proven. 44 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-01-01 22:09:04,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:04,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2019-01-01 22:09:04,384 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:04,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-01 22:09:04,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=119, Unknown=3, NotChecked=0, Total=156 [2019-01-01 22:09:04,385 INFO L87 Difference]: Start difference. First operand 749 states and 839 transitions. cyclomatic complexity: 95 Second operand 13 states. [2019-01-01 22:09:06,960 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-01 22:09:10,924 WARN L181 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2019-01-01 22:09:13,449 WARN L181 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-01-01 22:09:15,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:09:15,599 INFO L93 Difference]: Finished difference Result 820 states and 898 transitions. [2019-01-01 22:09:15,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-01 22:09:15,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 820 states and 898 transitions. [2019-01-01 22:09:15,604 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 492 [2019-01-01 22:09:15,607 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 820 states to 820 states and 898 transitions. [2019-01-01 22:09:15,607 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 820 [2019-01-01 22:09:15,607 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 820 [2019-01-01 22:09:15,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 820 states and 898 transitions. [2019-01-01 22:09:15,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:15,608 INFO L705 BuchiCegarLoop]: Abstraction has 820 states and 898 transitions. [2019-01-01 22:09:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states and 898 transitions. [2019-01-01 22:09:15,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 608. [2019-01-01 22:09:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-01-01 22:09:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 675 transitions. [2019-01-01 22:09:15,621 INFO L728 BuchiCegarLoop]: Abstraction has 608 states and 675 transitions. [2019-01-01 22:09:15,621 INFO L608 BuchiCegarLoop]: Abstraction has 608 states and 675 transitions. [2019-01-01 22:09:15,621 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2019-01-01 22:09:15,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 608 states and 675 transitions. [2019-01-01 22:09:15,626 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 426 [2019-01-01 22:09:15,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:15,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:15,627 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:15,627 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:15,627 INFO L794 eck$LassoCheckResult]: Stem: 31917#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_~b~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~a~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; 31910#L40 assume !(0 == mp_add_~a3~0 % 256); 31904#L40-1 mp_add_~nb~0 := 4; 31905#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31909#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31912#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31901#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 31902#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32243#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32240#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32239#L65-2 [2019-01-01 22:09:15,627 INFO L796 eck$LassoCheckResult]: Loop: 32239#L65-2 assume !(1 == mp_add_~i~0 % 256); 32238#L66-1 assume !(2 == mp_add_~i~0 % 256); 32237#L67-1 assume !(3 == mp_add_~i~0 % 256); 32236#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32235#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32234#L71-2 assume !(1 == mp_add_~i~0 % 256); 32233#L72-1 assume !(2 == mp_add_~i~0 % 256); 32232#L73-1 assume !(3 == mp_add_~i~0 % 256); 32230#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; 32228#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32226#L80-1 assume !(1 == mp_add_~i~0 % 256); 32224#L81-1 assume !(2 == mp_add_~i~0 % 256); 32222#L82-1 assume !(3 == mp_add_~i~0 % 256); 32220#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32218#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32216#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32214#L65 assume !(0 == mp_add_~i~0 % 256); 32213#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; 32209#L66-1 assume !(2 == mp_add_~i~0 % 256); 32207#L67-1 assume !(3 == mp_add_~i~0 % 256); 32203#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32200#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; 32197#L76-1 assume !(0 == mp_add_~i~0 % 256); 32195#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 32193#L81-1 assume !(2 == mp_add_~i~0 % 256); 32190#L82-1 assume !(3 == mp_add_~i~0 % 256); 32191#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32185#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32186#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32212#L65 assume !(0 == mp_add_~i~0 % 256); 32211#L65-2 assume !(1 == mp_add_~i~0 % 256); 32162#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; 32160#L67-1 assume !(3 == mp_add_~i~0 % 256); 32157#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32158#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; 32229#L76-1 assume !(0 == mp_add_~i~0 % 256); 32227#L80-1 assume !(1 == mp_add_~i~0 % 256); 32225#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 32223#L82-1 assume !(3 == mp_add_~i~0 % 256); 32221#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32219#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32217#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32215#L65 assume !(0 == mp_add_~i~0 % 256); 32210#L65-2 assume !(1 == mp_add_~i~0 % 256); 32208#L66-1 assume !(2 == mp_add_~i~0 % 256); 32204#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; 32202#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32198#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; 32196#L76-1 assume !(0 == mp_add_~i~0 % 256); 32194#L80-1 assume !(1 == mp_add_~i~0 % 256); 32192#L81-1 assume !(2 == mp_add_~i~0 % 256); 32189#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 32187#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32188#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32184#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32183#L65 assume !(0 == mp_add_~i~0 % 256); 32180#L65-2 assume !(1 == mp_add_~i~0 % 256); 32181#L66-1 assume !(2 == mp_add_~i~0 % 256); 32205#L67-1 assume !(3 == mp_add_~i~0 % 256); 32206#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32292#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32291#L76-1 assume !(0 == mp_add_~i~0 % 256); 32290#L80-1 assume !(1 == mp_add_~i~0 % 256); 32289#L81-1 assume !(2 == mp_add_~i~0 % 256); 32288#L82-1 assume !(3 == mp_add_~i~0 % 256); 32287#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32286#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32285#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32284#L65 assume !(0 == mp_add_~i~0 % 256); 32283#L65-2 assume !(1 == mp_add_~i~0 % 256); 32282#L66-1 assume !(2 == mp_add_~i~0 % 256); 32281#L67-1 assume !(3 == mp_add_~i~0 % 256); 32280#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32279#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32278#L76-1 assume !(0 == mp_add_~i~0 % 256); 32277#L80-1 assume !(1 == mp_add_~i~0 % 256); 32276#L81-1 assume !(2 == mp_add_~i~0 % 256); 32275#L82-1 assume !(3 == mp_add_~i~0 % 256); 32274#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32273#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32272#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32271#L65 assume !(0 == mp_add_~i~0 % 256); 32270#L65-2 assume !(1 == mp_add_~i~0 % 256); 32269#L66-1 assume !(2 == mp_add_~i~0 % 256); 32268#L67-1 assume !(3 == mp_add_~i~0 % 256); 32267#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32266#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32265#L76-1 assume !(0 == mp_add_~i~0 % 256); 32264#L80-1 assume !(1 == mp_add_~i~0 % 256); 32263#L81-1 assume !(2 == mp_add_~i~0 % 256); 32262#L82-1 assume !(3 == mp_add_~i~0 % 256); 32261#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32260#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32259#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32258#L65 assume !(0 == mp_add_~i~0 % 256); 32256#L65-2 assume !(1 == mp_add_~i~0 % 256); 32255#L66-1 assume !(2 == mp_add_~i~0 % 256); 32253#L67-1 assume !(3 == mp_add_~i~0 % 256); 32252#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32251#L70 assume !(mp_add_~partial_sum~0 % 65536 > 255); 32250#L76-1 assume !(0 == mp_add_~i~0 % 256); 32249#L80-1 assume !(1 == mp_add_~i~0 % 256); 32248#L81-1 assume !(2 == mp_add_~i~0 % 256); 32246#L82-1 assume !(3 == mp_add_~i~0 % 256); 32244#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32245#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32241#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32242#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32239#L65-2 [2019-01-01 22:09:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:15,630 INFO L82 PathProgramCache]: Analyzing trace with hash 38659332, now seen corresponding path program 1 times [2019-01-01 22:09:15,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:15,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:15,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:15,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:15,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash -800885211, now seen corresponding path program 1 times [2019-01-01 22:09:15,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:15,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:15,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:15,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:15,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 198 proven. 118 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-01 22:09:15,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:09:15,980 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-01 22:09:15,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:16,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:16,975 WARN L181 SmtUtils]: Spent 359.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 22:09:18,404 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 22:09:34,041 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 121 proven. 63 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-01-01 22:09:34,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:09:34,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2019-01-01 22:09:34,061 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 22:09:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-01 22:09:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=213, Unknown=2, NotChecked=0, Total=272 [2019-01-01 22:09:34,062 INFO L87 Difference]: Start difference. First operand 608 states and 675 transitions. cyclomatic complexity: 75 Second operand 17 states. [2019-01-01 22:10:21,994 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2019-01-01 22:10:21,995 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:666) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:65) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 38 more [2019-01-01 22:10:22,004 INFO L168 Benchmark]: Toolchain (without parser) took 161821.40 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 426.2 MB). Free memory was 948.7 MB in the beginning and 853.3 MB in the end (delta: 95.4 MB). Peak memory consumption was 521.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:22,005 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:10:22,009 INFO L168 Benchmark]: CACSL2BoogieTranslator took 465.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:22,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 135.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:22,010 INFO L168 Benchmark]: Boogie Preprocessor took 34.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:22,011 INFO L168 Benchmark]: RCFGBuilder took 651.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:22,011 INFO L168 Benchmark]: BuchiAutomizer took 160528.66 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 853.3 MB in the end (delta: 234.8 MB). Peak memory consumption was 542.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:10:22,031 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 465.68 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.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 135.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -174.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 651.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 160528.66 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 853.3 MB in the end (delta: 234.8 MB). Peak memory consumption was 542.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...