./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -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.25-8bd4bc6 [2020-07-29 01:41:48,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:41:48,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:41:49,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:41:49,007 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:41:49,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:41:49,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:41:49,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:41:49,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:41:49,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:41:49,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:41:49,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:41:49,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:41:49,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:41:49,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:41:49,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:41:49,042 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:41:49,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:41:49,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:41:49,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:41:49,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:41:49,059 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:41:49,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:41:49,062 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:41:49,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:41:49,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:41:49,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:41:49,068 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:41:49,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:41:49,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:41:49,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:41:49,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:41:49,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:41:49,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:41:49,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:41:49,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:41:49,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:41:49,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:41:49,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:41:49,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:41:49,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:41:49,078 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 01:41:49,116 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:41:49,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:41:49,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:41:49,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:41:49,121 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:41:49,122 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:41:49,122 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:41:49,122 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:41:49,122 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:41:49,123 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:41:49,124 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:41:49,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:41:49,124 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:41:49,125 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:41:49,125 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:41:49,125 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:41:49,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:41:49,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:41:49,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:41:49,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:41:49,127 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:41:49,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:41:49,127 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:41:49,128 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:41:49,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:41:49,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:41:49,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:41:49,129 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:41:49,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:41:49,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:41:49,130 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:41:49,131 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:41:49,132 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:41:49,132 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 [2020-07-29 01:41:49,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:41:49,447 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:41:49,451 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:41:49,452 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:41:49,452 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:41:49,453 INFO L429 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 [2020-07-29 01:41:49,523 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5095552b/d7b851985ed14101a34164e656e12ab2/FLAGfcc65cf7b [2020-07-29 01:41:49,958 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:41:49,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2020-07-29 01:41:49,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5095552b/d7b851985ed14101a34164e656e12ab2/FLAGfcc65cf7b [2020-07-29 01:41:50,338 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5095552b/d7b851985ed14101a34164e656e12ab2 [2020-07-29 01:41:50,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:41:50,343 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:41:50,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:41:50,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:41:50,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:41:50,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cfec9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50, skipping insertion in model container [2020-07-29 01:41:50,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,360 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:41:50,376 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:41:50,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:41:50,545 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:41:50,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:41:50,586 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:41:50,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50 WrapperNode [2020-07-29 01:41:50,586 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:41:50,587 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:41:50,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:41:50,587 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:41:50,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,675 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:41:50,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:41:50,676 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:41:50,676 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:41:50,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (1/1) ... [2020-07-29 01:41:50,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:41:50,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:41:50,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:41:50,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:41:50,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (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 [2020-07-29 01:41:50,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:41:50,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:41:50,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:41:50,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:41:50,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:41:50,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:41:51,038 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:41:51,039 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:41:51,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:51 BoogieIcfgContainer [2020-07-29 01:41:51,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:41:51,043 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:41:51,043 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:41:51,047 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:41:51,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:51,048 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:41:50" (1/3) ... [2020-07-29 01:41:51,049 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22ecf806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:41:51, skipping insertion in model container [2020-07-29 01:41:51,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:51,049 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:41:50" (2/3) ... [2020-07-29 01:41:51,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22ecf806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:41:51, skipping insertion in model container [2020-07-29 01:41:51,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:41:51,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:51" (3/3) ... [2020-07-29 01:41:51,051 INFO L371 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2020-07-29 01:41:51,111 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:41:51,112 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:41:51,112 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:41:51,112 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:41:51,112 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:41:51,112 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:41:51,112 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:41:51,112 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:41:51,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:41:51,157 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:41:51,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:51,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:51,164 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:41:51,164 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:41:51,164 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:41:51,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:41:51,169 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:41:51,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:51,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:51,170 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:41:51,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:41:51,179 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 [2020-07-29 01:41:51,180 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 [2020-07-29 01:41:51,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:51,186 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-07-29 01:41:51,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:51,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318441863] [2020-07-29 01:41:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:51,287 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:51,297 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:51,316 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:51,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-07-29 01:41:51,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:51,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947863506] [2020-07-29 01:41:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:51,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:51,341 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:51,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:51,349 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-07-29 01:41:51,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:51,349 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858853553] [2020-07-29 01:41:51,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:51,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:51,406 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:51,410 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:51,638 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:41:51,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:41:51,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:41:51,640 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:41:51,640 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:41:51,640 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:51,640 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:41:51,640 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:41:51,641 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2020-07-29 01:41:51,641 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:41:51,641 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:41:51,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:51,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:51,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:51,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:51,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:51,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:51,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:41:52,100 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:41:52,106 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) [2020-07-29 01:41:52,113 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:52,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:52,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:52,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:52,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:52,123 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:52,123 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:41:52,130 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) [2020-07-29 01:41:52,177 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 [2020-07-29 01:41:52,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:52,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:52,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:52,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:52,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:52,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:52,189 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) [2020-07-29 01:41:52,238 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 [2020-07-29 01:41:52,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:52,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:52,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:52,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:52,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:52,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:52,255 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 [2020-07-29 01:41:52,301 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 [2020-07-29 01:41:52,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:52,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:41:52,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:52,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:52,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:52,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:41:52,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:41:52,308 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) [2020-07-29 01:41:52,351 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 [2020-07-29 01:41:52,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:41:52,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:41:52,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:41:52,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:41:52,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:41:52,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:52,374 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:41:52,425 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2020-07-29 01:41:52,425 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:41:52,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:41:52,436 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:41:52,437 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:41:52,438 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1) = -8*ULTIMATE.start_main_~i~0 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 Supporting invariants [] [2020-07-29 01:41:52,483 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:41:52,488 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);" "main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0;" [2020-07-29 01:41:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:52,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:41:52,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:52,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:41:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:52,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:52,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 01:41:52,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} 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; {25#unseeded} is VALID [2020-07-29 01:41:52,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:52,581 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:41:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:52,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:52,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 8) ULTIMATE.start_main_~i~0) (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0.base|))))} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {51#(and (<= (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0.base|)) (+ oldRank0 (* 8 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000) (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0.base|)))} is VALID [2020-07-29 01:41:52,676 INFO L280 TraceCheckUtils]: 1: Hoare triple {51#(and (<= (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0.base|)) (+ oldRank0 (* 8 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 100000) (<= 4 (select |#length| |ULTIMATE.start_main_~#a~0.base|)))} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {43#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 8) ULTIMATE.start_main_~i~0) (* 199999 (select |#length| |ULTIMATE.start_main_~#a~0.base|))))) unseeded)} is VALID [2020-07-29 01:41:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:52,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:41:52,699 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:52,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,710 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 [2020-07-29 01:41:52,712 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 01:41:52,789 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 29 states and 41 transitions. Complement of second has 8 states. [2020-07-29 01:41:52,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:41:52,790 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:52,791 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:41:52,793 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:41:52,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:52,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:52,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:41:52,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:41:52,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:52,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:52,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 41 transitions. [2020-07-29 01:41:52,801 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:41:52,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:52,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:52,804 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 01:41:52,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:41:52,809 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:41:52,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:41:52,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:41:52,812 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:41:52,812 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 41 transitions. cyclomatic complexity: 15 [2020-07-29 01:41:52,814 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:41:52,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:52,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:52,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:52,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:41:52,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:41:52,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:41:52,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:41:52,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:41:52,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:41:52,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:41:52,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:41:52,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:41:52,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:41:52,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:41:52,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:41:52,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:41:52,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:41:52,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:41:52,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:52,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:52,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:52,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:41:52,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:41:52,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:41:52,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:41:52,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:41:52,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:41:52,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:52,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:52,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:41:52,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:52,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:52,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:41:52,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:41:52,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:41:52,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 6 letters. Loop has 5 letters. [2020-07-29 01:41:52,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:41:52,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:41:52,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 5 letters. [2020-07-29 01:41:52,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 5 letters. [2020-07-29 01:41:52,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:41:52,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:41:52,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 5 letters. [2020-07-29 01:41:52,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 41 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:41:52,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,871 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:41:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:41:52,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-29 01:41:52,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:41:52,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:41:52,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:41:52,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:41:52,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. cyclomatic complexity: 15 [2020-07-29 01:41:52,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:41:52,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2020-07-29 01:41:52,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:41:52,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:41:52,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 01:41:52,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:52,901 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:41:52,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 01:41:52,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:41:52,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:52,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 01:41:52,935 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 01:41:52,937 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 01:41:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:52,942 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:41:52,943 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:41:52,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:52,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:52,944 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 01:41:52,944 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 01:41:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:52,948 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:41:52,948 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:41:52,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:52,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:52,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:52,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:52,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:41:52,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:41:52,956 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:41:52,956 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:41:52,956 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:41:52,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:41:52,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:41:52,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:52,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:52,959 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:41:52,959 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:41:52,960 INFO L794 eck$LassoCheckResult]: Stem: 101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 97#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; 98#L7-3 assume !(main_~i~0 < 100000); 105#L7-4 main_~i~0 := 0; 104#L11-3 [2020-07-29 01:41:52,961 INFO L796 eck$LassoCheckResult]: Loop: 104#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; 103#L2 assume !(0 == __VERIFIER_assert_~cond); 95#L2-3 havoc main_#t~mem2; 96#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); 106#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 104#L11-3 [2020-07-29 01:41:52,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:52,961 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-07-29 01:41:52,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:52,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731546019] [2020-07-29 01:41:52,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:53,054 INFO L280 TraceCheckUtils]: 0: Hoare triple {134#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {134#true} is VALID [2020-07-29 01:41:53,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#true} 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; {136#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:53,057 INFO L280 TraceCheckUtils]: 2: Hoare triple {136#(= 0 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 < 100000); {135#false} is VALID [2020-07-29 01:41:53,058 INFO L280 TraceCheckUtils]: 3: Hoare triple {135#false} main_~i~0 := 0; {135#false} is VALID [2020-07-29 01:41:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:53,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731546019] [2020-07-29 01:41:53,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:41:53,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:41:53,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891796810] [2020-07-29 01:41:53,066 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:41:53,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:53,067 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2020-07-29 01:41:53,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:53,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724375363] [2020-07-29 01:41:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:53,095 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:53,116 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:53,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:53,332 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2020-07-29 01:41:53,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:53,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:41:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:41:53,342 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:41:53,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:53,392 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-29 01:41:53,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:41:53,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:41:53,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:53,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2020-07-29 01:41:53,401 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:53,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2020-07-29 01:41:53,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:41:53,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:41:53,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2020-07-29 01:41:53,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:53,403 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-29 01:41:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2020-07-29 01:41:53,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2020-07-29 01:41:53,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:53,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 19 transitions. Second operand 15 states. [2020-07-29 01:41:53,407 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 19 transitions. Second operand 15 states. [2020-07-29 01:41:53,407 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 15 states. [2020-07-29 01:41:53,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:53,410 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:41:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:41:53,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:53,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:53,411 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 17 states and 19 transitions. [2020-07-29 01:41:53,412 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 17 states and 19 transitions. [2020-07-29 01:41:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:53,416 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2020-07-29 01:41:53,416 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-29 01:41:53,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:53,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:53,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:53,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:41:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-29 01:41:53,419 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:41:53,419 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:41:53,419 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:41:53,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:41:53,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:53,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:53,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:53,421 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:41:53,422 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:41:53,422 INFO L794 eck$LassoCheckResult]: Stem: 164#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 158#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; 159#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 162#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 163#L7-3 assume !(main_~i~0 < 100000); 167#L7-4 main_~i~0 := 0; 168#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; 172#L2 assume !(0 == __VERIFIER_assert_~cond); 171#L2-3 havoc main_#t~mem2; 169#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); 170#L11-2 [2020-07-29 01:41:53,422 INFO L796 eck$LassoCheckResult]: Loop: 170#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 166#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; 165#L2 assume !(0 == __VERIFIER_assert_~cond); 160#L2-3 havoc main_#t~mem2; 161#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); 170#L11-2 [2020-07-29 01:41:53,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2020-07-29 01:41:53,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:53,423 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486897469] [2020-07-29 01:41:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:53,484 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {210#true} is VALID [2020-07-29 01:41:53,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} 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; {212#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:53,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {212#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {212#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:53,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {212#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {213#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:53,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {213#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 100000); {211#false} is VALID [2020-07-29 01:41:53,489 INFO L280 TraceCheckUtils]: 5: Hoare triple {211#false} main_~i~0 := 0; {211#false} is VALID [2020-07-29 01:41:53,489 INFO L280 TraceCheckUtils]: 6: Hoare triple {211#false} 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; {211#false} is VALID [2020-07-29 01:41:53,490 INFO L280 TraceCheckUtils]: 7: Hoare triple {211#false} assume !(0 == __VERIFIER_assert_~cond); {211#false} is VALID [2020-07-29 01:41:53,490 INFO L280 TraceCheckUtils]: 8: Hoare triple {211#false} havoc main_#t~mem2; {211#false} is VALID [2020-07-29 01:41:53,491 INFO L280 TraceCheckUtils]: 9: Hoare triple {211#false} 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#false} is VALID [2020-07-29 01:41:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:53,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486897469] [2020-07-29 01:41:53,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904733818] [2020-07-29 01:41:53,492 INFO L95 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 [2020-07-29 01:41:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:53,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:41:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:53,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:53,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {210#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {210#true} is VALID [2020-07-29 01:41:53,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#true} 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; {220#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:41:53,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {220#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {220#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:41:53,614 INFO L280 TraceCheckUtils]: 3: Hoare triple {220#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {213#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:53,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {213#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < 100000); {211#false} is VALID [2020-07-29 01:41:53,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {211#false} main_~i~0 := 0; {211#false} is VALID [2020-07-29 01:41:53,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {211#false} 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; {211#false} is VALID [2020-07-29 01:41:53,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {211#false} assume !(0 == __VERIFIER_assert_~cond); {211#false} is VALID [2020-07-29 01:41:53,616 INFO L280 TraceCheckUtils]: 8: Hoare triple {211#false} havoc main_#t~mem2; {211#false} is VALID [2020-07-29 01:41:53,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {211#false} 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#false} is VALID [2020-07-29 01:41:53,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:41:53,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:41:53,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-29 01:41:53,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356148149] [2020-07-29 01:41:53,618 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:41:53,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2020-07-29 01:41:53,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:53,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907253410] [2020-07-29 01:41:53,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:53,627 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:53,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:53,637 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:53,849 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2020-07-29 01:41:53,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:41:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:41:53,854 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-07-29 01:41:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:53,943 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-29 01:41:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:41:53,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:41:53,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:53,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2020-07-29 01:41:53,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:53,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2020-07-29 01:41:53,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 01:41:53,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 01:41:53,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2020-07-29 01:41:53,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:53,965 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-29 01:41:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2020-07-29 01:41:53,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-07-29 01:41:53,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:53,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 26 transitions. Second operand 22 states. [2020-07-29 01:41:53,968 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 26 transitions. Second operand 22 states. [2020-07-29 01:41:53,968 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 22 states. [2020-07-29 01:41:53,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:53,970 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-29 01:41:53,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:41:53,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:53,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:53,971 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 24 states and 26 transitions. [2020-07-29 01:41:53,971 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 24 states and 26 transitions. [2020-07-29 01:41:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:53,973 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-29 01:41:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-29 01:41:53,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:53,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:53,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:53,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:53,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:41:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2020-07-29 01:41:53,975 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:41:53,976 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2020-07-29 01:41:53,976 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:41:53,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2020-07-29 01:41:53,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:53,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:53,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:53,978 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-07-29 01:41:53,978 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:41:53,978 INFO L794 eck$LassoCheckResult]: Stem: 274#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 270#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; 271#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 281#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 282#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 272#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 273#L7-3 assume !(main_~i~0 < 100000); 277#L7-4 main_~i~0 := 0; 278#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; 289#L2 assume !(0 == __VERIFIER_assert_~cond); 288#L2-3 havoc main_#t~mem2; 287#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); 280#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 276#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; 275#L2 assume !(0 == __VERIFIER_assert_~cond); 268#L2-3 havoc main_#t~mem2; 269#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); 279#L11-2 [2020-07-29 01:41:53,978 INFO L796 eck$LassoCheckResult]: Loop: 279#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 286#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; 285#L2 assume !(0 == __VERIFIER_assert_~cond); 284#L2-3 havoc main_#t~mem2; 283#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); 279#L11-2 [2020-07-29 01:41:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash -974790727, now seen corresponding path program 1 times [2020-07-29 01:41:53,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:53,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306111746] [2020-07-29 01:41:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:54,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {341#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {341#true} is VALID [2020-07-29 01:41:54,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {341#true} 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; {343#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:54,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {343#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {343#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:54,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {343#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {344#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,042 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {344#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,043 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {345#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:54,043 INFO L280 TraceCheckUtils]: 6: Hoare triple {345#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < 100000); {342#false} is VALID [2020-07-29 01:41:54,044 INFO L280 TraceCheckUtils]: 7: Hoare triple {342#false} main_~i~0 := 0; {342#false} is VALID [2020-07-29 01:41:54,044 INFO L280 TraceCheckUtils]: 8: Hoare triple {342#false} 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; {342#false} is VALID [2020-07-29 01:41:54,044 INFO L280 TraceCheckUtils]: 9: Hoare triple {342#false} assume !(0 == __VERIFIER_assert_~cond); {342#false} is VALID [2020-07-29 01:41:54,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {342#false} havoc main_#t~mem2; {342#false} is VALID [2020-07-29 01:41:54,045 INFO L280 TraceCheckUtils]: 11: Hoare triple {342#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {342#false} is VALID [2020-07-29 01:41:54,045 INFO L280 TraceCheckUtils]: 12: Hoare triple {342#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {342#false} is VALID [2020-07-29 01:41:54,045 INFO L280 TraceCheckUtils]: 13: Hoare triple {342#false} 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; {342#false} is VALID [2020-07-29 01:41:54,045 INFO L280 TraceCheckUtils]: 14: Hoare triple {342#false} assume !(0 == __VERIFIER_assert_~cond); {342#false} is VALID [2020-07-29 01:41:54,046 INFO L280 TraceCheckUtils]: 15: Hoare triple {342#false} havoc main_#t~mem2; {342#false} is VALID [2020-07-29 01:41:54,046 INFO L280 TraceCheckUtils]: 16: Hoare triple {342#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {342#false} is VALID [2020-07-29 01:41:54,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 01:41:54,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306111746] [2020-07-29 01:41:54,047 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218345032] [2020-07-29 01:41:54,047 INFO L95 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 [2020-07-29 01:41:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:54,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:41:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:54,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:54,173 INFO L280 TraceCheckUtils]: 0: Hoare triple {341#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {341#true} is VALID [2020-07-29 01:41:54,175 INFO L280 TraceCheckUtils]: 1: Hoare triple {341#true} 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; {352#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:41:54,176 INFO L280 TraceCheckUtils]: 2: Hoare triple {352#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {352#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:41:54,177 INFO L280 TraceCheckUtils]: 3: Hoare triple {352#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {344#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,178 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {344#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,179 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {345#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:54,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {345#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < 100000); {342#false} is VALID [2020-07-29 01:41:54,180 INFO L280 TraceCheckUtils]: 7: Hoare triple {342#false} main_~i~0 := 0; {342#false} is VALID [2020-07-29 01:41:54,180 INFO L280 TraceCheckUtils]: 8: Hoare triple {342#false} 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; {342#false} is VALID [2020-07-29 01:41:54,181 INFO L280 TraceCheckUtils]: 9: Hoare triple {342#false} assume !(0 == __VERIFIER_assert_~cond); {342#false} is VALID [2020-07-29 01:41:54,181 INFO L280 TraceCheckUtils]: 10: Hoare triple {342#false} havoc main_#t~mem2; {342#false} is VALID [2020-07-29 01:41:54,181 INFO L280 TraceCheckUtils]: 11: Hoare triple {342#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {342#false} is VALID [2020-07-29 01:41:54,181 INFO L280 TraceCheckUtils]: 12: Hoare triple {342#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {342#false} is VALID [2020-07-29 01:41:54,182 INFO L280 TraceCheckUtils]: 13: Hoare triple {342#false} 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; {342#false} is VALID [2020-07-29 01:41:54,182 INFO L280 TraceCheckUtils]: 14: Hoare triple {342#false} assume !(0 == __VERIFIER_assert_~cond); {342#false} is VALID [2020-07-29 01:41:54,182 INFO L280 TraceCheckUtils]: 15: Hoare triple {342#false} havoc main_#t~mem2; {342#false} is VALID [2020-07-29 01:41:54,183 INFO L280 TraceCheckUtils]: 16: Hoare triple {342#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {342#false} is VALID [2020-07-29 01:41:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 01:41:54,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:41:54,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-29 01:41:54,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861646685] [2020-07-29 01:41:54,184 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:41:54,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2020-07-29 01:41:54,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:54,186 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527036849] [2020-07-29 01:41:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:54,193 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:54,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:54,201 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:54,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:54,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:41:54,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:41:54,350 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 6 states. [2020-07-29 01:41:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:54,458 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-29 01:41:54,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:41:54,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:41:54,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:54,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2020-07-29 01:41:54,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:54,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2020-07-29 01:41:54,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:41:54,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:41:54,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2020-07-29 01:41:54,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:54,484 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-29 01:41:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2020-07-29 01:41:54,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2020-07-29 01:41:54,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:54,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 33 transitions. Second operand 29 states. [2020-07-29 01:41:54,488 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 33 transitions. Second operand 29 states. [2020-07-29 01:41:54,488 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 29 states. [2020-07-29 01:41:54,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:54,492 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-29 01:41:54,492 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-29 01:41:54,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:54,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:54,492 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states and 33 transitions. [2020-07-29 01:41:54,492 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states and 33 transitions. [2020-07-29 01:41:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:54,496 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-29 01:41:54,496 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-29 01:41:54,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:54,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:54,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:54,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:41:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-29 01:41:54,502 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-29 01:41:54,502 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-29 01:41:54,502 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:41:54,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:41:54,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:54,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:54,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:54,506 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2020-07-29 01:41:54,506 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:41:54,507 INFO L794 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 428#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; 429#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 442#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 443#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 432#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 433#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 445#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 444#L7-3 assume !(main_~i~0 < 100000); 437#L7-4 main_~i~0 := 0; 436#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; 435#L2 assume !(0 == __VERIFIER_assert_~cond); 430#L2-3 havoc main_#t~mem2; 431#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); 440#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 441#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; 456#L2 assume !(0 == __VERIFIER_assert_~cond); 455#L2-3 havoc main_#t~mem2; 450#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); 451#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 454#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; 453#L2 assume !(0 == __VERIFIER_assert_~cond); 452#L2-3 havoc main_#t~mem2; 438#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); 439#L11-2 [2020-07-29 01:41:54,507 INFO L796 eck$LassoCheckResult]: Loop: 439#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 449#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; 448#L2 assume !(0 == __VERIFIER_assert_~cond); 447#L2-3 havoc main_#t~mem2; 446#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); 439#L11-2 [2020-07-29 01:41:54,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:54,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1970397435, now seen corresponding path program 2 times [2020-07-29 01:41:54,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:54,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430128819] [2020-07-29 01:41:54,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:54,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {522#true} is VALID [2020-07-29 01:41:54,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#true} 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; {524#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:54,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {524#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {524#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:54,610 INFO L280 TraceCheckUtils]: 3: Hoare triple {524#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {525#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {525#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {525#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {525#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {526#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:54,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {526#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {526#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:54,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {526#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {527#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:41:54,615 INFO L280 TraceCheckUtils]: 8: Hoare triple {527#(<= ULTIMATE.start_main_~i~0 3)} assume !(main_~i~0 < 100000); {523#false} is VALID [2020-07-29 01:41:54,615 INFO L280 TraceCheckUtils]: 9: Hoare triple {523#false} main_~i~0 := 0; {523#false} is VALID [2020-07-29 01:41:54,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {523#false} 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; {523#false} is VALID [2020-07-29 01:41:54,616 INFO L280 TraceCheckUtils]: 11: Hoare triple {523#false} assume !(0 == __VERIFIER_assert_~cond); {523#false} is VALID [2020-07-29 01:41:54,616 INFO L280 TraceCheckUtils]: 12: Hoare triple {523#false} havoc main_#t~mem2; {523#false} is VALID [2020-07-29 01:41:54,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {523#false} is VALID [2020-07-29 01:41:54,617 INFO L280 TraceCheckUtils]: 14: Hoare triple {523#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {523#false} is VALID [2020-07-29 01:41:54,617 INFO L280 TraceCheckUtils]: 15: Hoare triple {523#false} 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; {523#false} is VALID [2020-07-29 01:41:54,617 INFO L280 TraceCheckUtils]: 16: Hoare triple {523#false} assume !(0 == __VERIFIER_assert_~cond); {523#false} is VALID [2020-07-29 01:41:54,618 INFO L280 TraceCheckUtils]: 17: Hoare triple {523#false} havoc main_#t~mem2; {523#false} is VALID [2020-07-29 01:41:54,618 INFO L280 TraceCheckUtils]: 18: Hoare triple {523#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {523#false} is VALID [2020-07-29 01:41:54,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {523#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {523#false} is VALID [2020-07-29 01:41:54,618 INFO L280 TraceCheckUtils]: 20: Hoare triple {523#false} 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; {523#false} is VALID [2020-07-29 01:41:54,619 INFO L280 TraceCheckUtils]: 21: Hoare triple {523#false} assume !(0 == __VERIFIER_assert_~cond); {523#false} is VALID [2020-07-29 01:41:54,619 INFO L280 TraceCheckUtils]: 22: Hoare triple {523#false} havoc main_#t~mem2; {523#false} is VALID [2020-07-29 01:41:54,619 INFO L280 TraceCheckUtils]: 23: Hoare triple {523#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {523#false} is VALID [2020-07-29 01:41:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-29 01:41:54,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430128819] [2020-07-29 01:41:54,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178035106] [2020-07-29 01:41:54,621 INFO L93 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 [2020-07-29 01:41:54,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:41:54,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:41:54,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:41:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:54,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:54,814 INFO L280 TraceCheckUtils]: 0: Hoare triple {522#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {522#true} is VALID [2020-07-29 01:41:54,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {522#true} 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; {534#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:41:54,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {534#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {534#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:41:54,818 INFO L280 TraceCheckUtils]: 3: Hoare triple {534#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {525#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,819 INFO L280 TraceCheckUtils]: 4: Hoare triple {525#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {525#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:54,820 INFO L280 TraceCheckUtils]: 5: Hoare triple {525#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {526#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:54,821 INFO L280 TraceCheckUtils]: 6: Hoare triple {526#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {526#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:54,822 INFO L280 TraceCheckUtils]: 7: Hoare triple {526#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {527#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:41:54,823 INFO L280 TraceCheckUtils]: 8: Hoare triple {527#(<= ULTIMATE.start_main_~i~0 3)} assume !(main_~i~0 < 100000); {523#false} is VALID [2020-07-29 01:41:54,823 INFO L280 TraceCheckUtils]: 9: Hoare triple {523#false} main_~i~0 := 0; {523#false} is VALID [2020-07-29 01:41:54,823 INFO L280 TraceCheckUtils]: 10: Hoare triple {523#false} 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; {523#false} is VALID [2020-07-29 01:41:54,824 INFO L280 TraceCheckUtils]: 11: Hoare triple {523#false} assume !(0 == __VERIFIER_assert_~cond); {523#false} is VALID [2020-07-29 01:41:54,824 INFO L280 TraceCheckUtils]: 12: Hoare triple {523#false} havoc main_#t~mem2; {523#false} is VALID [2020-07-29 01:41:54,824 INFO L280 TraceCheckUtils]: 13: Hoare triple {523#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {523#false} is VALID [2020-07-29 01:41:54,824 INFO L280 TraceCheckUtils]: 14: Hoare triple {523#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {523#false} is VALID [2020-07-29 01:41:54,825 INFO L280 TraceCheckUtils]: 15: Hoare triple {523#false} 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; {523#false} is VALID [2020-07-29 01:41:54,825 INFO L280 TraceCheckUtils]: 16: Hoare triple {523#false} assume !(0 == __VERIFIER_assert_~cond); {523#false} is VALID [2020-07-29 01:41:54,826 INFO L280 TraceCheckUtils]: 17: Hoare triple {523#false} havoc main_#t~mem2; {523#false} is VALID [2020-07-29 01:41:54,826 INFO L280 TraceCheckUtils]: 18: Hoare triple {523#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {523#false} is VALID [2020-07-29 01:41:54,827 INFO L280 TraceCheckUtils]: 19: Hoare triple {523#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {523#false} is VALID [2020-07-29 01:41:54,827 INFO L280 TraceCheckUtils]: 20: Hoare triple {523#false} 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; {523#false} is VALID [2020-07-29 01:41:54,827 INFO L280 TraceCheckUtils]: 21: Hoare triple {523#false} assume !(0 == __VERIFIER_assert_~cond); {523#false} is VALID [2020-07-29 01:41:54,828 INFO L280 TraceCheckUtils]: 22: Hoare triple {523#false} havoc main_#t~mem2; {523#false} is VALID [2020-07-29 01:41:54,828 INFO L280 TraceCheckUtils]: 23: Hoare triple {523#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {523#false} is VALID [2020-07-29 01:41:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-29 01:41:54,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:41:54,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-29 01:41:54,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392861789] [2020-07-29 01:41:54,838 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:41:54,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2020-07-29 01:41:54,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:54,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050138381] [2020-07-29 01:41:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:54,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:54,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:54,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:55,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:55,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:41:55,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:41:55,043 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 7 states. [2020-07-29 01:41:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:55,191 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-29 01:41:55,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:41:55,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:41:55,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:55,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2020-07-29 01:41:55,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:55,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2020-07-29 01:41:55,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2020-07-29 01:41:55,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2020-07-29 01:41:55,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2020-07-29 01:41:55,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:55,223 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2020-07-29 01:41:55,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2020-07-29 01:41:55,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-29 01:41:55,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:41:55,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 40 transitions. Second operand 36 states. [2020-07-29 01:41:55,226 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 40 transitions. Second operand 36 states. [2020-07-29 01:41:55,226 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 36 states. [2020-07-29 01:41:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:55,227 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-29 01:41:55,227 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-29 01:41:55,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:55,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:55,228 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states and 40 transitions. [2020-07-29 01:41:55,228 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states and 40 transitions. [2020-07-29 01:41:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:55,230 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-29 01:41:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-29 01:41:55,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:41:55,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:41:55,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:41:55,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:41:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-29 01:41:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-29 01:41:55,232 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-29 01:41:55,232 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-29 01:41:55,232 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:41:55,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2020-07-29 01:41:55,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:41:55,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:41:55,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:41:55,234 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2020-07-29 01:41:55,234 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-07-29 01:41:55,234 INFO L794 eck$LassoCheckResult]: Stem: 644#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 638#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; 639#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 651#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 652#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 642#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 643#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 656#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 655#L7-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 654#L7-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 653#L7-3 assume !(main_~i~0 < 100000); 647#L7-4 main_~i~0 := 0; 648#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; 673#L2 assume !(0 == __VERIFIER_assert_~cond); 672#L2-3 havoc main_#t~mem2; 671#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); 650#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 646#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; 645#L2 assume !(0 == __VERIFIER_assert_~cond); 640#L2-3 havoc main_#t~mem2; 641#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); 649#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 670#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; 669#L2 assume !(0 == __VERIFIER_assert_~cond); 668#L2-3 havoc main_#t~mem2; 667#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); 666#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 665#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; 664#L2 assume !(0 == __VERIFIER_assert_~cond); 663#L2-3 havoc main_#t~mem2; 662#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); 658#L11-2 [2020-07-29 01:41:55,235 INFO L796 eck$LassoCheckResult]: Loop: 658#L11-2 main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; 661#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; 660#L2 assume !(0 == __VERIFIER_assert_~cond); 659#L2-3 havoc main_#t~mem2; 657#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); 658#L11-2 [2020-07-29 01:41:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1016089675, now seen corresponding path program 3 times [2020-07-29 01:41:55,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:55,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348326243] [2020-07-29 01:41:55,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:55,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {753#true} is VALID [2020-07-29 01:41:55,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#true} 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; {755#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:55,313 INFO L280 TraceCheckUtils]: 2: Hoare triple {755#(= 0 ULTIMATE.start_main_~i~0)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {755#(= 0 ULTIMATE.start_main_~i~0)} is VALID [2020-07-29 01:41:55,314 INFO L280 TraceCheckUtils]: 3: Hoare triple {755#(= 0 ULTIMATE.start_main_~i~0)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {756#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:55,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {756#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {756#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:41:55,315 INFO L280 TraceCheckUtils]: 5: Hoare triple {756#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {757#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:55,316 INFO L280 TraceCheckUtils]: 6: Hoare triple {757#(<= ULTIMATE.start_main_~i~0 2)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {757#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:41:55,317 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(<= ULTIMATE.start_main_~i~0 2)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {758#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:41:55,317 INFO L280 TraceCheckUtils]: 8: Hoare triple {758#(<= ULTIMATE.start_main_~i~0 3)} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {758#(<= ULTIMATE.start_main_~i~0 3)} is VALID [2020-07-29 01:41:55,318 INFO L280 TraceCheckUtils]: 9: Hoare triple {758#(<= ULTIMATE.start_main_~i~0 3)} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {759#(<= ULTIMATE.start_main_~i~0 4)} is VALID [2020-07-29 01:41:55,319 INFO L280 TraceCheckUtils]: 10: Hoare triple {759#(<= ULTIMATE.start_main_~i~0 4)} assume !(main_~i~0 < 100000); {754#false} is VALID [2020-07-29 01:41:55,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {754#false} main_~i~0 := 0; {754#false} is VALID [2020-07-29 01:41:55,319 INFO L280 TraceCheckUtils]: 12: Hoare triple {754#false} 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; {754#false} is VALID [2020-07-29 01:41:55,320 INFO L280 TraceCheckUtils]: 13: Hoare triple {754#false} assume !(0 == __VERIFIER_assert_~cond); {754#false} is VALID [2020-07-29 01:41:55,320 INFO L280 TraceCheckUtils]: 14: Hoare triple {754#false} havoc main_#t~mem2; {754#false} is VALID [2020-07-29 01:41:55,320 INFO L280 TraceCheckUtils]: 15: Hoare triple {754#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {754#false} is VALID [2020-07-29 01:41:55,320 INFO L280 TraceCheckUtils]: 16: Hoare triple {754#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {754#false} is VALID [2020-07-29 01:41:55,321 INFO L280 TraceCheckUtils]: 17: Hoare triple {754#false} 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; {754#false} is VALID [2020-07-29 01:41:55,321 INFO L280 TraceCheckUtils]: 18: Hoare triple {754#false} assume !(0 == __VERIFIER_assert_~cond); {754#false} is VALID [2020-07-29 01:41:55,321 INFO L280 TraceCheckUtils]: 19: Hoare triple {754#false} havoc main_#t~mem2; {754#false} is VALID [2020-07-29 01:41:55,321 INFO L280 TraceCheckUtils]: 20: Hoare triple {754#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {754#false} is VALID [2020-07-29 01:41:55,322 INFO L280 TraceCheckUtils]: 21: Hoare triple {754#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {754#false} is VALID [2020-07-29 01:41:55,322 INFO L280 TraceCheckUtils]: 22: Hoare triple {754#false} 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; {754#false} is VALID [2020-07-29 01:41:55,322 INFO L280 TraceCheckUtils]: 23: Hoare triple {754#false} assume !(0 == __VERIFIER_assert_~cond); {754#false} is VALID [2020-07-29 01:41:55,322 INFO L280 TraceCheckUtils]: 24: Hoare triple {754#false} havoc main_#t~mem2; {754#false} is VALID [2020-07-29 01:41:55,322 INFO L280 TraceCheckUtils]: 25: Hoare triple {754#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {754#false} is VALID [2020-07-29 01:41:55,323 INFO L280 TraceCheckUtils]: 26: Hoare triple {754#false} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {754#false} is VALID [2020-07-29 01:41:55,323 INFO L280 TraceCheckUtils]: 27: Hoare triple {754#false} 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; {754#false} is VALID [2020-07-29 01:41:55,323 INFO L280 TraceCheckUtils]: 28: Hoare triple {754#false} assume !(0 == __VERIFIER_assert_~cond); {754#false} is VALID [2020-07-29 01:41:55,324 INFO L280 TraceCheckUtils]: 29: Hoare triple {754#false} havoc main_#t~mem2; {754#false} is VALID [2020-07-29 01:41:55,324 INFO L280 TraceCheckUtils]: 30: Hoare triple {754#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {754#false} is VALID [2020-07-29 01:41:55,326 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-29 01:41:55,326 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348326243] [2020-07-29 01:41:55,327 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603942450] [2020-07-29 01:41:55,327 INFO L93 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 [2020-07-29 01:41:55,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-29 01:41:55,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:41:55,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:41:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:41:55,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:41:55,440 INFO L384 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 [2020-07-29 01:41:55,441 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:41:55,443 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:41:55,444 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:41:55,444 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-07-29 01:41:55,539 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:55,552 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:41:55,570 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {753#true} is VALID [2020-07-29 01:41:55,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#true} 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; {753#true} is VALID [2020-07-29 01:41:55,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {753#true} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {753#true} is VALID [2020-07-29 01:41:55,570 INFO L280 TraceCheckUtils]: 3: Hoare triple {753#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {753#true} is VALID [2020-07-29 01:41:55,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {753#true} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {753#true} is VALID [2020-07-29 01:41:55,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {753#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {753#true} is VALID [2020-07-29 01:41:55,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {753#true} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {753#true} is VALID [2020-07-29 01:41:55,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {753#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {753#true} is VALID [2020-07-29 01:41:55,571 INFO L280 TraceCheckUtils]: 8: Hoare triple {753#true} assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); {753#true} is VALID [2020-07-29 01:41:55,572 INFO L280 TraceCheckUtils]: 9: Hoare triple {753#true} main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; {753#true} is VALID [2020-07-29 01:41:55,572 INFO L280 TraceCheckUtils]: 10: Hoare triple {753#true} assume !(main_~i~0 < 100000); {753#true} is VALID [2020-07-29 01:41:55,572 INFO L280 TraceCheckUtils]: 11: Hoare triple {753#true} main_~i~0 := 0; {753#true} is VALID [2020-07-29 01:41:55,572 INFO L280 TraceCheckUtils]: 12: Hoare triple {753#true} 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; {753#true} is VALID [2020-07-29 01:41:55,572 INFO L280 TraceCheckUtils]: 13: Hoare triple {753#true} assume !(0 == __VERIFIER_assert_~cond); {753#true} is VALID [2020-07-29 01:41:55,573 INFO L280 TraceCheckUtils]: 14: Hoare triple {753#true} havoc main_#t~mem2; {753#true} is VALID [2020-07-29 01:41:55,573 INFO L280 TraceCheckUtils]: 15: Hoare triple {753#true} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {753#true} is VALID [2020-07-29 01:41:55,573 INFO L280 TraceCheckUtils]: 16: Hoare triple {753#true} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {753#true} is VALID [2020-07-29 01:41:55,573 INFO L280 TraceCheckUtils]: 17: Hoare triple {753#true} 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; {753#true} is VALID [2020-07-29 01:41:55,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {753#true} assume !(0 == __VERIFIER_assert_~cond); {753#true} is VALID [2020-07-29 01:41:55,574 INFO L280 TraceCheckUtils]: 19: Hoare triple {753#true} havoc main_#t~mem2; {753#true} is VALID [2020-07-29 01:41:55,574 INFO L280 TraceCheckUtils]: 20: Hoare triple {753#true} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {753#true} is VALID [2020-07-29 01:41:55,574 INFO L280 TraceCheckUtils]: 21: Hoare triple {753#true} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {753#true} is VALID [2020-07-29 01:41:55,574 INFO L280 TraceCheckUtils]: 22: Hoare triple {753#true} 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; {753#true} is VALID [2020-07-29 01:41:55,575 INFO L280 TraceCheckUtils]: 23: Hoare triple {753#true} assume !(0 == __VERIFIER_assert_~cond); {753#true} is VALID [2020-07-29 01:41:55,575 INFO L280 TraceCheckUtils]: 24: Hoare triple {753#true} havoc main_#t~mem2; {753#true} is VALID [2020-07-29 01:41:55,576 INFO L280 TraceCheckUtils]: 25: Hoare triple {753#true} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {838#(= 20 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 4) 4)))} is VALID [2020-07-29 01:41:55,577 INFO L280 TraceCheckUtils]: 26: Hoare triple {838#(= 20 (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 4) 4)))} main_#t~post1 := main_~i~0;main_~i~0 := 1 + main_#t~post1;havoc main_#t~post1; {842#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 4))) 20)} is VALID [2020-07-29 01:41:55,578 INFO L280 TraceCheckUtils]: 27: Hoare triple {842#(= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0.base|) (+ |ULTIMATE.start_main_~#a~0.offset| (* ULTIMATE.start_main_~i~0 4))) 20)} 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; {846#(= 0 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-29 01:41:55,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {846#(= 0 ULTIMATE.start___VERIFIER_assert_~cond)} assume !(0 == __VERIFIER_assert_~cond); {754#false} is VALID [2020-07-29 01:41:55,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {754#false} havoc main_#t~mem2; {754#false} is VALID [2020-07-29 01:41:55,579 INFO L280 TraceCheckUtils]: 30: Hoare triple {754#false} assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); {754#false} is VALID [2020-07-29 01:41:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-07-29 01:41:55,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:41:55,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2020-07-29 01:41:55,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911020347] [2020-07-29 01:41:55,582 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:41:55,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:41:55,582 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2020-07-29 01:41:55,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:41:55,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461778558] [2020-07-29 01:41:55,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:41:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:55,588 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:41:55,592 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:41:55,594 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:41:55,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:41:55,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:41:55,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:41:55,768 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand 5 states. [2020-07-29 01:41:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:41:55,852 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-29 01:41:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:41:55,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:41:55,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:41:55,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. [2020-07-29 01:41:55,879 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:55,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2020-07-29 01:41:55,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:41:55,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:41:55,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:41:55,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:41:55,880 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:55,880 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:55,880 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:41:55,881 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:41:55,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:41:55,881 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:41:55,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:41:55,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:41:55 BoogieIcfgContainer [2020-07-29 01:41:55,888 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:41:55,888 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:41:55,888 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:41:55,888 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:41:55,889 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:41:51" (3/4) ... [2020-07-29 01:41:55,892 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:41:55,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:41:55,894 INFO L168 Benchmark]: Toolchain (without parser) took 5552.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 961.6 MB in the beginning and 887.8 MB in the end (delta: 73.8 MB). Peak memory consumption was 288.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:55,895 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:41:55,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.00 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:55,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:55,897 INFO L168 Benchmark]: Boogie Preprocessor took 26.23 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:55,898 INFO L168 Benchmark]: RCFGBuilder took 340.03 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:55,898 INFO L168 Benchmark]: BuchiAutomizer took 4844.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 887.8 MB in the end (delta: 225.4 MB). Peak memory consumption was 297.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:41:55,899 INFO L168 Benchmark]: Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 887.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:41:55,903 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 242.00 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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 88.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -189.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.23 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 340.03 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: 20.0 MB). Peak memory consumption was 20.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4844.70 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 887.8 MB in the end (delta: 225.4 MB). Peak memory consumption was 297.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.29 ms. Allocated memory is still 1.2 GB. Free memory is still 887.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 -8 * i + 199999 * unknown-#length-unknown[a] 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 4.7s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. 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, 63 SDslu, 47 SDs, 0 SdLazy, 124 SolverSat, 22 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: 22ms 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...