./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_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 eda42c9201fdedd9f50669e53ef2af5b1d7cb675 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:25:40,745 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:25:40,746 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:25:40,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:25:40,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:25:40,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:25:40,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:25:40,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:25:40,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:25:40,770 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:25:40,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:25:40,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:25:40,772 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:25:40,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:25:40,775 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:25:40,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:25:40,777 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:25:40,779 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:25:40,781 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:25:40,783 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:25:40,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:25:40,786 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:25:40,788 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:25:40,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:25:40,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:25:40,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:25:40,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:25:40,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:25:40,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:25:40,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:25:40,795 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:25:40,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:25:40,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:25:40,796 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:25:40,797 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:25:40,799 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:25:40,799 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:25:40,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:25:40,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:25:40,832 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:25:40,833 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:25:40,833 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:25:40,833 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:25:40,833 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:25:40,834 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:25:40,834 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:25:40,834 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:25:40,834 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:25:40,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:25:40,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:25:40,835 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:25:40,835 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:25:40,835 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:25:40,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:25:40,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:25:40,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:25:40,837 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:25:40,837 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:25:40,837 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:25:40,837 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:25:40,837 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:25:40,838 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:25:40,838 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:25:40,838 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:25:40,838 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:25:40,838 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:25:40,839 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:25:40,839 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:25:40,840 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:25:40,840 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 -> eda42c9201fdedd9f50669e53ef2af5b1d7cb675 [2018-11-28 23:25:40,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:25:40,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:25:40,894 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:25:40,895 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:25:40,896 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:25:40,897 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-28 23:25:40,960 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f2e4176/4187c42063a34e41a685dd5e9b526774/FLAGc271a669d [2018-11-28 23:25:41,379 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:25:41,380 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector-loops/verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-28 23:25:41,388 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f2e4176/4187c42063a34e41a685dd5e9b526774/FLAGc271a669d [2018-11-28 23:25:41,743 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f2e4176/4187c42063a34e41a685dd5e9b526774 [2018-11-28 23:25:41,748 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:25:41,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:25:41,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:25:41,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:25:41,754 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:25:41,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:41" (1/1) ... [2018-11-28 23:25:41,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd9c34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:41, skipping insertion in model container [2018-11-28 23:25:41,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:25:41" (1/1) ... [2018-11-28 23:25:41,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:25:41,790 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:25:41,988 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:25:41,992 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:25:42,014 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:25:42,035 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:25:42,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42 WrapperNode [2018-11-28 23:25:42,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:25:42,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:25:42,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:25:42,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:25:42,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,052 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:25:42,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:25:42,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:25:42,073 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:25:42,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (1/1) ... [2018-11-28 23:25:42,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:25:42,101 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:25:42,101 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:25:42,101 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:25:42,102 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (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 [2018-11-28 23:25:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:25:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:25:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:25:42,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:25:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:25:42,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:25:42,519 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:25:42,520 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:25:42,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:42 BoogieIcfgContainer [2018-11-28 23:25:42,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:25:42,522 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:25:42,522 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:25:42,527 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:25:42,529 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:25:42,529 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:25:41" (1/3) ... [2018-11-28 23:25:42,530 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58ab056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:42, skipping insertion in model container [2018-11-28 23:25:42,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:25:42,531 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:25:42" (2/3) ... [2018-11-28 23:25:42,531 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58ab056b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:25:42, skipping insertion in model container [2018-11-28 23:25:42,531 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:25:42,532 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:42" (3/3) ... [2018-11-28 23:25:42,534 INFO L375 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i [2018-11-28 23:25:42,638 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:25:42,639 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:25:42,639 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:25:42,639 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:25:42,639 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:25:42,639 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:25:42,640 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:25:42,640 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:25:42,640 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:25:42,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:25:42,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-28 23:25:42,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:42,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:42,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:25:42,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:25:42,685 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:25:42,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-28 23:25:42,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2018-11-28 23:25:42,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:42,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:42,687 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:25:42,687 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:25:42,694 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 4#L19-3true [2018-11-28 23:25:42,695 INFO L796 eck$LassoCheckResult]: Loop: 4#L19-3true assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 6#L19-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 4#L19-3true [2018-11-28 23:25:42,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:25:42,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:42,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:42,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:42,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:42,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:42,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:42,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-28 23:25:42,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:42,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:42,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:42,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:42,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:42,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-28 23:25:42,838 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:42,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:42,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:42,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:43,324 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:25:43,350 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:25:43,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:25:43,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:25:43,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:25:43,352 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:25:43,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:25:43,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:25:43,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:25:43,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-28 23:25:43,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:25:43,354 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:25:43,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,583 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-28 23:25:43,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:43,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:25:44,183 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:25:44,188 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:25:44,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:44,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:44,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:44,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,200 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:44,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:44,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:44,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,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 [2018-11-28 23:25:44,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:44,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:44,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:44,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,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 [2018-11-28 23:25:44,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:44,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:44,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:44,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:44,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:44,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:44,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,217 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:25:44,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,221 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:25:44,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:44,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:44,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:44,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:25:44,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:25:44,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:25:44,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:44,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:44,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:25:44,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:25:44,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:25:44,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:25:44,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:25:44,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:25:44,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:25:44,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:25:44,359 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:25:44,401 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:25:44,401 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:25:44,405 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:25:44,408 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:25:44,408 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:25:44,409 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 21 Supporting invariants [] [2018-11-28 23:25:44,428 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-28 23:25:44,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:44,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:44,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:44,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:44,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:25:44,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 3 states. [2018-11-28 23:25:44,923 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 3 states. Result 25 states and 35 transitions. Complement of second has 8 states. [2018-11-28 23:25:44,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:25:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:25:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2018-11-28 23:25:44,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-28 23:25:44,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:44,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:25:44,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:44,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-28 23:25:44,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:25:44,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. [2018-11-28 23:25:44,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:44,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 7 states and 9 transitions. [2018-11-28 23:25:44,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:25:44,940 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 23:25:44,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 9 transitions. [2018-11-28 23:25:44,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:44,941 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:25:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 9 transitions. [2018-11-28 23:25:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:25:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:25:44,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 23:25:44,968 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:25:44,968 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:25:44,969 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:25:44,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-28 23:25:44,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:44,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:44,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:44,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:25:44,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:44,971 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 85#L19-3 assume !(main_~i~0 < 11); 82#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 83#L26-2 [2018-11-28 23:25:44,972 INFO L796 eck$LassoCheckResult]: Loop: 83#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 83#L26-2 [2018-11-28 23:25:44,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:44,972 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-28 23:25:44,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:44,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:44,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:44,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:44,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:45,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:25:45,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:25:45,038 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:45,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:45,038 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 1 times [2018-11-28 23:25:45,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:45,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:45,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:45,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:25:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:25:45,221 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-28 23:25:45,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:45,277 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-11-28 23:25:45,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:25:45,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-28 23:25:45,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:45,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 23:25:45,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:45,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:45,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-11-28 23:25:45,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:45,281 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:25:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-11-28 23:25:45,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-11-28 23:25:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:25:45,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-28 23:25:45,283 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:25:45,283 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:25:45,283 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:25:45,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-28 23:25:45,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:45,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:45,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:45,284 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:25:45,285 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:45,285 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 104#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 105#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 108#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 109#L19-3 assume !(main_~i~0 < 11); 106#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 107#L26-2 [2018-11-28 23:25:45,285 INFO L796 eck$LassoCheckResult]: Loop: 107#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 107#L26-2 [2018-11-28 23:25:45,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:45,285 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-28 23:25:45,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:45,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:45,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:45,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:45,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:45,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:45,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:45,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:45,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:45,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:25:45,406 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:45,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 2 times [2018-11-28 23:25:45,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:45,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:45,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:45,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:25:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:25:45,552 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-28 23:25:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:45,703 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-11-28 23:25:45,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:25:45,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-11-28 23:25:45,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:45,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2018-11-28 23:25:45,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:45,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:45,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-11-28 23:25:45,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:45,706 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-28 23:25:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-11-28 23:25:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-11-28 23:25:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:25:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-28 23:25:45,708 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:25:45,708 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-28 23:25:45,708 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:25:45,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-28 23:25:45,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:45,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:45,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:45,710 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-28 23:25:45,710 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:45,710 INFO L794 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 145#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 146#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 150#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 151#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 152#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 153#L19-3 assume !(main_~i~0 < 11); 147#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 148#L26-2 [2018-11-28 23:25:45,710 INFO L796 eck$LassoCheckResult]: Loop: 148#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 148#L26-2 [2018-11-28 23:25:45,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-28 23:25:45,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:45,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:45,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:45,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:45,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:25:45,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:25:45,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:45,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:46,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:46,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 23:25:46,022 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:46,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:46,022 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 3 times [2018-11-28 23:25:46,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:46,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:46,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:46,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:46,168 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:25:46,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:25:46,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:25:46,236 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-28 23:25:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:46,282 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-28 23:25:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:25:46,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-28 23:25:46,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:46,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-11-28 23:25:46,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:46,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:46,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-28 23:25:46,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:46,285 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 23:25:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-28 23:25:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-11-28 23:25:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:25:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-28 23:25:46,287 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-28 23:25:46,287 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-28 23:25:46,288 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:25:46,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-28 23:25:46,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:46,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:46,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:46,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-28 23:25:46,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:46,290 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 199#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 200#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 201#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 207#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 205#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 202#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 203#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 206#L19-3 assume !(main_~i~0 < 11); 197#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 198#L26-2 [2018-11-28 23:25:46,290 INFO L796 eck$LassoCheckResult]: Loop: 198#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 198#L26-2 [2018-11-28 23:25:46,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-28 23:25:46,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:46,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:46,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:46,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:46,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:46,373 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:46,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:25:46,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 23:25:46,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:46,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:46,435 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:46,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:46,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-28 23:25:46,455 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:46,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:46,456 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 4 times [2018-11-28 23:25:46,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:46,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:46,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:46,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:25:46,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:25:46,594 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 7 states. [2018-11-28 23:25:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:46,693 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-28 23:25:46,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:25:46,695 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-11-28 23:25:46,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:46,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 23:25:46,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:46,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:46,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-11-28 23:25:46,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:46,698 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:25:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-11-28 23:25:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-28 23:25:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:25:46,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-28 23:25:46,705 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 23:25:46,705 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 23:25:46,705 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:25:46,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-11-28 23:25:46,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:46,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:46,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:46,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-28 23:25:46,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:46,709 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 262#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 263#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 265#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 266#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 267#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 268#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 272#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 271#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 270#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 269#L19-3 assume !(main_~i~0 < 11); 260#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 261#L26-2 [2018-11-28 23:25:46,709 INFO L796 eck$LassoCheckResult]: Loop: 261#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 261#L26-2 [2018-11-28 23:25:46,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:46,710 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-28 23:25:46,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:46,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,711 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:46,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:46,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:46,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:46,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:25:46,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:25:46,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:46,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:47,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:47,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 23:25:47,007 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:47,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:47,007 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 5 times [2018-11-28 23:25:47,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:47,265 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:25:47,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:25:47,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:25:47,334 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 3 Second operand 8 states. [2018-11-28 23:25:47,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:47,387 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-28 23:25:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:25:47,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-11-28 23:25:47,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:47,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-11-28 23:25:47,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:47,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:47,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-11-28 23:25:47,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:47,391 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-28 23:25:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-11-28 23:25:47,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-28 23:25:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:25:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-28 23:25:47,393 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:25:47,393 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-28 23:25:47,393 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:25:47,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-28 23:25:47,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:47,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:47,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:47,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-28 23:25:47,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:47,395 INFO L794 eck$LassoCheckResult]: Stem: 341#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 336#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 337#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 338#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 339#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 340#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 342#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 348#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 347#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 346#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 345#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 344#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 343#L19-3 assume !(main_~i~0 < 11); 334#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 335#L26-2 [2018-11-28 23:25:47,396 INFO L796 eck$LassoCheckResult]: Loop: 335#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 335#L26-2 [2018-11-28 23:25:47,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-28 23:25:47,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:47,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:47,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:47,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:47,483 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:47,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:47,484 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:47,498 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:25:47,531 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 23:25:47,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:47,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:47,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:47,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 23:25:47,585 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:47,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:47,586 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 6 times [2018-11-28 23:25:47,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:47,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:25:47,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:25:47,694 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-28 23:25:47,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:47,773 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-28 23:25:47,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:25:47,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2018-11-28 23:25:47,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:47,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2018-11-28 23:25:47,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:47,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:47,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-11-28 23:25:47,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:47,777 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-28 23:25:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-11-28 23:25:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-11-28 23:25:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-28 23:25:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-28 23:25:47,779 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-28 23:25:47,779 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-28 23:25:47,779 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:25:47,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-11-28 23:25:47,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:47,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:47,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:47,781 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-11-28 23:25:47,781 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:47,781 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 420#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 424#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 425#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 426#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 435#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 434#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 432#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 431#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 430#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 429#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 428#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 427#L19-3 assume !(main_~i~0 < 11); 421#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 422#L26-2 [2018-11-28 23:25:47,781 INFO L796 eck$LassoCheckResult]: Loop: 422#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 422#L26-2 [2018-11-28 23:25:47,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-11-28 23:25:47,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:47,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:47,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:47,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:25:47,967 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 23:25:47,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:47,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:47,980 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:48,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:48,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-28 23:25:48,002 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:48,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:48,002 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 7 times [2018-11-28 23:25:48,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:48,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:48,259 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:25:48,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 23:25:48,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-28 23:25:48,329 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 3 Second operand 10 states. [2018-11-28 23:25:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:48,400 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-28 23:25:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 23:25:48,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-28 23:25:48,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:48,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 23:25:48,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:48,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:48,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-11-28 23:25:48,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:48,405 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:25:48,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-11-28 23:25:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-28 23:25:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:25:48,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-28 23:25:48,407 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-28 23:25:48,408 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-28 23:25:48,408 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:25:48,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-11-28 23:25:48,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:48,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:48,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:48,409 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-11-28 23:25:48,409 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:48,410 INFO L794 eck$LassoCheckResult]: Stem: 519#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 515#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 516#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 520#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 521#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 522#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 533#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 532#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 531#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 530#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 529#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 528#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 527#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 526#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 525#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 524#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 523#L19-3 assume !(main_~i~0 < 11); 517#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 518#L26-2 [2018-11-28 23:25:48,410 INFO L796 eck$LassoCheckResult]: Loop: 518#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 518#L26-2 [2018-11-28 23:25:48,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:48,410 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-11-28 23:25:48,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:48,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:48,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:48,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:48,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:48,592 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 [2018-11-28 23:25:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:48,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:48,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:48,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-28 23:25:48,702 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:48,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 8 times [2018-11-28 23:25:48,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:48,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:48,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:25:48,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:48,817 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:25:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:25:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:25:48,844 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 3 Second operand 11 states. [2018-11-28 23:25:48,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:48,892 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-28 23:25:48,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:25:48,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-11-28 23:25:48,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:48,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2018-11-28 23:25:48,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:48,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:48,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-11-28 23:25:48,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:48,896 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-28 23:25:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-11-28 23:25:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-28 23:25:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:25:48,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-28 23:25:48,898 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:25:48,898 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-28 23:25:48,899 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:25:48,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-11-28 23:25:48,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:48,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:48,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:48,900 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-11-28 23:25:48,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:48,900 INFO L794 eck$LassoCheckResult]: Stem: 629#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 625#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 626#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 627#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 628#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 630#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 642#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 641#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 640#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 639#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 638#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 637#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 636#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 635#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 634#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 633#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 632#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 631#L19-3 assume !(main_~i~0 < 11); 622#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 623#L26-2 [2018-11-28 23:25:48,900 INFO L796 eck$LassoCheckResult]: Loop: 623#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 623#L26-2 [2018-11-28 23:25:48,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:48,901 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-11-28 23:25:48,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:48,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:48,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:48,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:49,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:49,028 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:49,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:25:49,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:25:49,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:49,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:49,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:49,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-28 23:25:49,127 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:49,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:49,127 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 9 times [2018-11-28 23:25:49,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:49,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:49,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:49,277 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:25:49,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:25:49,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:25:49,303 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-28 23:25:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:49,374 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-28 23:25:49,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:25:49,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-11-28 23:25:49,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:49,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-11-28 23:25:49,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:25:49,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:25:49,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-11-28 23:25:49,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:49,378 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-28 23:25:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-11-28 23:25:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-28 23:25:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:25:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-28 23:25:49,382 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-28 23:25:49,382 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-28 23:25:49,382 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:25:49,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-11-28 23:25:49,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:49,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:49,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:49,383 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-11-28 23:25:49,386 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:49,386 INFO L794 eck$LassoCheckResult]: Stem: 744#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 740#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 741#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 745#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 746#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 747#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 762#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 761#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 760#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 759#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 758#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 757#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 756#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 755#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 754#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 753#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 752#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 751#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 750#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 749#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 748#L19-3 assume !(main_~i~0 < 11); 742#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 743#L26-2 [2018-11-28 23:25:49,386 INFO L796 eck$LassoCheckResult]: Loop: 743#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 743#L26-2 [2018-11-28 23:25:49,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-11-28 23:25:49,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:49,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:49,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:49,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:49,556 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:49,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:25:49,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-28 23:25:49,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:49,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:49,667 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:49,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:49,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-28 23:25:49,687 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:49,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:49,687 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 10 times [2018-11-28 23:25:49,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:49,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:49,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:49,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:25:49,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:25:49,764 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 3 Second operand 13 states. [2018-11-28 23:25:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:49,964 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-28 23:25:49,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 23:25:49,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-11-28 23:25:49,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:49,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2018-11-28 23:25:49,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:25:49,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:25:49,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2018-11-28 23:25:49,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:49,971 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-28 23:25:49,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2018-11-28 23:25:49,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-11-28 23:25:49,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:25:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-28 23:25:49,973 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-28 23:25:49,973 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-28 23:25:49,975 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:25:49,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-11-28 23:25:49,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:49,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:49,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:49,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-11-28 23:25:49,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:49,979 INFO L794 eck$LassoCheckResult]: Stem: 874#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 870#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 871#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 875#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 876#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 877#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 894#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 893#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 892#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 891#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 890#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 889#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 888#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 887#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 886#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 885#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 884#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 883#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 882#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 881#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 880#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 879#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 878#L19-3 assume !(main_~i~0 < 11); 872#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 873#L26-2 [2018-11-28 23:25:49,979 INFO L796 eck$LassoCheckResult]: Loop: 873#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 873#L26-2 [2018-11-28 23:25:49,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:49,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-11-28 23:25:49,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:49,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:49,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:49,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:25:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:50,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:25:50,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:25:50,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:25:50,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:25:50,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:25:50,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:25:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:25:50,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:25:50,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-28 23:25:50,229 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:25:50,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:50,229 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 11 times [2018-11-28 23:25:50,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:50,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:50,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:50,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,382 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:25:50,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:25:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:25:50,415 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. cyclomatic complexity: 3 Second operand 14 states. [2018-11-28 23:25:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:25:50,524 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-28 23:25:50,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 23:25:50,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 30 transitions. [2018-11-28 23:25:50,527 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:50,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 30 transitions. [2018-11-28 23:25:50,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:25:50,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:25:50,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 30 transitions. [2018-11-28 23:25:50,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:25:50,528 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-28 23:25:50,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 30 transitions. [2018-11-28 23:25:50,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-28 23:25:50,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:25:50,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-28 23:25:50,533 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-28 23:25:50,533 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-28 23:25:50,533 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:25:50,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 28 transitions. [2018-11-28 23:25:50,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2018-11-28 23:25:50,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:25:50,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:25:50,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 1, 1, 1, 1] [2018-11-28 23:25:50,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:25:50,536 INFO L794 eck$LassoCheckResult]: Stem: 1014#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1010#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~post0, main_#t~mem2, main_#t~post3, main_#t~mem4, main_~#in~0.base, main_~#in~0.offset, main_~s~0.base, main_~s~0.offset, main_~c~0, main_~i~0, main_~j~0, main_~idx_in~0;call main_~#in~0.base, main_~#in~0.offset := #Ultimate.alloc(11);havoc main_~s~0.base, main_~s~0.offset;havoc main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~idx_in~0;main_~i~0 := 0; 1011#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1015#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1016#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1017#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1036#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1035#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1034#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1033#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1032#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1031#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1030#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1029#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1028#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1027#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1026#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1025#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1024#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1023#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1022#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1021#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1020#L19-3 assume !!(main_~i~0 < 11);call write~int(main_#t~nondet1, main_~#in~0.base, main_~#in~0.offset + main_~i~0, 1);havoc main_#t~nondet1; 1019#L19-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 1018#L19-3 assume !(main_~i~0 < 11); 1012#L19-4 call write~int(0, main_~#in~0.base, 10 + main_~#in~0.offset, 1);main_~idx_in~0 := 0;main_~s~0.base, main_~s~0.offset := main_~#in~0.base, main_~#in~0.offset;main_~i~0 := 0;call main_#t~mem2 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem2;havoc main_#t~mem2; 1013#L26-2 [2018-11-28 23:25:50,536 INFO L796 eck$LassoCheckResult]: Loop: 1013#L26-2 assume !!(48 <= main_~c~0 % 256 && main_~c~0 % 256 <= 57);main_~j~0 := main_~c~0 % 256 - 48;main_~i~0 := (if (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 else (10 * main_~i~0 + main_~j~0) % 4294967296 % 4294967296 - 4294967296);main_#t~post3 := main_~idx_in~0;main_~idx_in~0 := 1 + main_#t~post3;havoc main_#t~post3;call main_#t~mem4 := read~int(main_~#in~0.base, main_~#in~0.offset + main_~idx_in~0, 1);main_~c~0 := main_#t~mem4;havoc main_#t~mem4; 1013#L26-2 [2018-11-28 23:25:50,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:50,537 INFO L82 PathProgramCache]: Analyzing trace with hash -95647583, now seen corresponding path program 11 times [2018-11-28 23:25:50,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:50,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:50,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash 56, now seen corresponding path program 12 times [2018-11-28 23:25:50,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:50,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:50,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:50,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:25:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1329892248, now seen corresponding path program 1 times [2018-11-28 23:25:50,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:25:50,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:25:50,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:25:50,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:25:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:25:50,913 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:25:51,167 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-28 23:26:01,409 WARN L180 SmtUtils]: Spent 10.23 s on a formula simplification. DAG size of input: 214 DAG size of output: 162 [2018-11-28 23:26:01,680 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-28 23:26:01,685 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:26:01,686 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:26:01,686 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:26:01,686 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:26:01,686 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:26:01,686 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:26:01,686 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:26:01,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:26:01,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail__tTflag_arr_one_loop_false-unreach-call_true-termination.i_Iteration13_Lasso [2018-11-28 23:26:01,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:26:01,687 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:26:01,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:26:01,993 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-11-28 23:26:02,303 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2018-11-28 23:26:02,322 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:26:02,323 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:26:02,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:26:02,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:26:02,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:26:02,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,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 [2018-11-28 23:26:02,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:26:02,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:26:02,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:26:02,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,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 [2018-11-28 23:26:02,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:26:02,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:26:02,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:26:02,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:26:02,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:26:02,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:26:02,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:26:02,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:26:02,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:26:02,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:26:02,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:26:02,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:26:02,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:26:02,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:26:02,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,366 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:26:02,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,368 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:26:02,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:26:02,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:26:02,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:26:02,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:26:02,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:26:02,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:26:02,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:26:02,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:26:02,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:26:02,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:26:02,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:26:02,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:26:02,418 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:26:02,418 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:26:02,419 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:26:02,422 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:26:02,422 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:26:02,422 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#in~0.offset, ULTIMATE.start_main_~idx_in~0) = -2*ULTIMATE.start_main_~#in~0.offset - 2*ULTIMATE.start_main_~idx_in~0 + 19 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_main_~#in~0.base)_2 + 11 >= 0] [2018-11-28 23:26:02,475 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-28 23:26:02,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:26:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:26:03,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:26:03,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-28 23:26:03,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:26:03,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:26:03,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:7 [2018-11-28 23:26:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:26:03,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:26:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:26:03,231 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2018-11-28 23:26:03,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:26:03,322 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 28 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 28 states and 29 transitions. Complement of second has 3 states. [2018-11-28 23:26:03,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2018-11-28 23:26:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:26:03,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:26:03,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 26 letters. Loop has 1 letters. [2018-11-28 23:26:03,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:26:03,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 27 letters. Loop has 1 letters. [2018-11-28 23:26:03,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:26:03,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 26 letters. Loop has 2 letters. [2018-11-28 23:26:03,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:26:03,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-11-28 23:26:03,342 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:26:03,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-28 23:26:03,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:26:03,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:26:03,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:26:03,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:26:03,343 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:26:03,343 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:26:03,343 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:26:03,343 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 23:26:03,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:26:03,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:26:03,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:26:03,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:26:03 BoogieIcfgContainer [2018-11-28 23:26:03,354 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:26:03,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:26:03,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:26:03,355 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:26:03,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:25:42" (3/4) ... [2018-11-28 23:26:03,359 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:26:03,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:26:03,360 INFO L168 Benchmark]: Toolchain (without parser) took 21612.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -327.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:26:03,361 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-11-28 23:26:03,362 INFO L168 Benchmark]: CACSL2BoogieTranslator took 285.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:26:03,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:26:03,363 INFO L168 Benchmark]: Boogie Preprocessor took 28.01 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:26:03,365 INFO L168 Benchmark]: RCFGBuilder took 419.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:26:03,365 INFO L168 Benchmark]: BuchiAutomizer took 20832.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -173.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:26:03,367 INFO L168 Benchmark]: Witness Printer took 4.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:26:03,373 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.17 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 285.64 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 36.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.01 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 419.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20832.70 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -173.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.86 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (11 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function -2 * in + -2 * idx_in + 19 and consists of 3 locations. 11 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.7s and 14 iterations. TraceHistogramMax:11. Analysis of lassos took 18.1s. Construction of modules took 0.9s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 13. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 23 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 12. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 77 SDslu, 58 SDs, 0 SdLazy, 300 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU11 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital150 mio100 ax100 hnf100 lsp94 ukn54 mio100 lsp60 div158 bol100 ite103 ukn100 eq156 hnf73 smp97 dnf130 smp98 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...