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/quantifier/Arrays/Arrays08.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:06:18,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:06:18,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:06:18,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:06:18,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:06:18,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:06:18,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:06:18,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:06:18,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:06:18,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:06:18,524 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:06:18,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:06:18,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:06:18,526 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:06:18,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:06:18,528 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:06:18,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:06:18,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:06:18,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:06:18,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:06:18,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:06:18,536 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:06:18,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:06:18,538 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:06:18,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:06:18,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:06:18,541 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:06:18,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:06:18,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:06:18,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:06:18,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:06:18,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:06:18,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:06:18,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:06:18,548 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:06:18,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:06:18,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:06:18,549 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:06:18,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:06:18,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:06:18,551 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:06:18,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:06:18,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:06:18,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:06:18,602 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:06:18,603 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:06:18,605 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays08.bpl [2019-08-05 11:06:18,606 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays08.bpl' [2019-08-05 11:06:18,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:06:18,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:06:18,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:18,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:06:18,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:06:18,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,677 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:06:18,677 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:06:18,677 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:06:18,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:18,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:06:18,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:06:18,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:06:18,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... [2019-08-05 11:06:18,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:06:18,706 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:06:18,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:06:18,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:06:18,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:06:18,772 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:06:18,773 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:06:19,047 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:06:19,048 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:06:19,049 INFO L202 PluginConnector]: Adding new model Arrays08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:19 BoogieIcfgContainer [2019-08-05 11:06:19,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:06:19,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:06:19,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:06:19,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:06:19,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:18" (1/2) ... [2019-08-05 11:06:19,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b8e65b and model type Arrays08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:06:19, skipping insertion in model container [2019-08-05 11:06:19,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:19" (2/2) ... [2019-08-05 11:06:19,058 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays08.bpl [2019-08-05 11:06:19,068 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:06:19,076 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-08-05 11:06:19,093 INFO L252 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-08-05 11:06:19,120 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:06:19,121 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:06:19,121 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:06:19,121 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:06:19,121 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:06:19,122 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:06:19,122 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:06:19,122 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:06:19,122 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:06:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-08-05 11:06:19,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:19,148 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:19,149 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:19,152 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:19,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:19,158 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-08-05 11:06:19,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:19,243 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:06:19,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:19,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,413 INFO L235 Elim1Store]: Index analysis took 103 ms [2019-08-05 11:06:19,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:19,449 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:19,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:19,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:19,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:19,593 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:06:19,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:19,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 11:06:19,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:06:19,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:06:19,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:06:19,617 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-08-05 11:06:19,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:19,860 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-08-05 11:06:19,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:06:19,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:06:19,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:19,870 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:06:19,871 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:06:19,873 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:06:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:06:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:06:19,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:06:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:06:19,908 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 3 [2019-08-05 11:06:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:19,909 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:06:19,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:06:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:06:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:06:19,910 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:19,910 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:06:19,911 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:19,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-08-05 11:06:19,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:19,944 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:06:19,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:19,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:19,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:19,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:20,179 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 11:06:20,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:20,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:20,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:20,383 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 11:06:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:20,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:20,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2019-08-05 11:06:20,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:20,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:20,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:20,391 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 4 states. [2019-08-05 11:06:20,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:20,551 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:06:20,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:20,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-08-05 11:06:20,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:20,553 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:06:20,553 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:06:20,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:20,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:06:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:06:20,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:06:20,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:06:20,558 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 5 [2019-08-05 11:06:20,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:20,559 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:06:20,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:20,559 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:06:20,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:06:20,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:20,560 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-08-05 11:06:20,560 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:20,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:20,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-08-05 11:06:20,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:20,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:06:20,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:20,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:20,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:20,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:20,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:20,656 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:20,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:20,818 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 11:06:20,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:20,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:20,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:20,944 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:06:20,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:20,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:06:20,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:20,946 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2019-08-05 11:06:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:21,093 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 11:06:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:21,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-05 11:06:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:21,096 INFO L225 Difference]: With dead ends: 25 [2019-08-05 11:06:21,096 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 11:06:21,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:21,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 11:06:21,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 11:06:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:06:21,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:06:21,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 7 [2019-08-05 11:06:21,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:21,102 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:06:21,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:21,103 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:06:21,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:06:21,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:21,104 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-08-05 11:06:21,104 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:21,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:21,105 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-08-05 11:06:21,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:21,133 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:06:21,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:21,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:21,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 17 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:21,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:21,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:21,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:06:21,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:32 [2019-08-05 11:06:21,446 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 11:06:21,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:21,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:21,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:06:21,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:06:21,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:06:21,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:21,672 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 6 states. [2019-08-05 11:06:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:21,897 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 11:06:21,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:06:21,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-08-05 11:06:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:21,899 INFO L225 Difference]: With dead ends: 27 [2019-08-05 11:06:21,899 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 11:06:21,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 11:06:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 11:06:21,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:06:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:06:21,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 9 [2019-08-05 11:06:21,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:21,904 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:06:21,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:06:21,904 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:06:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:06:21,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:21,905 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-08-05 11:06:21,906 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:21,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:21,906 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-08-05 11:06:21,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:21,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:06:21,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:21,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 26 [2019-08-05 11:06:21,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:21,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:21,990 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:21,990 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:29 [2019-08-05 11:06:22,300 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:22,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:22,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-08-05 11:06:22,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:06:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:06:22,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:06:22,302 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2019-08-05 11:06:22,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:22,393 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:06:22,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:06:22,393 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-08-05 11:06:22,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:22,394 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:06:22,394 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:06:22,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:06:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:06:22,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:06:22,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:06:22,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:06:22,398 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:06:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:22,399 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:06:22,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:06:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:06:22,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:06:22,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:22,400 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 11:06:22,400 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:22,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:22,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1707574814, now seen corresponding path program 1 times [2019-08-05 11:06:22,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:22,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:06:22,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:22,423 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-08-05 11:06:22,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:22,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:22,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:06:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:06:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:06:22,425 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 3 states. [2019-08-05 11:06:22,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:22,440 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:06:22,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:06:22,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 11:06:22,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:22,441 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:06:22,441 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:06:22,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:06:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:06:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:06:22,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:06:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:06:22,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2019-08-05 11:06:22,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:22,443 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:06:22,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:06:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:06:22,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:06:22,447 INFO L202 PluginConnector]: Adding new model Arrays08.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:22 BoogieIcfgContainer [2019-08-05 11:06:22,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:22,449 INFO L168 Benchmark]: Toolchain (without parser) took 3806.84 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 107.7 MB in the beginning and 166.1 MB in the end (delta: -58.4 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:22,450 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 ms. Allocated memory is still 140.5 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-08-05 11:06:22,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.78 ms. Allocated memory is still 140.5 MB. Free memory was 107.7 MB in the beginning and 105.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:22,452 INFO L168 Benchmark]: Boogie Preprocessor took 25.17 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 104.5 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:06:22,453 INFO L168 Benchmark]: RCFGBuilder took 343.67 ms. Allocated memory is still 140.5 MB. Free memory was 104.5 MB in the beginning and 93.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:22,454 INFO L168 Benchmark]: TraceAbstraction took 3396.30 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 93.0 MB in the beginning and 166.1 MB in the end (delta: -73.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:06:22,458 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.29 ms. Allocated memory is still 140.5 MB. Free memory was 109.0 MB in the beginning and 108.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.78 ms. Allocated memory is still 140.5 MB. Free memory was 107.7 MB in the beginning and 105.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.17 ms. Allocated memory is still 140.5 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 343.67 ms. Allocated memory is still 140.5 MB. Free memory was 104.5 MB in the beginning and 93.4 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3396.30 ms. Allocated memory was 140.5 MB in the beginning and 203.4 MB in the end (delta: 62.9 MB). Free memory was 93.0 MB in the beginning and 166.1 MB in the end (delta: -73.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 33]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 6 error locations. SAFE Result, 3.3s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 11 SDslu, 3 SDs, 0 SdLazy, 273 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, 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, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 47 NumberOfCodeBlocks, 47 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 41 ConstructedInterpolants, 20 QuantifiedInterpolants, 7175 SizeOfPredicates, 5 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 36/56 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...