java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:00:11,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:00:11,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:00:11,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:00:11,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:00:11,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:00:11,622 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:00:11,624 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:00:11,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:00:11,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:00:11,627 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:00:11,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:00:11,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:00:11,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:00:11,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:00:11,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:00:11,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:00:11,633 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:00:11,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:00:11,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:00:11,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:00:11,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:00:11,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:00:11,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:00:11,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:00:11,644 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:00:11,644 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:00:11,645 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:00:11,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:00:11,647 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:00:11,647 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:00:11,648 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:00:11,648 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:00:11,649 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:00:11,650 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:00:11,651 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:00:11,651 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:00:11,651 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:00:11,652 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:00:11,653 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:00:11,653 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:00:11,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:00:11,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:00:11,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:00:11,704 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:00:11,705 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:00:11,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl [2019-08-05 11:00:11,706 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_7.bpl' [2019-08-05 11:00:11,754 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:00:11,756 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:00:11,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:11,757 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:00:11,757 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:00:11,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,799 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:00:11,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:00:11,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:00:11,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:00:11,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,825 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,828 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/1) ... [2019-08-05 11:00:11,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:00:11,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:00:11,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:00:11,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:00:11,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00: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:00:11,915 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:00:11,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:00:11,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:00:12,201 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:00:12,201 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:00:12,202 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:12 BoogieIcfgContainer [2019-08-05 11:00:12,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:00:12,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:00:12,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:00:12,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:00:12,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:00:11" (1/2) ... [2019-08-05 11:00:12,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18f58d54 and model type standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:00:12, skipping insertion in model container [2019-08-05 11:00:12,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:00:12" (2/2) ... [2019-08-05 11:00:12,211 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i_7.bpl [2019-08-05 11:00:12,220 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:00:12,228 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:00:12,242 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:00:12,267 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:00:12,268 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:00:12,268 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:00:12,268 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:00:12,268 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:00:12,269 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:00:12,269 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:00:12,269 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:00:12,269 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:00:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:00:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:00:12,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:12,305 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:00:12,308 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:12,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 11:00:12,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:12,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:00:12,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:12,693 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:12,694 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:12,695 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:12,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:12,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:12,722 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:12,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:12,827 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:00:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:00:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:00:12,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:00:12,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:00:12,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:00:12,847 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 11:00:13,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:13,005 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:00:13,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:00:13,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:00:13,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:13,016 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:00:13,016 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:00:13,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:00:13,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:00:13,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:00:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:00:13,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 11:00:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:13,052 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:00:13,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:00:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:00:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:00:13,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:13,053 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:00:13,054 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:13,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:13,066 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 11:00:13,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:13,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:00:13,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:13,276 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:13,277 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:13,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:13,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:13,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:13,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:13,443 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:00:13,610 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:00:13,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:13,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:00:13,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:00:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:00:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:00:13,613 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:00:13,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:13,743 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:00:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:00:13,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:00:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:13,745 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:00:13,745 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:00:13,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:00:13,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:00:13,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:00:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:00:13,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:00:13,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 11:00:13,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:13,749 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:00:13,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:00:13,750 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:00:13,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:00:13,750 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:13,750 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 11:00:13,751 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:13,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:13,751 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 11:00:13,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:13,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:00:13,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:13,986 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:13,987 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:13,987 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:14,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:14,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:14,049 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:14,191 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:00:14,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:14,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:00:14,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:00:14,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:00:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:00:14,196 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:00:14,775 WARN L188 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-08-05 11:00:14,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:14,994 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:00:14,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:00:14,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:00:14,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:14,996 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:00:14,996 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:00:14,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:00:14,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:00:15,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:00:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:00:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:00:15,001 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 11:00:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:15,001 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:00:15,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:00:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:00:15,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:00:15,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:15,002 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 11:00:15,003 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:15,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:15,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 11:00:15,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:15,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:15,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:00:15,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:15,109 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_9|], 2=[|v_#valid_7|]} [2019-08-05 11:00:15,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:15,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:15,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:15,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:15,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:00:15,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:15,235 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:00:15,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:15,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:00:15,390 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:00:15,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:15,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:00:15,391 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:00:15,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:00:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:00:15,392 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 11:00:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:15,787 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:00:15,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:00:15,788 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 11:00:15,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:15,789 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:00:15,789 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:00:15,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:00:15,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:00:15,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:00:15,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:00:15,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:00:15,794 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 11:00:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:15,794 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:00:15,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:00:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:00:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:00:15,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:15,795 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 11:00:15,795 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:15,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:15,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 11:00:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:15,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:00:15,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:16,049 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:16,049 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:16,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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:16,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:16,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:16,060 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:16,060 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:16,246 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:00:16,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:16,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:00:16,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:00:16,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:00:16,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:00:16,249 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 11:00:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:16,607 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:00:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:00:16,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 11:00:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:16,608 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:00:16,608 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:00:16,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:00:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:00:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:00:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:00:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:00:16,613 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 11:00:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:16,613 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:00:16,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:00:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:00:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:00:16,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:16,614 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 11:00:16,615 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:16,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:16,615 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 11:00:16,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:16,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:00:16,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:16,728 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 2=[|v_#valid_8|]} [2019-08-05 11:00:16,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:16,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:16,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:16,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:16,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:00:16,841 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:16,892 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:00:16,893 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:16,893 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:00:17,299 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:00:17,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:17,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:00:17,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:00:17,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:00:17,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:00:17,301 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 11:00:17,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:17,764 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:00:17,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:00:17,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:00:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:17,765 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:00:17,765 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:00:17,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:00:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:00:17,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 11:00:17,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:00:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:00:17,770 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 11:00:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:17,770 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:00:17,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:00:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:00:17,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:00:17,771 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:17,771 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 11:00:17,771 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 11:00:17,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:17,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:00:17,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:17,952 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:17,952 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:17,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:17,972 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:17,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:17,973 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:18,172 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:00:18,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:18,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:00:18,173 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:00:18,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:00:18,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:00:18,174 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 11:00:18,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:18,632 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:00:18,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:00:18,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 11:00:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:18,637 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:00:18,637 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:00:18,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:00:18,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:00:18,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:00:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:00:18,641 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 11:00:18,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:18,641 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:00:18,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:00:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:00:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:00:18,642 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:18,642 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 11:00:18,643 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:18,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:18,643 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 11:00:18,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:18,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:00:18,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:19,004 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:00:19,004 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:19,005 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:00:19,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:19,071 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:00:19,072 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:00:19,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:19,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:21 [2019-08-05 11:00:19,075 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:00:19,083 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:00:19,115 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:00:19,295 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:00:19,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:19,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:00:19,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:00:19,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:00:19,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:00:19,297 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 11:00:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:19,792 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:00:19,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:00:19,797 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:00:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:19,798 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:00:19,798 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:00:19,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:19,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:00:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:00:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:00:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:00:19,801 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 11:00:19,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:19,802 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:00:19,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:00:19,802 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:00:19,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:00:19,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:19,803 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 11:00:19,803 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:19,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:19,803 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 11:00:19,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:19,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:00:19,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:19,961 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_14|], 5=[|v_#valid_9|]} [2019-08-05 11:00:19,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:19,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:19,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:20,092 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-08-05 11:00:20,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 62 [2019-08-05 11:00:20,094 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,364 WARN L188 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2019-08-05 11:00:20,365 INFO L567 ElimStorePlain]: treesize reduction 22, result has 66.2 percent of original size [2019-08-05 11:00:20,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:43 [2019-08-05 11:00:20,649 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:00:20,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-08-05 11:00:20,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:20,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:20,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2019-08-05 11:00:20,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-08-05 11:00:20,687 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,726 INFO L567 ElimStorePlain]: treesize reduction 53, result has 28.4 percent of original size [2019-08-05 11:00:20,726 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,727 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:120, output treesize:21 [2019-08-05 11:00:20,918 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:00:20,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:20,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:00:20,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:00:20,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:00:20,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:00:20,919 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 11:00:21,270 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-08-05 11:00:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:21,892 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:00:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:00:21,894 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 11:00:21,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:21,896 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:00:21,896 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:00:21,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:00:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:00:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 11:00:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:00:21,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:00:21,901 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 11:00:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:21,901 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:00:21,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:00:21,901 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:00:21,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:00:21,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:21,902 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 11:00:21,903 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:21,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:21,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 11:00:21,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:22,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:00:22,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:22,323 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:22,323 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:22,324 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:22,324 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:22,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:22,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:22,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:22,499 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:00:22,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:22,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:00:22,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:00:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:00:22,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:00:22,500 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 11:00:23,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:23,214 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:00:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:00:23,214 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:00:23,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:23,215 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:00:23,215 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:00:23,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:00:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:00:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 11:00:23,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:00:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:00:23,219 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 11:00:23,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:23,220 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:00:23,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:00:23,220 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:00:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:00:23,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:23,220 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 11:00:23,221 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:23,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 11:00:23,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:23,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:00:23,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:23,336 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_16|], 2=[|v_#valid_10|]} [2019-08-05 11:00:23,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:23,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:23,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:23,435 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:23,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:00:23,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:23,467 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:23,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:23,468 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:00:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:23,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:23,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:00:23,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:00:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:00:23,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:00:23,699 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 11:00:24,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:24,420 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:00:24,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:00:24,421 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:00:24,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:24,422 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:00:24,422 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:00:24,423 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:00:24,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:00:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 11:00:24,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:00:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:00:24,427 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 11:00:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:24,427 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:00:24,427 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:00:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:00:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:00:24,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:24,428 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 11:00:24,428 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:24,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:24,429 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 11:00:24,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:24,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:00:24,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:24,602 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_17|], 2=[|v_#valid_11|]} [2019-08-05 11:00:24,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:24,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:24,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:24,778 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:00:24,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:24,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:00:24,786 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:24,808 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:24,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:24,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:00:25,049 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:25,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:25,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:00:25,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:00:25,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:00:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:00:25,051 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 11:00:25,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:25,759 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:00:25,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:00:25,762 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:00:25,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:25,762 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:00:25,762 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:00:25,763 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:00:25,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:00:25,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 11:00:25,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:00:25,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:00:25,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 11:00:25,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:25,767 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:00:25,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:00:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:00:25,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:00:25,768 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:25,768 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 11:00:25,768 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:25,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:25,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 11:00:25,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:25,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:00:25,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:26,186 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:26,187 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:26,188 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:26,188 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:26,305 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:00:26,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:26,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:26,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:26,507 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:00:27,071 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:27,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:27,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:00:27,072 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:00:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:00:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:00:27,073 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 11:00:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:27,972 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:00:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:00:27,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:00:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:27,973 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:00:27,973 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:00:27,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:00:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:00:27,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 11:00:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:00:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:00:27,977 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:00:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:27,977 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:00:27,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:00:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:00:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:00:27,978 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:27,979 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 11:00:27,979 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 11:00:27,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:28,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:00:28,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:28,437 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:28,437 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:28,438 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:28,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:28,547 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:00:28,548 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:28,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:28,549 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:28,778 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:00:28,933 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:00:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:29,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:29,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:00:29,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:00:29,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:00:29,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:00:29,741 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 11:00:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:30,730 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:00:30,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:00:30,734 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:00:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:30,734 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:00:30,734 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:00:30,735 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:00:30,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:00:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 11:00:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:00:30,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:00:30,738 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:00:30,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:30,739 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:00:30,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:00:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:00:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:00:30,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:30,740 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 11:00:30,740 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:30,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 11:00:30,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:30,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:00:30,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:30,937 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 2=[|v_#valid_12|]} [2019-08-05 11:00:30,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:30,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:30,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:31,028 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:00:31,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,059 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:00:31,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,060 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:00:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:31,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:31,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:00:31,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:00:31,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:00:31,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:00:31,403 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 11:00:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:32,312 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:00:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:00:32,313 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:00:32,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:32,314 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:00:32,314 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:00:32,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:00:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:00:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 11:00:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:00:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:00:32,319 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 11:00:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:32,319 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:00:32,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:00:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:00:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:00:32,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:32,321 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 11:00:32,321 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:32,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 11:00:32,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:32,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:00:32,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:32,662 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_21|], 2=[|v_#valid_13|]} [2019-08-05 11:00:32,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:32,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:32,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:32,857 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:00:32,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:32,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:00:32,939 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:33,089 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 11:00:33,090 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:33,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:33,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:00:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:33,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:33,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:00:33,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:00:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:00:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:00:33,528 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 11:00:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:34,597 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:00:34,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:00:34,599 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:00:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:34,600 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:00:34,600 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:00:34,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:00:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:00:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 11:00:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:00:34,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:00:34,603 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 11:00:34,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:34,604 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:00:34,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:00:34,604 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:00:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:00:34,605 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:34,605 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 11:00:34,605 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:34,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 11:00:34,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:34,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:00:34,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:35,114 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:35,115 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:35,116 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:35,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:35,239 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:00:35,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:35,240 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:35,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:35,478 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:00:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:37,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:37,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:00:37,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:00:37,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:00:37,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:00:37,085 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 11:00:38,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:38,080 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:00:38,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:00:38,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:00:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:38,081 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:00:38,081 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:00:38,083 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:00:38,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:00:38,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 11:00:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:00:38,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:00:38,087 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 11:00:38,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:38,087 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:00:38,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:00:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:00:38,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:00:38,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:38,088 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 11:00:38,088 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:38,089 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 11:00:38,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:38,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:00:38,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:38,693 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:38,694 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:38,694 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:38,695 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:38,818 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:00:38,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:38,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:38,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:38,966 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:00:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:39,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:39,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:00:39,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:00:39,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:00:39,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:00:39,603 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2019-08-05 11:00:40,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:40,760 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:00:40,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:00:40,760 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:00:40,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:40,761 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:00:40,761 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:00:40,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:00:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:00:40,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 11:00:40,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:00:40,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:00:40,766 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 11:00:40,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:40,767 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:00:40,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:00:40,767 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:00:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:00:40,767 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:40,768 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 11:00:40,768 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 11:00:40,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:40,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:00:40,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:41,089 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:41,089 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:41,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:41,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:41,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:41,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:41,825 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:41,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:41,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:00:41,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:00:41,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:00:41,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:00:41,826 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 11:00:42,841 WARN L188 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 11:00:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:43,649 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:00:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:00:43,649 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:00:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:43,650 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:00:43,650 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:00:43,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:00:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:00:43,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 11:00:43,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:00:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:00:43,659 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 11:00:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:43,659 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:00:43,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:00:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:00:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:00:43,660 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:43,661 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 11:00:43,661 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 11:00:43,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:43,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:00:43,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:44,101 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:44,101 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:44,102 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:44,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:44,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:44,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:44,112 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:44,573 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:44,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:44,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:00:44,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:00:44,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:00:44,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:00:44,575 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 11:00:45,360 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-08-05 11:00:46,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:46,695 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:00:46,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:00:46,696 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:00:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:46,697 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:00:46,697 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:00:46,698 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:00:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:00:46,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 11:00:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:00:46,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:00:46,702 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 11:00:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:46,703 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:00:46,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:00:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:00:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:00:46,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:46,704 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 11:00:46,704 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:46,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:46,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 11:00:46,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:47,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:00:47,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:47,267 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:00:47,268 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:47,268 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:47,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:47,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:47,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:47,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:47,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:47,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:00:47,741 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:00:47,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:00:47,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:00:47,742 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 11:00:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:49,260 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:00:49,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:00:49,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:00:49,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:49,261 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:00:49,261 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:00:49,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:00:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:00:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 11:00:49,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:00:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:00:49,359 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 11:00:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:49,359 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:00:49,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:00:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:00:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:00:49,360 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:49,360 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 11:00:49,360 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:49,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 11:00:49,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:49,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:00:49,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:49,668 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 2=[|v_#valid_14|]} [2019-08-05 11:00:49,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:49,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:49,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:49,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:49,767 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:00:49,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:49,815 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:00:49,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:49,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:50,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:50,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:00:50,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:00:50,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:00:50,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:00:50,511 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2019-08-05 11:00:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:52,305 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:00:52,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:00:52,309 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:00:52,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:52,310 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:00:52,310 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:00:52,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:00:52,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:00:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 11:00:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:00:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:00:52,315 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 11:00:52,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:52,315 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:00:52,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:00:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:00:52,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:00:52,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:52,316 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 11:00:52,317 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:52,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:52,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 11:00:52,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:53,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:00:53,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:53,038 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 2=[|v_#valid_15|]} [2019-08-05 11:00:53,092 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:53,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:53,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:53,243 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:00:53,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:53,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:00:53,273 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:53,303 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:53,303 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:53,303 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:00:54,125 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:54,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:54,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:00:54,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:00:54,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:00:54,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:00:54,126 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 11:00:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:55,629 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:00:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:00:55,630 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:00:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:55,631 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:00:55,631 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:00:55,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:00:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:00:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 11:00:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:00:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:00:55,636 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 11:00:55,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:55,636 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:00:55,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:00:55,636 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:00:55,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:00:55,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:55,637 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 11:00:55,637 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:55,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:55,638 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 11:00:55,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:56,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:00:56,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:56,350 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:00:56,350 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:56,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:56,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:56,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:56,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:00:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:56,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:56,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:00:56,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:00:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:00:56,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:00:56,868 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 11:00:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:58,514 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:00:58,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:00:58,515 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:00:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:58,516 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:00:58,516 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:00:58,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:00:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:00:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 11:00:58,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:00:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:00:58,520 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 11:00:58,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:58,520 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:00:58,520 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:00:58,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:00:58,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:00:58,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:58,520 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 11:00:58,521 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:58,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:58,521 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 11:00:58,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:58,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:00:58,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:58,978 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 2=[|v_#valid_16|]} [2019-08-05 11:00:59,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:59,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:59,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:59,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:59,032 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:00:59,032 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:59,051 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:00:59,052 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:00:59,052 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:00:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:59,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:59,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:00:59,735 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:00:59,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:00:59,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:00:59,736 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 11:01:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:01,362 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:01:01,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:01:01,362 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:01:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:01,363 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:01:01,363 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:01:01,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:01:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:01:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 11:01:01,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:01:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:01:01,368 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 11:01:01,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:01,369 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:01:01,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:01:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:01:01,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:01:01,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:01,369 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 11:01:01,370 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:01,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:01,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 11:01:01,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:01,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:01:01,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:02,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:02,068 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 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:01:02,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:02,093 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:01:02,094 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:02,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:02,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:21 [2019-08-05 11:01:02,095 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:02,102 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:02,107 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:01:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:02,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:02,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:01:02,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:01:02,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:01:02,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:01:02,693 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 11:01:04,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:04,567 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:01:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:01:04,567 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:01:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:04,568 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:01:04,568 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:01:04,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:01:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:01:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 11:01:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:01:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:01:04,573 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 11:01:04,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:04,573 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:01:04,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:01:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:01:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:01:04,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:04,573 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 11:01:04,573 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:04,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 11:01:04,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:05,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:01:05,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:05,385 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 2=[|v_#valid_17|]} [2019-08-05 11:01:05,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:05,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:05,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:05,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:05,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:01:05,448 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:05,470 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:01:05,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:05,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:01:06,241 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:06,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:06,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:01:06,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:01:06,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:01:06,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:01:06,243 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 11:01:06,886 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-08-05 11:01:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:08,184 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:01:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:01:08,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 11:01:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:08,186 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:01:08,186 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:01:08,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:01:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:01:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 11:01:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:01:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:01:08,190 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:01:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:08,191 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:01:08,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:01:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:01:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:01:08,192 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:08,192 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 11:01:08,192 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:08,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 11:01:08,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:08,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:01:08,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:08,940 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 2=[|v_#valid_18|]} [2019-08-05 11:01:08,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:08,955 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:08,955 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:09,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:09,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:01:09,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:09,060 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:01:09,061 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:09,061 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:01:09,450 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:01:10,391 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 11:01:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:10,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:01:10,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:01:10,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:01:10,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:01:10,842 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 11:01:13,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:13,471 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:01:13,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:01:13,472 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 11:01:13,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:13,472 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:01:13,473 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:01:13,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:01:13,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:01:13,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 11:01:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:01:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:01:13,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:01:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:13,477 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:01:13,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:01:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:01:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:01:13,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:13,478 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 11:01:13,478 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:13,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:13,479 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 11:01:13,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:13,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:13,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:01:13,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:13,944 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:01:13,945 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:13,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:13,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:13,975 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:13,975 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:01:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:14,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:14,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:01:14,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:01:14,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:01:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:01:14,861 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 11:01:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:16,866 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:01:16,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:01:16,866 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 11:01:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:16,867 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:01:16,867 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:01:16,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:01:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:01:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 11:01:16,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:01:16,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:01:16,872 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:01:16,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:16,872 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:01:16,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:01:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:01:16,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:01:16,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:16,873 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 11:01:16,873 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:16,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 11:01:16,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:17,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:01:17,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:17,290 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:01:17,291 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:17,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:17,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:17,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:17,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:01:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:17,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:17,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:01:17,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:01:17,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:01:17,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:01:17,977 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 11:01:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:20,193 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:01:20,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:01:20,194 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 11:01:20,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:20,195 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:01:20,195 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:01:20,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:01:20,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:01:20,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 11:01:20,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:01:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:01:20,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:01:20,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:20,199 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:01:20,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:01:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:01:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:01:20,199 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:20,200 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 11:01:20,200 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 11:01:20,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:20,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:01:20,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:20,732 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 2=[|v_#valid_19|]} [2019-08-05 11:01:20,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:20,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:20,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:20,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:20,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:20,787 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:20,809 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:20,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:20,810 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:21,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:21,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:01:21,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:01:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:01:21,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:01:21,533 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 11:01:23,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:23,802 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:01:23,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:01:23,802 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 11:01:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:23,803 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:01:23,803 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:01:23,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:01:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:01:23,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 11:01:23,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:01:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:01:23,808 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 11:01:23,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:23,808 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:01:23,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:01:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:01:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:01:23,809 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:23,809 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 11:01:23,809 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 11:01:23,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:24,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:01:24,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:24,580 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 2=[|v_#valid_20|]} [2019-08-05 11:01:24,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:24,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:24,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:24,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:24,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:24,623 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:24,669 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:24,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:24,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:01:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:25,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:25,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:01:25,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:01:25,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:01:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:01:25,413 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 11:01:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:27,743 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:01:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:01:27,743 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 11:01:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:27,744 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:01:27,744 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:01:27,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:01:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:01:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 11:01:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:01:27,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:01:27,748 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 11:01:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:27,749 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:01:27,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:01:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:01:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:01:27,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:27,749 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 11:01:27,750 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 11:01:27,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:28,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:01:28,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:28,599 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 2=[|v_#valid_21|]} [2019-08-05 11:01:28,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:28,652 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:28,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:28,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:28,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:28,678 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:28,703 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:28,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:28,704 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:01:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:30,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:30,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:01:30,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:01:30,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:01:30,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:01:30,106 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 11:01:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:33,120 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:01:33,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:01:33,120 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 11:01:33,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:33,121 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:01:33,122 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:01:33,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:01:33,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:01:33,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 11:01:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:01:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:01:33,125 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 11:01:33,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:33,126 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:01:33,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:01:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:01:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:01:33,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:33,126 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 11:01:33,127 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 11:01:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:33,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:01:33,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:33,501 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 2=[|v_#valid_22|]} [2019-08-05 11:01:33,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:33,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:33,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:33,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:33,556 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:33,556 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:33,579 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:33,580 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:33,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:01:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:35,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:35,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:01:35,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:01:35,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:01:35,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:01:35,050 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 11:01:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:38,205 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:01:38,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:01:38,205 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 11:01:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:38,206 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:01:38,206 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:01:38,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:01:38,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:01:38,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 11:01:38,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:01:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:01:38,210 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 11:01:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:38,210 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:01:38,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:01:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:01:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:01:38,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:38,211 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 11:01:38,211 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 11:01:38,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:38,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:01:38,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:38,674 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:01:38,674 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:38,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:38,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:38,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:38,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:01:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:39,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:39,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:01:39,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:01:39,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:01:39,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:01:39,653 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 11:01:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:42,350 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:01:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:01:42,351 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 11:01:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:42,352 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:01:42,352 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:01:42,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:01:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:01:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 11:01:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:01:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:01:42,356 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 11:01:42,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:42,356 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:01:42,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:01:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:01:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:01:42,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:42,357 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 11:01:42,357 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:42,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:42,358 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 11:01:42,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:42,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:01:42,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:42,881 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:01:42,881 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:42,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:42,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:42,890 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:42,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:01:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:43,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:43,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:01:43,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:01:43,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:01:43,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:01:43,896 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 11:01:46,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:46,906 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:01:46,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:01:46,911 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 11:01:46,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:46,912 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:01:46,912 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:01:46,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:01:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:01:46,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 11:01:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:01:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:01:46,915 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 11:01:46,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:46,915 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:01:46,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:01:46,915 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:01:46,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:01:46,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:46,916 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 11:01:46,916 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 11:01:46,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:47,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:01:47,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:47,392 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_23|]} [2019-08-05 11:01:47,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:47,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:47,420 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:47,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:01:47,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,456 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:01:47,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:47,456 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:01:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:48,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:48,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:01:48,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:01:48,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:01:48,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:01:48,807 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 11:01:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:52,497 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:01:52,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:01:52,497 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 11:01:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:52,498 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:01:52,499 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:01:52,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:01:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:01:52,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 11:01:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:01:52,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:01:52,502 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 11:01:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:52,502 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:01:52,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:01:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:01:52,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:01:52,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:52,503 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 11:01:52,503 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 11:01:52,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:53,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:01:53,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:53,430 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_43|], 2=[|v_#valid_24|]} [2019-08-05 11:01:53,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:53,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:01:53,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:53,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:53,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:01:53,476 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:53,499 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:53,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:53,500 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:01:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:55,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:55,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:01:55,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:01:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:01:55,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:01:55,068 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 11:01:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:58,974 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:01:58,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:01:58,975 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 11:01:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:58,976 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:01:58,976 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:01:58,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:01:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:01:58,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 11:01:58,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:01:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:01:58,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 11:01:58,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:58,980 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:01:58,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:01:58,980 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:01:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:01:58,981 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:58,981 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 11:01:58,981 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:58,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:58,982 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 11:01:58,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:00,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 1597 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:02:00,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:00,115 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_44|], 2=[|v_#valid_25|]} [2019-08-05 11:02:00,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:00,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:00,120 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:00,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:00,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:02:00,147 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:00,188 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:02:00,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:00,189 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:02:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:02:01,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:02:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:02:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:02:01,381 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 11:02:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:04,429 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:02:04,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:02:04,429 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 11:02:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:04,430 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:02:04,430 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:02:04,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:02:04,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:02:04,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 11:02:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:02:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:02:04,433 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 11:02:04,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:04,433 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:02:04,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:02:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:02:04,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:02:04,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:04,434 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 11:02:04,434 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:04,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:04,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 11:02:04,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:06,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:02:06,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:06,538 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:02:06,539 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:06,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:06,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:06,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:06,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:02:07,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:07,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:07,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:02:07,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:02:07,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:02:07,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:02:07,726 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 11:02:11,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:11,128 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:02:11,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:02:11,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 11:02:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:11,130 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:02:11,130 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:02:11,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:02:11,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:02:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 11:02:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:02:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:02:11,133 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 11:02:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:11,134 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:02:11,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:02:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:02:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:02:11,134 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:11,135 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 11:02:11,135 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:11,135 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 11:02:11,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:11,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:02:11,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:11,919 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 2=[|v_#valid_26|]} [2019-08-05 11:02:11,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:11,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:11,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:11,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:11,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:02:11,979 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:12,002 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:02:12,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:12,003 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:12,778 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:02:13,264 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:02:13,782 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:02:15,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:15,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:15,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:02:15,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:02:15,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:02:15,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:02:15,750 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 11:02:19,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:19,887 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:02:19,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:02:19,887 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 11:02:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:19,888 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:02:19,888 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:02:19,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:02:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:02:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 11:02:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:02:19,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:02:19,891 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 11:02:19,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:19,892 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:02:19,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:02:19,892 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:02:19,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:02:19,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:19,893 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 11:02:19,893 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:19,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:19,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 11:02:19,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:21,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:02:21,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:21,185 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_47|], 2=[|v_#valid_27|]} [2019-08-05 11:02:21,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:21,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:21,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:21,220 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:21,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:02:21,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:21,249 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:02:21,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:21,250 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:22,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:22,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:02:22,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:02:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:02:22,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:02:22,951 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 11:02:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:27,631 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:02:27,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:02:27,631 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 11:02:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:27,632 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:02:27,632 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:02:27,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:02:27,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:02:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 11:02:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:02:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:02:27,636 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 11:02:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:27,636 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:02:27,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:02:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:02:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:02:27,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:27,636 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 11:02:27,637 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 11:02:27,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:29,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:02:29,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:29,190 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 5=[|v_#valid_28|]} [2019-08-05 11:02:29,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:29,242 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:29,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:29,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:29,350 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-08-05 11:02:29,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 66 [2019-08-05 11:02:29,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:29,394 INFO L567 ElimStorePlain]: treesize reduction 23, result has 65.2 percent of original size [2019-08-05 11:02:29,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:29,395 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:43 [2019-08-05 11:02:31,704 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:02:31,727 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:31,728 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2019-08-05 11:02:31,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:31,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-08-05 11:02:31,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:31,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2019-08-05 11:02:31,743 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:31,795 INFO L567 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-08-05 11:02:31,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-08-05 11:02:31,796 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:102, output treesize:43 [2019-08-05 11:02:32,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:32,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:32,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:02:32,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:02:32,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:02:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:02:32,322 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 11:02:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:38,406 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:02:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:02:38,407 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 11:02:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:38,408 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:02:38,408 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:02:38,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:02:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:02:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 11:02:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:02:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:02:38,411 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 11:02:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:38,412 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:02:38,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:02:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:02:38,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:02:38,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:38,412 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 11:02:38,412 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:38,413 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 11:02:38,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:41,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:41,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1802 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:02:41,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:41,149 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_49|], 2=[|v_#valid_29|]} [2019-08-05 11:02:41,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:41,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:41,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:41,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:41,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:02:41,185 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:41,221 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:02:41,221 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:41,221 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:43,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:02:43,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:02:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:02:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:02:43,412 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 11:02:48,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:48,008 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:02:48,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:02:48,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 11:02:48,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:48,010 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:02:48,010 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:02:48,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:02:48,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:02:48,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 11:02:48,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:02:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:02:48,012 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 11:02:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:48,013 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:02:48,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:02:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:02:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:02:48,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:48,013 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 11:02:48,014 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:48,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:48,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 11:02:48,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:50,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 1843 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:02:50,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:50,353 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:02:50,354 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:50,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:50,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:50,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:50,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:02:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:52,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:52,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:02:52,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:02:52,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:02:52,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:02:52,109 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 11:02:53,414 WARN L188 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 11:02:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:56,495 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:02:56,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:02:56,496 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 11:02:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:56,497 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:02:56,497 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:02:56,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:02:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:02:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 11:02:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:02:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:02:56,500 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 11:02:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:56,500 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:02:56,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:02:56,501 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:02:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:02:56,501 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:56,501 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 11:02:56,502 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 11:02:56,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:58,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:02:58,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:58,942 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:02:58,943 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:02:58,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:58,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:58,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:58,950 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:03:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:00,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:00,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:03:00,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:03:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:03:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:03:00,259 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 11:03:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:04,270 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:03:04,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:03:04,271 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 11:03:04,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:04,272 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:03:04,272 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:03:04,273 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:03:04,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:03:04,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 11:03:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:03:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:03:04,276 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 11:03:04,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:04,276 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:03:04,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:03:04,276 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:03:04,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:03:04,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:04,277 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 11:03:04,277 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:04,278 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 11:03:04,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:05,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:03:05,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:05,814 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 2=[|v_#valid_30|]} [2019-08-05 11:03:05,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:05,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:05,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:05,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:05,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:03:05,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:05,936 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:03:05,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:05,936 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:03:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:07,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:07,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:03:07,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:03:07,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:03:07,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:03:07,557 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 11:03:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:11,509 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:03:11,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:03:11,509 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 11:03:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:11,510 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:03:11,511 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:03:11,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:03:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:03:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 11:03:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:03:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:03:11,513 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 11:03:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:11,513 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:03:11,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:03:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:03:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:03:11,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:11,514 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 11:03:11,514 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 11:03:11,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:12,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:03:12,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:12,923 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 2=[|v_#valid_31|]} [2019-08-05 11:03:12,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:12,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:12,973 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:13,099 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:03:13,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:13,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:03:13,110 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:13,136 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:03:13,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:13,137 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:15,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:15,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:03:15,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:03:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:03:15,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:03:15,296 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 11:03:20,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:20,664 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:03:20,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:03:20,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 11:03:20,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:20,666 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:03:20,666 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:03:20,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:03:20,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:03:20,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 11:03:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:03:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:03:20,673 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 11:03:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:20,673 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:03:20,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:03:20,673 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:03:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:03:20,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:20,674 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 11:03:20,674 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:20,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:20,675 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 11:03:20,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:22,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:03:22,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:22,999 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:03:22,999 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:23,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:23,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:23,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:23,008 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:03:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:24,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:24,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:03:24,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:03:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:03:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:03:24,443 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 11:03:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:28,757 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:03:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:03:28,757 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 11:03:28,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:28,759 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:03:28,759 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:03:28,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:03:28,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:03:28,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 11:03:28,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:03:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:03:28,762 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 11:03:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:28,763 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:03:28,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:03:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:03:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:03:28,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:28,764 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 11:03:28,764 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:28,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 11:03:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:31,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:03:31,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:31,593 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 2=[|v_#valid_32|]} [2019-08-05 11:03:31,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:31,612 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:31,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:31,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:31,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:03:31,647 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:31,669 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:03:31,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:31,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:03:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:33,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:33,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:03:33,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:03:33,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:03:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:03:33,520 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 11:03:38,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:38,035 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:03:38,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:03:38,036 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 11:03:38,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:38,037 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:03:38,037 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:03:38,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:03:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:03:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:03:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:03:38,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:03:38,042 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 11:03:38,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:38,042 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:03:38,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:03:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:03:38,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:03:38,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:38,043 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 11:03:38,043 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:38,044 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 11:03:38,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:42,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:03:42,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:42,647 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 2=[|v_#valid_33|]} [2019-08-05 11:03:42,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:42,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:42,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:42,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:42,718 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:03:42,719 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:03:42,754 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:03:42,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:42,755 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:45,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:45,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:03:45,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:03:45,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:03:45,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:03:45,028 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 11:03:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:51,076 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:03:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:03:51,077 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 11:03:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:51,079 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:03:51,079 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:03:51,080 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:03:51,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:03:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 11:03:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:03:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:03:51,082 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 11:03:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:51,083 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:03:51,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:03:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:03:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:03:51,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:51,084 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 11:03:51,084 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:51,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:51,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 11:03:51,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:55,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 2130 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:03:55,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:55,366 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 2=[|v_#valid_34|]} [2019-08-05 11:03:55,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:55,418 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:03:55,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:55,556 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:03:55,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:55,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:03:55,630 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:55,952 WARN L188 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 11:03:55,952 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:03:55,952 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:55,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:03:56,112 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 11:03:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:58,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:58,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:03:58,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:03:58,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:03:58,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:03:58,588 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 11:04:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:04,666 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:04:04,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:04:04,667 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 11:04:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:04,668 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:04:04,668 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:04:04,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:04:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:04:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 11:04:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:04:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:04:04,672 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 11:04:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:04,673 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:04:04,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:04:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:04:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:04:04,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:04,674 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 11:04:04,674 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 11:04:04,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:07,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 2171 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:04:07,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:07,551 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_58|], 2=[|v_#valid_35|]} [2019-08-05 11:04:07,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:07,607 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:07,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:07,680 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:04:07,681 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:07,705 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:04:07,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:07,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:04:08,037 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:04:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:10,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:10,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:04:10,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:04:10,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:04:10,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:04:10,868 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. Received shutdown request... [2019-08-05 11:04:15,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:04:15,422 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:04:15,427 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:04:15,427 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:04:15 BoogieIcfgContainer [2019-08-05 11:04:15,427 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:04:15,428 INFO L168 Benchmark]: Toolchain (without parser) took 243672.72 ms. Allocated memory was 141.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 108.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 493.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:15,429 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 11:04:15,429 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.03 ms. Allocated memory is still 141.0 MB. Free memory was 108.9 MB in the beginning and 107.2 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:04:15,429 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 105.9 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:04:15,429 INFO L168 Benchmark]: RCFGBuilder took 364.47 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 93.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:15,430 INFO L168 Benchmark]: TraceAbstraction took 243222.88 ms. Allocated memory was 141.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 93.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 477.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:15,431 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.18 ms. Allocated memory is still 141.0 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.03 ms. Allocated memory is still 141.0 MB. Free memory was 108.9 MB in the beginning and 107.2 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.63 ms. Allocated memory is still 141.0 MB. Free memory was 107.2 MB in the beginning and 105.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 364.47 ms. Allocated memory is still 141.0 MB. Free memory was 105.9 MB in the beginning and 93.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243222.88 ms. Allocated memory was 141.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 93.5 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 477.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 107). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and FLOYD_HOARE automaton (currently 47 states, 57 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 101 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 243.1s OverallTime, 53 OverallIterations, 53 TraceHistogramMax, 128.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 159 SDtfs, 53 SDslu, 350 SDs, 0 SdLazy, 3903 SolverSat, 5521 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4387 GetRequests, 1378 SyntacticMatches, 2 SemanticMatches, 3006 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29869 ImplicationChecksByTransitivity, 167.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=52, 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.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 52 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 45.6s SatisfiabilityAnalysisTime, 68.1s InterpolantComputationTime, 2968 NumberOfCodeBlocks, 2968 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2915 ConstructedInterpolants, 602 QuantifiedInterpolants, 3793733 SizeOfPredicates, 716 NumberOfNonLiveVariables, 58565 ConjunctsInSsa, 2518 ConjunctsInUnsatCore, 53 InterpolantComputations, 1 PerfectInterpolantSequences, 0/49608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown