java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:22,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:22,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:22,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:22,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:22,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:22,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:22,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:22,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:22,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:22,273 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:22,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:22,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:22,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:22,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:22,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:22,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:22,279 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:22,281 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:22,283 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:22,285 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:22,286 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:22,287 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:22,288 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:22,290 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:22,291 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:22,291 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:22,292 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:22,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:22,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:22,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:22,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:22,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:22,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:22,298 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:22,298 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:22,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:22,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:22,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:22,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:22,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:22,329 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:22,344 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:22,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:22,350 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:22,350 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:22,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_7.bpl [2019-08-05 11:01:22,352 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/test-bitfields-3_false-valid-deref.i_7.bpl' [2019-08-05 11:01:22,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:22,395 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:22,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:22,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:22,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:22,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:22,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:22,435 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:22,435 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:22,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,446 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... [2019-08-05 11:01:22,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:22,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:22,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:22,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:22,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:01:22,539 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:22,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:22,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:22,897 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:22,897 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:22,899 INFO L202 PluginConnector]: Adding new model test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:22 BoogieIcfgContainer [2019-08-05 11:01:22,900 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:22,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:22,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:22,918 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:22,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:22" (1/2) ... [2019-08-05 11:01:22,919 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bdce2f9 and model type test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:22, skipping insertion in model container [2019-08-05 11:01:22,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:22" (2/2) ... [2019-08-05 11:01:22,922 INFO L109 eAbstractionObserver]: Analyzing ICFG test-bitfields-3_false-valid-deref.i_7.bpl [2019-08-05 11:01:22,939 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:22,950 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:22,975 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:23,014 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:23,015 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:23,015 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:23,016 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:23,016 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:23,016 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:23,016 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:23,016 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:23,017 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:01:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:01:23,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:23,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:01:23,046 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:23,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 29985, now seen corresponding path program 1 times [2019-08-05 11:01:23,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:23,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:23,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:23,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:01:23,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:01:23,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:01:23,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:23,277 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:01:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:23,302 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:01:23,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:23,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:01:23,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:23,315 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:01:23,315 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:01:23,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:01:23,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:01:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:01:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:01:23,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:01:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:23,349 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:01:23,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:01:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:01:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:01:23,350 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:23,351 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:01:23,351 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:23,352 INFO L82 PathProgramCache]: Analyzing trace with hash 927559, now seen corresponding path program 1 times [2019-08-05 11:01:23,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:23,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:23,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:01:23,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:01:23,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:01:23,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:23,646 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:01:23,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:23,735 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:01:23,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:01:23,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:01:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:23,736 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:01:23,737 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:01:23,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:23,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:01:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:01:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:01:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:01:23,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:01:23,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:23,741 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:01:23,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:01:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:01:23,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:01:23,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:23,742 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:01:23,742 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:23,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:23,743 INFO L82 PathProgramCache]: Analyzing trace with hash 28752353, now seen corresponding path program 2 times [2019-08-05 11:01:23,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:23,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:01:23,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:24,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:24,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:01:24,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:24,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:24,015 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:01:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:24,087 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:01:24,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:24,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:01:24,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:24,088 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:01:24,088 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:01:24,089 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:24,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:01:24,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:01:24,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:01:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:01:24,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:01:24,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:24,091 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:01:24,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:01:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:01:24,091 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:24,092 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:01:24,092 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash 891320967, now seen corresponding path program 3 times [2019-08-05 11:01:24,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:24,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:01:24,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:24,347 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:24,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:24,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:01:24,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:01:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:01:24,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:24,352 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:01:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:24,457 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:01:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:01:24,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:01:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:24,458 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:01:24,458 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:01:24,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:01:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:01:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:01:24,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:01:24,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:01:24,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:24,461 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:01:24,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:01:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:01:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:01:24,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:24,462 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:01:24,462 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:24,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144225, now seen corresponding path program 4 times [2019-08-05 11:01:24,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:24,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:01:24,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:24,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:24,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:01:24,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:24,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:24,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:24,664 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:01:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:24,706 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:01:24,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:01:24,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:01:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:24,709 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:01:24,709 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:01:24,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:01:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:01:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:01:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:01:24,712 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:01:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:24,712 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:01:24,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:01:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:01:24,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:24,713 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:01:24,713 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894151, now seen corresponding path program 5 times [2019-08-05 11:01:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:24,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:01:24,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:25,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:25,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:01:25,043 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:01:25,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:01:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:25,044 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 11:01:25,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:25,096 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:01:25,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:01:25,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:01:25,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:25,097 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:01:25,097 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:01:25,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:01:25,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:01:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:01:25,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:01:25,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:01:25,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:25,100 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:01:25,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:01:25,101 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:01:25,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:01:25,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:25,101 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:01:25,102 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:25,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:25,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141857, now seen corresponding path program 6 times [2019-08-05 11:01:25,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:25,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:01:25,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:25,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:25,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:01:25,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:01:25,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:01:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:01:25,330 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 11:01:25,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:25,357 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:01:25,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:01:25,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:01:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:25,359 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:01:25,360 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:01:25,360 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:01:25,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:01:25,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:01:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:01:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:01:25,363 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:01:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:25,364 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:01:25,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:01:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:01:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:01:25,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:25,365 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:01:25,365 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820743, now seen corresponding path program 7 times [2019-08-05 11:01:25,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:25,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:01:25,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:25,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:25,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:01:25,910 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:01:25,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:01:25,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:25,911 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 11:01:25,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:25,990 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:01:25,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:01:25,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:01:25,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:25,992 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:01:25,992 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:01:25,992 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:01:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:01:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:01:25,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:01:25,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:01:25,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:25,995 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:01:25,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:01:25,995 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:01:25,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:01:25,996 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:25,996 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:01:25,996 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:25,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:25,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166495, now seen corresponding path program 8 times [2019-08-05 11:01:25,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:26,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:01:26,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:01:26,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:01:26,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:01:26,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:01:26,256 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 11:01:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:26,311 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:01:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:01:26,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:01:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:26,313 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:01:26,313 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:01:26,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:01:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:01:26,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:01:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:01:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:01:26,316 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:01:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:26,317 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:01:26,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:01:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:01:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:01:26,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:26,318 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:01:26,319 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:26,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:26,319 INFO L82 PathProgramCache]: Analyzing trace with hash -562523065, now seen corresponding path program 9 times [2019-08-05 11:01:26,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:26,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:01:26,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:01:26,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:01:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:01:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:01:26,699 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 11:01:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:26,750 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:01:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:01:26,751 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:01:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:26,752 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:01:26,752 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:01:26,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:01:26,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:01:26,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:01:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:01:26,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:01:26,756 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:01:26,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:26,756 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:01:26,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:01:26,757 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:01:26,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:01:26,757 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:26,757 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:01:26,758 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:26,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:26,758 INFO L82 PathProgramCache]: Analyzing trace with hash -258347807, now seen corresponding path program 10 times [2019-08-05 11:01:26,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:26,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:01:26,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:26,940 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:26,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:26,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:26,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:26,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-08-05 11:01:27,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:27,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:01:27,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:01:27,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:01:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:27,017 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 3 states. [2019-08-05 11:01:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:27,018 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:01:27,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:27,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-08-05 11:01:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:27,018 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:01:27,019 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:01:27,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:01:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:01:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:01:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:01:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:01:27,020 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-08-05 11:01:27,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:27,020 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:01:27,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:01:27,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:01:27,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:01:27,025 INFO L202 PluginConnector]: Adding new model test-bitfields-3_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:01:27 BoogieIcfgContainer [2019-08-05 11:01:27,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:01:27,027 INFO L168 Benchmark]: Toolchain (without parser) took 4632.46 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 108.5 MB in the beginning and 132.5 MB in the end (delta: -24.1 MB). Peak memory consumption was 38.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:27,028 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:01:27,029 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:27,030 INFO L168 Benchmark]: Boogie Preprocessor took 26.98 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:27,031 INFO L168 Benchmark]: RCFGBuilder took 438.10 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 90.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:27,032 INFO L168 Benchmark]: TraceAbstraction took 4120.02 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 90.7 MB in the beginning and 132.5 MB in the end (delta: -41.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:27,036 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 140.5 MB. Free memory was 110.1 MB in the beginning and 109.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 140.5 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.98 ms. Allocated memory is still 140.5 MB. Free memory was 106.7 MB in the beginning and 105.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 438.10 ms. Allocated memory is still 140.5 MB. Free memory was 105.3 MB in the beginning and 90.9 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4120.02 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 90.7 MB in the beginning and 132.5 MB in the end (delta: -41.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 144]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 4.0s OverallTime, 11 OverallIterations, 10 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 SDtfs, 0 SDslu, 30 SDs, 0 SdLazy, 95 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 77 ConstructedInterpolants, 0 QuantifiedInterpolants, 4741 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 92 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 55/220 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...