./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-industry-pattern/array_assert_loop_dep_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 54e32ac14491e98c150c8fd937f55676029a26c7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:49:41,800 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:49:41,802 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:49:41,814 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:49:41,814 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:49:41,815 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:49:41,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:49:41,819 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:49:41,821 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:49:41,822 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:49:41,823 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:49:41,823 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:49:41,824 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:49:41,825 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:49:41,826 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:49:41,827 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:49:41,828 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:49:41,830 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:49:41,833 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:49:41,835 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:49:41,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:49:41,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:49:41,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:49:41,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:49:41,841 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:49:41,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:49:41,843 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:49:41,844 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:49:41,845 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:49:41,846 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:49:41,846 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:49:41,847 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:49:41,847 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:49:41,848 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:49:41,849 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:49:41,849 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:49:41,850 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:49:41,878 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:49:41,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:49:41,882 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:49:41,883 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:49:41,883 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:49:41,883 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:49:41,884 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:49:41,884 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:49:41,884 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:49:41,884 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:49:41,884 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:49:41,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:49:41,887 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:49:41,887 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:49:41,887 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:49:41,888 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:49:41,888 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:49:41,888 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:49:41,888 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:49:41,888 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:49:41,888 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:49:41,889 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:49:41,892 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:49:41,892 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:49:41,892 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:49:41,892 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:49:41,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:49:41,893 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:49:41,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:49:41,893 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:49:41,893 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:49:41,896 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:49:41,897 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 -> 54e32ac14491e98c150c8fd937f55676029a26c7 [2019-01-14 02:49:41,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:49:41,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:49:41,964 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:49:41,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:49:41,966 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:49:41,966 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2019-01-14 02:49:42,031 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2df5e0a2/63d815f5442942f1ad4fcb5004a18f27/FLAG16c2dc943 [2019-01-14 02:49:42,457 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:49:42,458 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2019-01-14 02:49:42,464 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2df5e0a2/63d815f5442942f1ad4fcb5004a18f27/FLAG16c2dc943 [2019-01-14 02:49:42,812 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2df5e0a2/63d815f5442942f1ad4fcb5004a18f27 [2019-01-14 02:49:42,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:49:42,819 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:49:42,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:42,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:49:42,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:49:42,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:42" (1/1) ... [2019-01-14 02:49:42,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1944673d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:42, skipping insertion in model container [2019-01-14 02:49:42,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:42" (1/1) ... [2019-01-14 02:49:42,842 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:49:42,862 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:49:43,058 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:43,061 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:49:43,082 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:43,102 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:49:43,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43 WrapperNode [2019-01-14 02:49:43,103 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:43,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:43,104 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:49:43,104 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:49:43,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,150 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:43,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:49:43,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:49:43,151 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:49:43,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,164 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... [2019-01-14 02:49:43,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:49:43,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:49:43,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:49:43,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:49:43,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:49:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:49:43,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:49:43,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:49:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:49:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:49:43,645 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:49:43,646 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:49:43,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:43 BoogieIcfgContainer [2019-01-14 02:49:43,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:49:43,649 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:49:43,649 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:49:43,653 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:49:43,654 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:43,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:49:42" (1/3) ... [2019-01-14 02:49:43,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b991f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:43, skipping insertion in model container [2019-01-14 02:49:43,655 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:43,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:43" (2/3) ... [2019-01-14 02:49:43,656 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b991f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:43, skipping insertion in model container [2019-01-14 02:49:43,656 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:43,656 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:43" (3/3) ... [2019-01-14 02:49:43,658 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep_false-unreach-call_true-termination.i [2019-01-14 02:49:43,712 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:49:43,712 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:49:43,712 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:49:43,713 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:49:43,713 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:49:43,713 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:49:43,713 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:49:43,713 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:49:43,713 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:49:43,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:49:43,755 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:49:43,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:43,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:43,761 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:43,762 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:49:43,762 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:49:43,762 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-14 02:49:43,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-14 02:49:43,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:43,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:43,764 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:43,764 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:49:43,771 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 17#L7-3true [2019-01-14 02:49:43,771 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 3#L7-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 17#L7-3true [2019-01-14 02:49:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:49:43,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:43,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:43,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:43,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-14 02:49:43,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:43,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:43,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:43,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:43,908 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-14 02:49:43,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:43,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:43,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:43,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:44,328 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 02:49:44,342 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:44,344 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:44,345 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:44,345 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:44,345 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:44,345 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:44,345 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:44,345 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:44,348 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 02:49:44,348 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:44,349 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:44,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,543 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 02:49:44,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:49:44,957 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:44,961 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:44,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:44,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:44,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:44,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:44,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:44,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:44,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:44,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:44,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:44,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:44,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:44,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:44,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:44,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:44,977 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:44,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:45,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:45,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:45,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:45,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:45,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:45,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:45,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:45,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:45,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:45,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:45,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:45,028 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-14 02:49:45,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:45,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:45,031 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-14 02:49:45,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:45,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:45,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:45,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:45,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:45,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:45,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:45,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:45,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:45,112 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:45,184 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 02:49:45,187 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:49:45,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:45,196 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:45,198 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:45,199 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-01-14 02:49:45,234 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 02:49:45,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:45,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:45,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:45,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:45,512 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 [2019-01-14 02:49:45,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-14 02:49:45,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 29 states and 41 transitions. Complement of second has 8 states. [2019-01-14 02:49:45,653 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 [2019-01-14 02:49:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-14 02:49:45,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:49:45,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:45,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:49:45,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:45,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-14 02:49:45,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:45,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2019-01-14 02:49:45,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:49:45,669 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2019-01-14 02:49:45,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:49:45,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:49:45,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 02:49:45,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:45,672 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:49:45,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 02:49:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 02:49:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:49:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-14 02:49:45,707 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:49:45,707 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:49:45,707 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:49:45,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-14 02:49:45,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:49:45,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:45,709 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:45,709 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:49:45,709 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:45,710 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 88#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 89#L7-3 assume !(main_~i~0 < 100000); 98#L7-4 main_~i~0 := 0; 97#L11-3 [2019-01-14 02:49:45,710 INFO L796 eck$LassoCheckResult]: Loop: 97#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 96#L2 assume !(0 == __VERIFIER_assert_~cond); 90#L2-3 havoc main_#t~mem2; 91#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 99#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 97#L11-3 [2019-01-14 02:49:45,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-14 02:49:45,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:45,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:45,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:45,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:49:45,803 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:49:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2019-01-14 02:49:45,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:45,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:45,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:45,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,052 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-01-14 02:49:46,220 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-14 02:49:46,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:49:46,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:49:46,226 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:49:46,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:46,259 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-01-14 02:49:46,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:49:46,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-01-14 02:49:46,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:46,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2019-01-14 02:49:46,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 02:49:46,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 02:49:46,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-01-14 02:49:46,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:46,265 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-14 02:49:46,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-01-14 02:49:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-01-14 02:49:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:49:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 02:49:46,268 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:49:46,268 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:49:46,268 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:49:46,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-14 02:49:46,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:46,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:46,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:46,270 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:49:46,270 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:46,270 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 126#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 129#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 130#L7-3 assume !(main_~i~0 < 100000); 134#L7-4 main_~i~0 := 0; 135#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 139#L2 assume !(0 == __VERIFIER_assert_~cond); 138#L2-3 havoc main_#t~mem2; 136#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 137#L11-2 [2019-01-14 02:49:46,271 INFO L796 eck$LassoCheckResult]: Loop: 137#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 133#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 132#L2 assume !(0 == __VERIFIER_assert_~cond); 127#L2-3 havoc main_#t~mem2; 128#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 137#L11-2 [2019-01-14 02:49:46,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:46,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2019-01-14 02:49:46,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:46,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:46,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:46,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:49:46,329 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 [2019-01-14 02:49:46,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:46,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:49:46,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:49:46,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 02:49:46,412 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:49:46,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:46,412 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2019-01-14 02:49:46,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:46,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:46,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:46,699 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-14 02:49:46,871 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-14 02:49:46,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:49:46,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:49:46,872 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-01-14 02:49:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:47,002 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-14 02:49:47,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:49:47,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-01-14 02:49:47,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:47,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2019-01-14 02:49:47,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-14 02:49:47,005 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-14 02:49:47,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-01-14 02:49:47,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:47,006 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-14 02:49:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-01-14 02:49:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-14 02:49:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 02:49:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-14 02:49:47,009 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-14 02:49:47,009 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-14 02:49:47,010 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:49:47,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-01-14 02:49:47,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:47,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:47,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:47,012 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-14 02:49:47,012 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:47,012 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 201#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 202#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 212#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 213#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 203#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 204#L7-3 assume !(main_~i~0 < 100000); 208#L7-4 main_~i~0 := 0; 209#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 220#L2 assume !(0 == __VERIFIER_assert_~cond); 219#L2-3 havoc main_#t~mem2; 218#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 211#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 207#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 206#L2 assume !(0 == __VERIFIER_assert_~cond); 199#L2-3 havoc main_#t~mem2; 200#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 210#L11-2 [2019-01-14 02:49:47,012 INFO L796 eck$LassoCheckResult]: Loop: 210#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 217#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 216#L2 assume !(0 == __VERIFIER_assert_~cond); 215#L2-3 havoc main_#t~mem2; 214#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 210#L11-2 [2019-01-14 02:49:47,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:47,013 INFO L82 PathProgramCache]: Analyzing trace with hash -974790727, now seen corresponding path program 1 times [2019-01-14 02:49:47,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:47,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:47,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:47,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:49:47,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:49:47,087 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 [2019-01-14 02:49:47,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:47,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:47,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 02:49:47,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:49:47,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-14 02:49:47,233 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:49:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2019-01-14 02:49:47,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:47,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:47,387 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-14 02:49:47,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:49:47,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:49:47,489 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-14 02:49:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:47,575 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-01-14 02:49:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:49:47,576 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2019-01-14 02:49:47,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:47,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2019-01-14 02:49:47,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 02:49:47,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 02:49:47,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-01-14 02:49:47,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:47,582 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-14 02:49:47,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-01-14 02:49:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-14 02:49:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 02:49:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-14 02:49:47,586 INFO L729 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-14 02:49:47,587 INFO L609 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-14 02:49:47,587 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:49:47,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2019-01-14 02:49:47,589 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:47,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:47,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:47,591 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-01-14 02:49:47,591 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:47,591 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 309#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 310#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 323#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 324#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 313#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 314#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 326#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 325#L7-3 assume !(main_~i~0 < 100000); 318#L7-4 main_~i~0 := 0; 317#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 316#L2 assume !(0 == __VERIFIER_assert_~cond); 311#L2-3 havoc main_#t~mem2; 312#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 321#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 322#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 337#L2 assume !(0 == __VERIFIER_assert_~cond); 336#L2-3 havoc main_#t~mem2; 331#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 332#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 335#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 334#L2 assume !(0 == __VERIFIER_assert_~cond); 333#L2-3 havoc main_#t~mem2; 319#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 320#L11-2 [2019-01-14 02:49:47,591 INFO L796 eck$LassoCheckResult]: Loop: 320#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 330#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 329#L2 assume !(0 == __VERIFIER_assert_~cond); 328#L2-3 havoc main_#t~mem2; 327#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 320#L11-2 [2019-01-14 02:49:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1970397435, now seen corresponding path program 2 times [2019-01-14 02:49:47,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:47,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:47,679 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 02:49:47,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:49:47,679 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 [2019-01-14 02:49:47,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:49:47,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:49:47,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:49:47,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-14 02:49:47,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:49:47,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 02:49:47,765 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:49:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:47,766 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2019-01-14 02:49:47,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:47,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:47,896 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-14 02:49:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:49:47,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:49:47,999 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-14 02:49:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:48,075 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-14 02:49:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:49:48,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-01-14 02:49:48,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:48,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2019-01-14 02:49:48,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-14 02:49:48,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-14 02:49:48,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2019-01-14 02:49:48,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:48,079 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-14 02:49:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2019-01-14 02:49:48,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-01-14 02:49:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 02:49:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-14 02:49:48,085 INFO L729 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-14 02:49:48,085 INFO L609 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-14 02:49:48,085 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:49:48,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-01-14 02:49:48,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:48,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:48,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:48,087 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2019-01-14 02:49:48,087 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:48,088 INFO L794 eck$LassoCheckResult]: Stem: 461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 havoc main_#res;havoc main_#t~post0, main_#t~mem2, main_#t~post1, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 458#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 468#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 469#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 459#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 460#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 473#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 472#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 471#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 470#L7-3 assume !(main_~i~0 < 100000); 464#L7-4 main_~i~0 := 0; 465#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 490#L2 assume !(0 == __VERIFIER_assert_~cond); 489#L2-3 havoc main_#t~mem2; 488#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 467#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 463#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 462#L2 assume !(0 == __VERIFIER_assert_~cond); 455#L2-3 havoc main_#t~mem2; 456#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 466#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 487#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 486#L2 assume !(0 == __VERIFIER_assert_~cond); 485#L2-3 havoc main_#t~mem2; 484#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 483#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 482#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 481#L2 assume !(0 == __VERIFIER_assert_~cond); 480#L2-3 havoc main_#t~mem2; 479#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 475#L11-2 [2019-01-14 02:49:48,088 INFO L796 eck$LassoCheckResult]: Loop: 475#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 478#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 477#L2 assume !(0 == __VERIFIER_assert_~cond); 476#L2-3 havoc main_#t~mem2; 474#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 475#L11-2 [2019-01-14 02:49:48,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:48,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1016089675, now seen corresponding path program 3 times [2019-01-14 02:49:48,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:48,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:48,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:48,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-01-14 02:49:48,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:49:48,261 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 [2019-01-14 02:49:48,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:49:48,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 02:49:48,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:49:48,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:48,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-14 02:49:48,356 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 13 treesize of output 12 [2019-01-14 02:49:48,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 02:49:48,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:49:48,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:49:48,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-14 02:49:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-01-14 02:49:48,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 02:49:48,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-01-14 02:49:48,504 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:49:48,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:48,506 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2019-01-14 02:49:48,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:48,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:48,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:48,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:48,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:48,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:49:48,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:49:48,708 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-01-14 02:49:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:48,823 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-14 02:49:48,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:49:48,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 22 transitions. [2019-01-14 02:49:48,825 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:48,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 02:49:48,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:48,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:48,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:48,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:48,826 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:48,827 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:48,827 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:48,827 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:49:48,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:49:48,827 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:48,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:49:48,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:49:48 BoogieIcfgContainer [2019-01-14 02:49:48,834 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:49:48,834 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:49:48,835 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:49:48,835 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:49:48,835 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:43" (3/4) ... [2019-01-14 02:49:48,838 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:49:48,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:49:48,839 INFO L168 Benchmark]: Toolchain (without parser) took 6021.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -241.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:48,840 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:48,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.11 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. [2019-01-14 02:49:48,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.71 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. [2019-01-14 02:49:48,843 INFO L168 Benchmark]: Boogie Preprocessor took 30.34 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. [2019-01-14 02:49:48,843 INFO L168 Benchmark]: RCFGBuilder took 466.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:48,844 INFO L168 Benchmark]: BuchiAutomizer took 5185.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:48,845 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:48,850 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 283.11 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 46.71 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 30.34 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 466.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5185.54 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 67.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -78.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 199999 and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.1s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 4.1s. Construction of modules took 0.4s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 36 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 38 SDtfs, 77 SDslu, 48 SDs, 0 SdLazy, 149 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp93 ukn60 mio100 lsp68 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 2 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...