./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.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-30f4e4a [2019-11-28 03:05:02,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:05:02,883 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:05:02,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:05:02,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:05:02,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:05:02,906 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:05:02,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:05:02,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:05:02,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:05:02,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:05:02,923 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:05:02,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:05:02,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:05:02,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:05:02,931 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:05:02,933 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:05:02,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:05:02,939 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:05:02,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:05:02,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:05:02,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:05:02,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:05:02,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:05:02,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:05:02,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:05:02,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:05:02,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:05:02,962 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:05:02,963 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:05:02,963 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:05:02,964 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:05:02,965 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:05:02,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:05:02,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:05:02,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:05:02,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:05:02,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:05:02,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:05:02,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:05:02,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:05:02,973 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:05:02,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:05:02,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:05:03,002 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:05:03,002 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:05:03,002 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:05:03,002 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:05:03,002 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:05:03,003 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:05:03,003 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:05:03,003 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:05:03,003 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:05:03,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:05:03,004 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:05:03,004 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:05:03,004 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:05:03,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:05:03,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:05:03,005 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:05:03,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:05:03,006 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:05:03,006 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:05:03,006 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:05:03,007 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:05:03,007 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:05:03,007 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:05:03,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:05:03,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:05:03,008 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:05:03,008 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:05:03,009 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:05:03,009 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:05:03,010 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:05:03,010 INFO L138 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-11-28 03:05:03,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:05:03,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:05:03,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:05:03,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:05:03,346 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:05:03,347 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2019-11-28 03:05:03,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85f82dfdf/017424e07d8a412b853327c2480651a7/FLAGf51aa5a21 [2019-11-28 03:05:03,869 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:05:03,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2019-11-28 03:05:03,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85f82dfdf/017424e07d8a412b853327c2480651a7/FLAGf51aa5a21 [2019-11-28 03:05:04,258 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85f82dfdf/017424e07d8a412b853327c2480651a7 [2019-11-28 03:05:04,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:05:04,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:05:04,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:05:04,265 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:05:04,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:05:04,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad4f9b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04, skipping insertion in model container [2019-11-28 03:05:04,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,283 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:05:04,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:05:04,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:05:04,502 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:05:04,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:05:04,538 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:05:04,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04 WrapperNode [2019-11-28 03:05:04,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:05:04,539 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:05:04,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:05:04,540 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:05:04,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:05:04,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:05:04,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:05:04,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:05:04,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (1/1) ... [2019-11-28 03:05:04,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:05:04,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:05:04,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:05:04,658 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:05:04,659 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (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-11-28 03:05:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:05:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:05:04,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:05:04,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:05:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:05:04,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:05:04,943 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:05:04,944 INFO L297 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 03:05:04,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:04 BoogieIcfgContainer [2019-11-28 03:05:04,946 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:05:04,950 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:05:04,950 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:05:04,961 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:05:04,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:05:04,965 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:05:04" (1/3) ... [2019-11-28 03:05:04,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42fb868d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:05:04, skipping insertion in model container [2019-11-28 03:05:04,970 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:05:04,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:05:04" (2/3) ... [2019-11-28 03:05:04,971 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42fb868d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:05:04, skipping insertion in model container [2019-11-28 03:05:04,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:05:04,971 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:04" (3/3) ... [2019-11-28 03:05:04,976 INFO L371 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2019-11-28 03:05:05,056 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:05:05,056 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:05:05,056 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:05:05,057 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:05:05,057 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:05:05,057 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:05:05,057 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:05:05,058 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:05:05,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:05:05,094 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:05:05,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:05,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:05,101 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:05:05,101 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:05,101 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:05:05,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-28 03:05:05,103 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-28 03:05:05,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:05,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:05,103 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:05:05,103 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:05:05,110 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:05:05,110 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-11-28 03:05:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:05,115 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:05:05,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:05,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686064749] [2019-11-28 03:05:05,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,228 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-28 03:05:05,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:05,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114380476] [2019-11-28 03:05:05,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,249 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:05,251 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-28 03:05:05,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:05,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122470012] [2019-11-28 03:05:05,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:05,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:05,503 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:05:05,504 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:05:05,505 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:05:05,505 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:05:05,505 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:05:05,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:05,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:05:05,505 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:05:05,506 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2019-11-28 03:05:05,506 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:05:05,506 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:05:05,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:05,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:05,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:05,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:05,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:05,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:05,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:05:05,778 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:05:05,784 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:05,797 INFO L120 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-11-28 03:05:05,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:05,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:05,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:05,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:05,820 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:05,833 INFO L120 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-11-28 03:05:05,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:05,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:05,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:05,842 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:05,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:05,861 INFO L120 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-11-28 03:05:05,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:05,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:05,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,871 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:05,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:05,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:05,893 INFO L120 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-11-28 03:05:05,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:05,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:05:05,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:05,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:05:05,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:05:05,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:05:05,921 INFO L120 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 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:05,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:05:05,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:05:05,924 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:05:05,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:05:05,938 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:05:05,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:05:05,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:05:05,996 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-28 03:05:05,996 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:05:06,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:05:06,016 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:05:06,016 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:05:06,018 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-11-28 03:05:06,031 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-28 03:05:06,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:05:06,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:05:06,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:06,138 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-11-28 03:05:06,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2019-11-28 03:05:06,202 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-11-28 03:05:06,203 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-11-28 03:05:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:05:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2019-11-28 03:05:06,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-28 03:05:06,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:06,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-28 03:05:06,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:06,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-28 03:05:06,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:05:06,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2019-11-28 03:05:06,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:05:06,229 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2019-11-28 03:05:06,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 03:05:06,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 03:05:06,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-11-28 03:05:06,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:06,232 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:05:06,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-11-28 03:05:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-28 03:05:06,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-28 03:05:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-28 03:05:06,263 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:05:06,264 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-28 03:05:06,264 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:05:06,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-28 03:05:06,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 03:05:06,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:06,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:06,266 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 03:05:06,267 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:06,267 INFO L794 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:05:06,267 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-11-28 03:05:06,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:06,268 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-28 03:05:06,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:06,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208557207] [2019-11-28 03:05:06,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:06,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208557207] [2019-11-28 03:05:06,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:05:06,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:05:06,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673650732] [2019-11-28 03:05:06,349 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:06,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:06,350 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2019-11-28 03:05:06,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:06,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128807312] [2019-11-28 03:05:06,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:06,395 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:06,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:06,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 03:05:06,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 03:05:06,593 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 03:05:06,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:06,630 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2019-11-28 03:05:06,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 03:05:06,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-11-28 03:05:06,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:06,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2019-11-28 03:05:06,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-28 03:05:06,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-28 03:05:06,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2019-11-28 03:05:06,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:06,636 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-11-28 03:05:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2019-11-28 03:05:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2019-11-28 03:05:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-28 03:05:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-28 03:05:06,643 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 03:05:06,643 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-28 03:05:06,643 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:05:06,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-28 03:05:06,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:06,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:06,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:06,647 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:05:06,648 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:06,648 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:05:06,648 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-11-28 03:05:06,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:06,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2019-11-28 03:05:06,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:06,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091353789] [2019-11-28 03:05:06,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:06,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091353789] [2019-11-28 03:05:06,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045965115] [2019-11-28 03:05:06,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:05:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:06,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 03:05:06,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:05:06,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:06,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 03:05:06,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628315853] [2019-11-28 03:05:06,759 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:06,759 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2019-11-28 03:05:06,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:06,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718922874] [2019-11-28 03:05:06,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:06,781 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:06,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:06,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:05:06,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:05:06,959 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-28 03:05:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:06,997 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-28 03:05:07,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 03:05:07,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2019-11-28 03:05:07,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:07,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2019-11-28 03:05:07,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-28 03:05:07,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2019-11-28 03:05:07,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2019-11-28 03:05:07,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:07,005 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-28 03:05:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2019-11-28 03:05:07,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-28 03:05:07,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 03:05:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-28 03:05:07,009 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 03:05:07,009 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-28 03:05:07,009 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:05:07,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2019-11-28 03:05:07,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:07,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:07,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:07,012 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-28 03:05:07,012 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:07,012 INFO L794 eck$LassoCheckResult]: Stem: 205#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:05:07,012 INFO L796 eck$LassoCheckResult]: Loop: 210#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 217#L11-3 assume !!(main_~i~0 < 100000);call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 216#L2 assume !(0 == __VERIFIER_assert_~cond); 215#L2-3 havoc main_#t~mem2; 214#L14 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 210#L11-2 [2019-11-28 03:05:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash -974790727, now seen corresponding path program 1 times [2019-11-28 03:05:07,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963258400] [2019-11-28 03:05:07,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:07,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:05:07,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963258400] [2019-11-28 03:05:07,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234802712] [2019-11-28 03:05:07,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:05:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:07,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:05:07,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:05:07,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:07,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 03:05:07,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458702964] [2019-11-28 03:05:07,149 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:07,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,150 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2019-11-28 03:05:07,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299324306] [2019-11-28 03:05:07,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:07,366 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-11-28 03:05:07,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:07,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 03:05:07,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 03:05:07,369 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-28 03:05:07,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:07,448 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2019-11-28 03:05:07,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:05:07,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2019-11-28 03:05:07,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:07,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2019-11-28 03:05:07,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-28 03:05:07,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:05:07,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-11-28 03:05:07,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:07,456 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-28 03:05:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-11-28 03:05:07,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-11-28 03:05:07,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 03:05:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-11-28 03:05:07,467 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-28 03:05:07,467 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-11-28 03:05:07,468 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:05:07,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2019-11-28 03:05:07,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:07,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:07,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:07,474 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-28 03:05:07,474 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:07,475 INFO L794 eck$LassoCheckResult]: Stem: 315#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:05:07,475 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-11-28 03:05:07,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1970397435, now seen corresponding path program 2 times [2019-11-28 03:05:07,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460760755] [2019-11-28 03:05:07,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 03:05:07,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460760755] [2019-11-28 03:05:07,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449083121] [2019-11-28 03:05:07,578 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:05:07,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 03:05:07,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:05:07,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 03:05:07,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 03:05:07,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:05:07,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-28 03:05:07,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551520029] [2019-11-28 03:05:07,648 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:07,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,649 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2019-11-28 03:05:07,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937611167] [2019-11-28 03:05:07,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:07,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:07,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:07,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:05:07,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:05:07,862 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-28 03:05:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:07,930 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-11-28 03:05:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 03:05:07,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2019-11-28 03:05:07,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:07,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2019-11-28 03:05:07,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-28 03:05:07,937 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-28 03:05:07,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2019-11-28 03:05:07,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:07,937 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-11-28 03:05:07,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2019-11-28 03:05:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-11-28 03:05:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 03:05:07,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-11-28 03:05:07,944 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-28 03:05:07,946 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-11-28 03:05:07,947 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:05:07,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2019-11-28 03:05:07,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-28 03:05:07,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:05:07,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:05:07,952 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2019-11-28 03:05:07,953 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:05:07,953 INFO L794 eck$LassoCheckResult]: Stem: 461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 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-11-28 03:05:07,953 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-11-28 03:05:07,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:07,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1016089675, now seen corresponding path program 3 times [2019-11-28 03:05:07,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:07,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897159866] [2019-11-28 03:05:07,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:05:08,051 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 03:05:08,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897159866] [2019-11-28 03:05:08,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311572197] [2019-11-28 03:05:08,052 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:05:08,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-28 03:05:08,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 03:05:08,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 03:05:08,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:05:08,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 12 [2019-11-28 03:05:08,149 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:05:08,153 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:05:08,153 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:05:08,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-28 03:05:08,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:05:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-28 03:05:08,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 03:05:08,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-11-28 03:05:08,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736622340] [2019-11-28 03:05:08,201 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:05:08,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:05:08,202 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2019-11-28 03:05:08,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:05:08,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370936708] [2019-11-28 03:05:08,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:05:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:05:08,214 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:05:08,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:05:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:05:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:05:08,362 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 5 states. [2019-11-28 03:05:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:05:08,395 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-11-28 03:05:08,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:05:08,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. [2019-11-28 03:05:08,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:05:08,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-11-28 03:05:08,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:05:08,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:05:08,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:05:08,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:05:08,397 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:08,397 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:08,397 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:05:08,398 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:05:08,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:05:08,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:05:08,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:05:08,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:05:08 BoogieIcfgContainer [2019-11-28 03:05:08,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:05:08,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:05:08,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:05:08,406 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:05:08,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:05:04" (3/4) ... [2019-11-28 03:05:08,410 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:05:08,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:05:08,412 INFO L168 Benchmark]: Toolchain (without parser) took 4148.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -168.4 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:08,413 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:05:08,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.20 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:08,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:08,415 INFO L168 Benchmark]: Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:08,416 INFO L168 Benchmark]: RCFGBuilder took 288.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:08,417 INFO L168 Benchmark]: BuchiAutomizer took 3455.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:05:08,418 INFO L168 Benchmark]: Witness Printer took 5.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:05:08,422 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.20 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 94.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 288.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3455.06 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 70.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.6 MB). Peak memory consumption was 43.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.3s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. 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: 42 SDtfs, 62 SDslu, 48 SDs, 0 SdLazy, 127 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital88 mio100 ax100 hnf100 lsp93 ukn59 mio100 lsp69 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...