./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-2e94e6a [2019-01-01 22:07:16,623 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:07:16,625 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:07:16,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:07:16,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:07:16,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:07:16,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:07:16,645 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:07:16,646 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:07:16,647 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:07:16,649 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:07:16,649 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:07:16,650 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:07:16,651 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:07:16,652 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:07:16,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:07:16,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:07:16,656 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:07:16,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:07:16,660 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:07:16,662 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:07:16,663 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:07:16,666 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:07:16,666 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:07:16,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:07:16,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:07:16,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:07:16,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:07:16,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:07:16,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:07:16,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:07:16,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:07:16,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:07:16,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:07:16,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:07:16,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:07:16,676 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:07:16,711 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:07:16,711 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:07:16,712 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:07:16,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:07:16,714 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:07:16,714 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:07:16,714 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:07:16,714 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:07:16,714 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:07:16,715 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:07:16,715 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:07:16,715 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:07:16,715 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:07:16,715 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:07:16,715 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:07:16,717 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:07:16,717 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:07:16,717 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:07:16,717 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:07:16,717 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:07:16,717 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:07:16,718 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:07:16,718 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:07:16,718 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:07:16,718 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:07:16,718 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:07:16,718 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:07:16,720 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:07:16,720 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:07:16,721 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:07:16,721 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:07:16,722 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:07:16,722 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-01 22:07:16,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:07:16,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:07:16,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:07:16,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:07:16,810 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:07:16,811 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-01 22:07:16,877 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d4c2a515/1ee3bbc9a6774280b4837e6f92e83da7/FLAGad613c7be [2019-01-01 22:07:17,316 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:07:17,317 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-industry-pattern/array_assert_loop_dep_false-unreach-call_true-termination.i [2019-01-01 22:07:17,323 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d4c2a515/1ee3bbc9a6774280b4837e6f92e83da7/FLAGad613c7be [2019-01-01 22:07:17,709 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d4c2a515/1ee3bbc9a6774280b4837e6f92e83da7 [2019-01-01 22:07:17,713 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:07:17,715 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:07:17,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:07:17,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:07:17,720 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:07:17,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:07:17" (1/1) ... [2019-01-01 22:07:17,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5118fd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:17, skipping insertion in model container [2019-01-01 22:07:17,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:07:17" (1/1) ... [2019-01-01 22:07:17,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:07:17,751 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:07:17,972 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:07:17,977 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:07:18,009 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:07:18,039 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:07:18,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18 WrapperNode [2019-01-01 22:07:18,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:07:18,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:07:18,041 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:07:18,041 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:07:18,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,062 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,088 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:07:18,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:07:18,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:07:18,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:07:18,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,102 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... [2019-01-01 22:07:18,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:07:18,126 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:07:18,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:07:18,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:07:18,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:07:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:07:18,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:07:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:07:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 22:07:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:07:18,705 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:07:18,706 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:07:18,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:18 BoogieIcfgContainer [2019-01-01 22:07:18,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:07:18,707 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:07:18,707 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:07:18,712 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:07:18,713 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:18,713 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:07:17" (1/3) ... [2019-01-01 22:07:18,714 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39676084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:07:18, skipping insertion in model container [2019-01-01 22:07:18,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:18,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:07:18" (2/3) ... [2019-01-01 22:07:18,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@39676084 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:07:18, skipping insertion in model container [2019-01-01 22:07:18,715 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:07:18,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:18" (3/3) ... [2019-01-01 22:07:18,717 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep_false-unreach-call_true-termination.i [2019-01-01 22:07:18,777 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:07:18,777 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:07:18,778 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:07:18,778 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:07:18,778 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:07:18,778 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:07:18,779 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:07:18,779 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:07:18,779 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:07:18,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:07:18,815 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:07:18,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:18,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:18,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:07:18,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:07:18,823 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:07:18,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-01-01 22:07:18,824 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-01-01 22:07:18,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:18,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:18,825 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 22:07:18,825 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:07:18,834 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-01 22:07:18,834 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-01 22:07:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:18,841 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 22:07:18,842 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:18,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:18,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:18,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:18,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-01-01 22:07:18,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:18,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:18,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:18,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:18,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:18,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:18,998 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-01-01 22:07:18,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:18,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:19,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:19,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:19,420 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 22:07:19,445 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:07:19,446 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:07:19,447 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:07:19,447 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:07:19,447 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:07:19,447 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:07:19,447 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:07:19,447 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:07:19,448 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep_false-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-01 22:07:19,448 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:07:19,448 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:07:19,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:19,685 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 22:07:19,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:19,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:19,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:19,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:19,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:19,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:07:20,081 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:07:20,087 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:07:20,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:20,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:20,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:07:20,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:20,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:20,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:20,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:07:20,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:07:20,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:20,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:20,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:20,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:20,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:20,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:20,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:20,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:20,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:20,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:20,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:20,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:20,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:20,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:20,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:20,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:20,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:20,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:20,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:20,138 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 22:07:20,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:20,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:20,143 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 22:07:20,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:20,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:07:20,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:07:20,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:07:20,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:07:20,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:07:20,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:07:20,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:07:20,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:07:20,249 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:07:20,319 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-01 22:07:20,323 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-01 22:07:20,327 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:07:20,331 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:07:20,336 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:07:20,336 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-01 22:07:20,375 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 22:07:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:20,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:20,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:07:20,699 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-01 22:07:20,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-01-01 22:07:20,855 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-01 22:07:20,857 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-01 22:07:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:07:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-01-01 22:07:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 22:07:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:20,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 22:07:20,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:20,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 22:07:20,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:07:20,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2019-01-01 22:07:20,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 22:07:20,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2019-01-01 22:07:20,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-01 22:07:20,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 22:07:20,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 22:07:20,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:20,889 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 22:07:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 22:07:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 22:07:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 22:07:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-01 22:07:20,925 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 22:07:20,926 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 22:07:20,926 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:07:20,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-01 22:07:20,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-01 22:07:20,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:20,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:20,929 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 22:07:20,929 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:20,929 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-01 22:07:20,930 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-01 22:07:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-01-01 22:07:20,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:20,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:20,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:20,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:07:21,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:07:21,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:07:21,032 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:21,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:21,033 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2019-01-01 22:07:21,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:21,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:21,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:21,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:21,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:21,274 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-01-01 22:07:21,481 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-01-01 22:07:21,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:07:21,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:07:21,487 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 22:07:21,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:21,537 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-01-01 22:07:21,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:07:21,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-01-01 22:07:21,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:21,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2019-01-01 22:07:21,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-01 22:07:21,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-01 22:07:21,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-01-01 22:07:21,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:21,543 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-01 22:07:21,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-01-01 22:07:21,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-01-01 22:07:21,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-01 22:07:21,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-01 22:07:21,545 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 22:07:21,545 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-01 22:07:21,546 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:07:21,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-01 22:07:21,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:21,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:21,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:21,547 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:07:21,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:21,549 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-01 22:07:21,550 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-01 22:07:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2019-01-01 22:07:21,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:21,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:21,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:21,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:21,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:21,603 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-01 22:07:21,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:07:21,604 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-01 22:07:21,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:21,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:21,655 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-01 22:07:21,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:07:21,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-01 22:07:21,677 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:21,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2019-01-01 22:07:21,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:21,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:21,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:21,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:21,989 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-01 22:07:22,148 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-01 22:07:22,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:07:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:07:22,150 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-01-01 22:07:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:22,277 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-01 22:07:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:07:22,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-01-01 22:07:22,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:22,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2019-01-01 22:07:22,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-01-01 22:07:22,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-01-01 22:07:22,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-01-01 22:07:22,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:22,282 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-01 22:07:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-01-01 22:07:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-01-01 22:07:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 22:07:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-01-01 22:07:22,285 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-01 22:07:22,285 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-01-01 22:07:22,285 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:07:22,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-01-01 22:07:22,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:22,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:22,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:22,287 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-01 22:07:22,287 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:22,287 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-01 22:07:22,288 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-01 22:07:22,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:22,289 INFO L82 PathProgramCache]: Analyzing trace with hash -974790727, now seen corresponding path program 1 times [2019-01-01 22:07:22,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:22,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:22,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:22,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:22,462 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-01 22:07:22,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:07:22,463 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-01 22:07:22,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:22,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:22,589 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-01 22:07:22,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:07:22,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-01-01 22:07:22,621 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:22,622 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2019-01-01 22:07:22,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:22,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:22,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:22,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:07:22,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:22,791 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-01 22:07:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 22:07:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 22:07:22,882 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-01-01 22:07:22,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:22,947 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-01-01 22:07:22,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 22:07:22,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2019-01-01 22:07:22,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:22,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2019-01-01 22:07:22,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-01 22:07:22,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-01 22:07:22,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-01-01 22:07:22,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:22,954 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-01 22:07:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-01-01 22:07:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-01-01 22:07:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 22:07:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-01 22:07:22,959 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-01 22:07:22,959 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-01 22:07:22,959 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:07:22,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2019-01-01 22:07:22,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:22,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:22,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:22,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-01-01 22:07:22,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:22,964 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-01 22:07:22,964 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-01 22:07:22,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:22,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1970397435, now seen corresponding path program 2 times [2019-01-01 22:07:22,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:22,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:22,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:22,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:23,102 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-01 22:07:23,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:07:23,103 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-01 22:07:23,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 22:07:23,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 22:07:23,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:07:23,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:23,187 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-01 22:07:23,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:07:23,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-01 22:07:23,211 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:23,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2019-01-01 22:07:23,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:23,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:23,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:23,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:23,430 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2019-01-01 22:07:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 22:07:23,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-01 22:07:23,431 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-01-01 22:07:23,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:23,510 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-01-01 22:07:23,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 22:07:23,512 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-01-01 22:07:23,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:23,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2019-01-01 22:07:23,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-01-01 22:07:23,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-01-01 22:07:23,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2019-01-01 22:07:23,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:23,516 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-01 22:07:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2019-01-01 22:07:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-01-01 22:07:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-01 22:07:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-01-01 22:07:23,522 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-01 22:07:23,523 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-01-01 22:07:23,523 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:07:23,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-01-01 22:07:23,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 22:07:23,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:07:23,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:07:23,527 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2019-01-01 22:07:23,527 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 22:07:23,527 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-01 22:07:23,527 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-01 22:07:23,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:23,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1016089675, now seen corresponding path program 3 times [2019-01-01 22:07:23,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:23,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:23,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:23,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:07:23,832 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-01 22:07:23,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:07:23,832 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-01 22:07:23,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 22:07:23,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-01 22:07:23,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 22:07:23,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:07:23,916 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-01 22:07:23,923 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-01 22:07:23,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 22:07:23,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:23,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 22:07:23,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-01-01 22:07:24,055 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-01 22:07:24,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 22:07:24,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-01-01 22:07:24,086 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:07:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:07:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2019-01-01 22:07:24,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:07:24,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:07:24,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:24,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 22:07:24,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:07:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:07:24,218 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-01-01 22:07:24,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 22:07:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-01 22:07:24,312 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 10 states. [2019-01-01 22:07:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:07:24,404 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-01 22:07:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-01 22:07:24,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 22 transitions. [2019-01-01 22:07:24,406 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:07:24,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-01 22:07:24,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:07:24,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:07:24,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:07:24,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:07:24,407 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:07:24,407 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:07:24,407 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:07:24,407 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:07:24,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:07:24,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:07:24,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:07:24,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:07:24 BoogieIcfgContainer [2019-01-01 22:07:24,414 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:07:24,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:07:24,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:07:24,415 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:07:24,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:07:18" (3/4) ... [2019-01-01 22:07:24,419 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:07:24,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:07:24,420 INFO L168 Benchmark]: Toolchain (without parser) took 6706.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 951.4 MB in the beginning and 789.6 MB in the end (delta: 161.8 MB). Peak memory consumption was 280.3 MB. Max. memory is 11.5 GB. [2019-01-01 22:07:24,421 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:07:24,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.66 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-01 22:07:24,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.60 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-01 22:07:24,423 INFO L168 Benchmark]: Boogie Preprocessor took 37.18 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-01 22:07:24,424 INFO L168 Benchmark]: RCFGBuilder took 580.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:07:24,426 INFO L168 Benchmark]: BuchiAutomizer took 5707.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 789.6 MB in the end (delta: 303.2 MB). Peak memory consumption was 303.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:07:24,427 INFO L168 Benchmark]: Witness Printer took 4.33 ms. Allocated memory is still 1.1 GB. Free memory is still 789.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:07:24,431 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 324.66 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 47.60 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 37.18 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. * RCFGBuilder took 580.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5707.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 789.6 MB in the end (delta: 303.2 MB). Peak memory consumption was 303.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.33 ms. Allocated memory is still 1.1 GB. Free memory is still 789.6 MB. 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.6s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 4.5s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. 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.3s 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: 34ms 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...