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/Arrays16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:06:11,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:06:11,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:06:11,556 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:06:11,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:06:11,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:06:11,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:06:11,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:06:11,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:06:11,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:06:11,573 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:06:11,573 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:06:11,574 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:06:11,574 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:06:11,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:06:11,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:06:11,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:06:11,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:06:11,584 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:06:11,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:06:11,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:06:11,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:06:11,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:06:11,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:06:11,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:06:11,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:06:11,599 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:06:11,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:06:11,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:06:11,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:06:11,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:06:11,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:06:11,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:06:11,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:06:11,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:06:11,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:06:11,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:06:11,612 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:06:11,612 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:06:11,613 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:06:11,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:06:11,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:06:11,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:06:11,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:06:11,682 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:06:11,683 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:06:11,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays16.bpl [2019-08-05 11:06:11,684 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/quantifier/Arrays/Arrays16.bpl' [2019-08-05 11:06:11,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:06:11,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:06:11,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:11,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:06:11,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:06:11,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,757 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 11:06:11,757 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 11:06:11,757 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 11:06:11,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:06:11,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:06:11,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:06:11,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:06:11,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/1) ... [2019-08-05 11:06:11,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:06:11,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:06:11,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:06:11,786 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:06:11,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (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:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 11:06:11,851 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 11:06:12,443 INFO L275 CfgBuilder]: Using library mode [2019-08-05 11:06:12,443 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:06:12,444 INFO L202 PluginConnector]: Adding new model Arrays16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:12 BoogieIcfgContainer [2019-08-05 11:06:12,445 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:06:12,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:06:12,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:06:12,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:06:12,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:06:11" (1/2) ... [2019-08-05 11:06:12,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c79402c and model type Arrays16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:06:12, skipping insertion in model container [2019-08-05 11:06:12,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Arrays16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:06:12" (2/2) ... [2019-08-05 11:06:12,453 INFO L109 eAbstractionObserver]: Analyzing ICFG Arrays16.bpl [2019-08-05 11:06:12,463 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:06:12,471 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2019-08-05 11:06:12,487 INFO L252 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2019-08-05 11:06:12,514 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:06:12,515 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:06:12,515 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:06:12,515 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:06:12,515 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:06:12,516 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:06:12,516 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:06:12,516 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:06:12,516 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:06:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-08-05 11:06:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:12,540 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:12,541 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:12,544 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:12,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:12,551 INFO L82 PathProgramCache]: Analyzing trace with hash 29888, now seen corresponding path program 1 times [2019-08-05 11:06:12,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:12,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:12,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:12,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:12,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:13,087 WARN L188 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:13,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:13,089 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:13,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:13,382 WARN L188 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:13,737 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-08-05 11:06:13,740 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:13,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:13,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:13,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:13,761 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-08-05 11:06:13,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:13,965 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-08-05 11:06:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:13,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:06:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:13,978 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:06:13,978 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:06:13,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:13,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:06:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:06:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:06:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 11:06:14,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 3 [2019-08-05 11:06:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:14,015 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 11:06:14,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 11:06:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:06:14,016 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:14,016 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:06:14,017 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash 30016, now seen corresponding path program 1 times [2019-08-05 11:06:14,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:14,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:06:14,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:14,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:14,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:14,286 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:14,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:14,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:14,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:14,664 WARN L188 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:14,848 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 11:06:14,850 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:14,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:14,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:06:14,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:14,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:14,853 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 4 states. [2019-08-05 11:06:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:14,969 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-08-05 11:06:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:06:14,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-08-05 11:06:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:14,971 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:06:14,971 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:06:14,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:14,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:06:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:06:14,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:06:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-08-05 11:06:14,977 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 3 [2019-08-05 11:06:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:14,977 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-08-05 11:06:14,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:14,978 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-08-05 11:06:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:06:14,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:14,978 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:06:14,979 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 930537, now seen corresponding path program 1 times [2019-08-05 11:06:14,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:14,996 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:06:14,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:15,030 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 208 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 101 [2019-08-05 11:06:15,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:15,200 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-08-05 11:06:15,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:15,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:15,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:101 [2019-08-05 11:06:15,522 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-05 11:06:15,524 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:15,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:15,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:06:15,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:15,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:15,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:15,526 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-08-05 11:06:15,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:15,721 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-08-05 11:06:15,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:15,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-08-05 11:06:15,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:15,723 INFO L225 Difference]: With dead ends: 33 [2019-08-05 11:06:15,723 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 11:06:15,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:15,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 11:06:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2019-08-05 11:06:15,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:06:15,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-08-05 11:06:15,728 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 4 [2019-08-05 11:06:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:15,728 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-08-05 11:06:15,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-08-05 11:06:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:06:15,729 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:15,729 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:15,730 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:15,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:15,730 INFO L82 PathProgramCache]: Analyzing trace with hash 151589774, now seen corresponding path program 1 times [2019-08-05 11:06:15,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:15,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:06:15,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:15,803 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 8 treesize of output 7 [2019-08-05 11:06:15,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:15,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:15,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:15,815 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:15,833 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:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:15,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:06:15,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:06:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:06:15,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:06:15,836 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-08-05 11:06:15,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:15,919 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-08-05 11:06:15,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:06:15,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-08-05 11:06:15,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:15,920 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:06:15,920 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:06:15,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:06:15,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-08-05 11:06:15,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:06:15,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-08-05 11:06:15,925 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2019-08-05 11:06:15,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:15,925 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-08-05 11:06:15,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:06:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-08-05 11:06:15,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:06:15,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:15,927 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:15,928 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:15,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:15,928 INFO L82 PathProgramCache]: Analyzing trace with hash -351113008, now seen corresponding path program 1 times [2019-08-05 11:06:15,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:15,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:06:15,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:16,020 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 8 treesize of output 7 [2019-08-05 11:06:16,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:16,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:16,068 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:16,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:06:16,069 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:06:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:06:16,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:06:16,073 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2019-08-05 11:06:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:16,185 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2019-08-05 11:06:16,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:06:16,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-08-05 11:06:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:16,187 INFO L225 Difference]: With dead ends: 37 [2019-08-05 11:06:16,188 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 11:06:16,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 11:06:16,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2019-08-05 11:06:16,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:06:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-08-05 11:06:16,193 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2019-08-05 11:06:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:16,193 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-08-05 11:06:16,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:06:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-08-05 11:06:16,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:06:16,194 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:16,194 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:16,195 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1882817938, now seen corresponding path program 2 times [2019-08-05 11:06:16,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:16,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:06:16,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:16,346 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 8 treesize of output 7 [2019-08-05 11:06:16,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:16,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,354 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:16,369 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:16,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:16,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:06:16,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:06:16,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:06:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:06:16,372 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2019-08-05 11:06:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:16,496 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-08-05 11:06:16,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:06:16,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-08-05 11:06:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:16,498 INFO L225 Difference]: With dead ends: 39 [2019-08-05 11:06:16,498 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 11:06:16,499 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:06:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 11:06:16,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2019-08-05 11:06:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 11:06:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-08-05 11:06:16,502 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2019-08-05 11:06:16,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:16,503 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-08-05 11:06:16,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:06:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-08-05 11:06:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:06:16,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:16,504 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:16,505 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:16,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1206809044, now seen corresponding path program 3 times [2019-08-05 11:06:16,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:16,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:06:16,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:16,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-08-05 11:06:16,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:16,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:16,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:16,684 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:16,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:16,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:06:16,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:06:16,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:06:16,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:06:16,687 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2019-08-05 11:06:16,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:16,829 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2019-08-05 11:06:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:06:16,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-08-05 11:06:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:16,831 INFO L225 Difference]: With dead ends: 41 [2019-08-05 11:06:16,831 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 11:06:16,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:06:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 11:06:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-08-05 11:06:16,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 11:06:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-08-05 11:06:16,836 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 23 [2019-08-05 11:06:16,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:16,836 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-08-05 11:06:16,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:06:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-08-05 11:06:16,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 11:06:16,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:16,838 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:16,839 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:16,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:16,839 INFO L82 PathProgramCache]: Analyzing trace with hash 102323606, now seen corresponding path program 4 times [2019-08-05 11:06:16,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:16,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:06:16,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:17,043 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 8 treesize of output 7 [2019-08-05 11:06:17,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:17,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:17,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:17,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:17,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:17,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:06:17,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:06:17,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:06:17,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:06:17,082 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2019-08-05 11:06:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:17,254 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-08-05 11:06:17,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:06:17,255 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-05 11:06:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:17,256 INFO L225 Difference]: With dead ends: 43 [2019-08-05 11:06:17,257 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 11:06:17,257 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:06:17,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 11:06:17,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2019-08-05 11:06:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 11:06:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-08-05 11:06:17,261 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-08-05 11:06:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:17,262 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-08-05 11:06:17,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:06:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-08-05 11:06:17,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 11:06:17,263 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:17,263 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:17,263 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash -451260200, now seen corresponding path program 5 times [2019-08-05 11:06:17,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:17,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:06:17,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:17,450 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 8 treesize of output 7 [2019-08-05 11:06:17,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:17,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:17,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:17,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:17,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:17,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:17,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:06:17,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:06:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:06:17,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:06:17,469 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2019-08-05 11:06:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:17,635 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-08-05 11:06:17,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:06:17,636 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-08-05 11:06:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:17,637 INFO L225 Difference]: With dead ends: 45 [2019-08-05 11:06:17,638 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 11:06:17,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:06:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 11:06:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 11:06:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 11:06:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-08-05 11:06:17,642 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 27 [2019-08-05 11:06:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:17,643 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-08-05 11:06:17,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:06:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-08-05 11:06:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 11:06:17,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:17,644 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:17,644 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:17,645 INFO L82 PathProgramCache]: Analyzing trace with hash 130646938, now seen corresponding path program 6 times [2019-08-05 11:06:17,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:17,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:06:17,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:17,774 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 8 treesize of output 7 [2019-08-05 11:06:17,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:17,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:17,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:17,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:17,802 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:17,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:17,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:06:17,804 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:06:17,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:06:17,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:06:17,805 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2019-08-05 11:06:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:18,271 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-08-05 11:06:18,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:06:18,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-05 11:06:18,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:18,273 INFO L225 Difference]: With dead ends: 47 [2019-08-05 11:06:18,273 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 11:06:18,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:06:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 11:06:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-08-05 11:06:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 11:06:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-08-05 11:06:18,278 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2019-08-05 11:06:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:18,278 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-08-05 11:06:18,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:06:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-08-05 11:06:18,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 11:06:18,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:18,280 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:18,280 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:18,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:18,281 INFO L82 PathProgramCache]: Analyzing trace with hash 997658076, now seen corresponding path program 7 times [2019-08-05 11:06:18,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:18,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:06:18,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:18,486 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 8 treesize of output 7 [2019-08-05 11:06:18,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:18,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:18,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:18,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:18,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:18,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:06:18,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:06:18,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:06:18,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:06:18,651 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2019-08-05 11:06:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:18,865 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2019-08-05 11:06:18,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:06:18,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2019-08-05 11:06:18,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:18,866 INFO L225 Difference]: With dead ends: 49 [2019-08-05 11:06:18,867 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 11:06:18,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:06:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 11:06:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2019-08-05 11:06:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 11:06:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-08-05 11:06:18,872 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 31 [2019-08-05 11:06:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:18,872 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-08-05 11:06:18,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:06:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-08-05 11:06:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 11:06:18,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:18,874 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:18,874 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:18,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:18,875 INFO L82 PathProgramCache]: Analyzing trace with hash 971706270, now seen corresponding path program 8 times [2019-08-05 11:06:18,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:18,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:06:18,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:19,050 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 8 treesize of output 7 [2019-08-05 11:06:19,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:19,053 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:19,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:19,054 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-08-05 11:06:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:06:19,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:06:19,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:06:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:06:19,069 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2019-08-05 11:06:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:19,402 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-08-05 11:06:19,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:06:19,402 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-08-05 11:06:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:19,403 INFO L225 Difference]: With dead ends: 51 [2019-08-05 11:06:19,404 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 11:06:19,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 11:06:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2019-08-05 11:06:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 11:06:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-08-05 11:06:19,408 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2019-08-05 11:06:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:19,408 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-08-05 11:06:19,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:06:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-08-05 11:06:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 11:06:19,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:19,410 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:19,411 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:19,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:19,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1801824480, now seen corresponding path program 9 times [2019-08-05 11:06:19,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:19,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:19,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:06:19,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:19,676 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 8 treesize of output 7 [2019-08-05 11:06:19,676 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:19,695 INFO L567 ElimStorePlain]: treesize reduction 3, result has 78.6 percent of original size [2019-08-05 11:06:19,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:19,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-08-05 11:06:19,711 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:19,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:19,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:06:19,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:06:19,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:06:19,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:19,712 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 13 states. [2019-08-05 11:06:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:20,011 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-08-05 11:06:20,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:06:20,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-08-05 11:06:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:20,013 INFO L225 Difference]: With dead ends: 53 [2019-08-05 11:06:20,013 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 11:06:20,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:06:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 11:06:20,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2019-08-05 11:06:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 11:06:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-08-05 11:06:20,018 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 35 [2019-08-05 11:06:20,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:20,018 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-08-05 11:06:20,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:06:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-08-05 11:06:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 11:06:20,019 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:20,019 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 11:06:20,020 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr9ASSERT_VIOLATIONASSERT, mainErr13ASSERT_VIOLATIONASSERT, mainErr11ASSERT_VIOLATIONASSERT, mainErr15ASSERT_VIOLATIONASSERT, mainErr7ASSERT_VIOLATIONASSERT, mainErr12ASSERT_VIOLATIONASSERT, mainErr4ASSERT_VIOLATIONASSERT, mainErr8ASSERT_VIOLATIONASSERT, mainErr14ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT, mainErr3ASSERT_VIOLATIONASSERT, mainErr2ASSERT_VIOLATIONASSERT, mainErr0ASSERT_VIOLATIONASSERT, mainErr6ASSERT_VIOLATIONASSERT, mainErr5ASSERT_VIOLATIONASSERT, mainErr10ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash 681507234, now seen corresponding path program 10 times [2019-08-05 11:06:20,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:20,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:06:20,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:06:20,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:06:20,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-08-05 11:06:20,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:06:20,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:06:20,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:20,178 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 13 states. [2019-08-05 11:06:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:20,274 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:06:20,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:06:20,275 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-08-05 11:06:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:20,276 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:06:20,276 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:06:20,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:06:20,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:06:20,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:06:20,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:06:20,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:06:20,278 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-08-05 11:06:20,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:20,278 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:06:20,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:06:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:06:20,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:06:20,284 INFO L202 PluginConnector]: Adding new model Arrays16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:06:20 BoogieIcfgContainer [2019-08-05 11:06:20,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:06:20,286 INFO L168 Benchmark]: Toolchain (without parser) took 8564.03 ms. Allocated memory was 134.2 MB in the beginning and 231.7 MB in the end (delta: 97.5 MB). Free memory was 110.6 MB in the beginning and 83.1 MB in the end (delta: 27.5 MB). Peak memory consumption was 125.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:20,286 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:06:20,288 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.90 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:20,289 INFO L168 Benchmark]: Boogie Preprocessor took 25.46 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 107.2 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:20,289 INFO L168 Benchmark]: RCFGBuilder took 658.96 ms. Allocated memory is still 134.2 MB. Free memory was 107.2 MB in the beginning and 94.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:20,290 INFO L168 Benchmark]: TraceAbstraction took 7838.26 ms. Allocated memory was 134.2 MB in the beginning and 231.7 MB in the end (delta: 97.5 MB). Free memory was 93.7 MB in the beginning and 83.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:06:20,293 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 134.2 MB. Free memory is still 111.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.90 ms. Allocated memory is still 134.2 MB. Free memory was 110.2 MB in the beginning and 108.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.46 ms. Allocated memory is still 134.2 MB. Free memory was 108.5 MB in the beginning and 107.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 658.96 ms. Allocated memory is still 134.2 MB. Free memory was 107.2 MB in the beginning and 94.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7838.26 ms. Allocated memory was 134.2 MB in the beginning and 231.7 MB in the end (delta: 97.5 MB). Free memory was 93.7 MB in the beginning and 83.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 108.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 56]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 44]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 41]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 45]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 40]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 38]: 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: 43]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 42]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 47]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 16 error locations. SAFE Result, 7.7s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 322 SDtfs, 202 SDslu, 1324 SDs, 0 SdLazy, 1816 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=13, 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, 14 MinimizatonAttempts, 133 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 293 ConstructedInterpolants, 0 QuantifiedInterpolants, 19301 SizeOfPredicates, 11 NumberOfNonLiveVariables, 871 ConjunctsInSsa, 177 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 110/440 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...