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/960521-1_false-valid-free.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:59:05,090 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:59:05,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:59:05,107 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:59:05,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:59:05,109 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:59:05,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:59:05,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:59:05,115 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:59:05,116 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:59:05,117 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:59:05,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:59:05,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:59:05,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:59:05,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:59:05,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:59:05,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:59:05,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:59:05,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:59:05,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:59:05,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:59:05,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:59:05,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:59:05,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:59:05,135 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:59:05,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:59:05,136 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:59:05,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:59:05,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:59:05,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:59:05,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:59:05,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:59:05,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:59:05,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:59:05,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:59:05,148 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:59:05,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:59:05,149 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:59:05,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:59:05,150 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:59:05,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:59:05,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:59:05,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:59:05,219 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:59:05,221 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:59:05,221 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:59:05,222 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_false-valid-free.i_5.bpl [2019-08-05 10:59:05,222 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_false-valid-free.i_5.bpl' [2019-08-05 10:59:05,284 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:59:05,286 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:59:05,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:05,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:59:05,287 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:59:05,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:59:05,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:59:05,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:59:05,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:59:05,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,342 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,346 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/1) ... [2019-08-05 10:59:05,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:59:05,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:59:05,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:59:05,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:59:05,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (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 10:59:05,446 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:59:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:59:05,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:59:05,749 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:59:05,750 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:59:05,751 INFO L202 PluginConnector]: Adding new model 960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:05 BoogieIcfgContainer [2019-08-05 10:59:05,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:59:05,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:59:05,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:59:05,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:59:05,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:59:05" (1/2) ... [2019-08-05 10:59:05,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b938e5d and model type 960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:59:05, skipping insertion in model container [2019-08-05 10:59:05,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:59:05" (2/2) ... [2019-08-05 10:59:05,759 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i_5.bpl [2019-08-05 10:59:05,769 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:59:05,777 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:59:05,793 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:59:05,820 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:59:05,821 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:59:05,821 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:59:05,821 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:59:05,821 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:59:05,821 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:59:05,822 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:59:05,822 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:59:05,822 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:59:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:59:05,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:59:05,845 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:05,846 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:59:05,848 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:05,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:05,855 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 10:59:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:06,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:59:06,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:06,070 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_6|], 2=[|v_#valid_7|]} [2019-08-05 10:59:06,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:06,147 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 11 treesize of output 13 [2019-08-05 10:59:06,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:06,296 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:06,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:06,350 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 10:59:06,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:06,458 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:59:06,459 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:06,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:06,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:06,584 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 10:59:06,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:59:06,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:59:06,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:59:06,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:59:06,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:59:06,610 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:59:06,847 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:59:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:06,963 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:59:06,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:59:06,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:59:06,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:06,975 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:59:06,976 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:59:06,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:06,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:59:07,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:59:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:59:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:59:07,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:59:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:07,011 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:59:07,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:59:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:59:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:59:07,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:07,013 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:59:07,013 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 10:59:07,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:07,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:59:07,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:07,121 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_7|], 2=[|v_#valid_8|]} [2019-08-05 10:59:07,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:07,142 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 11 treesize of output 13 [2019-08-05 10:59:07,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:07,196 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:07,261 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 10:59:07,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:07,535 WARN L188 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:59:07,536 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:07,538 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:07,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:07,760 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 10:59:07,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:07,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:59:07,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:59:07,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:59:07,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:59:07,764 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:59:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:07,854 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:59:07,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:59:07,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:59:07,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:07,857 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:59:07,857 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:59:07,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:59:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:59:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:59:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:59:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:59:07,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:59:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:07,861 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:59:07,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:59:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:59:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:59:07,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:07,862 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:59:07,862 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:07,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 10:59:07,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:07,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:59:07,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:07,933 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_8|], 2=[|v_#valid_9|]} [2019-08-05 10:59:07,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:07,963 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 11 treesize of output 13 [2019-08-05 10:59:07,963 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:07,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:07,997 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 10:59:07,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:08,059 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:08,062 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:08,063 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:08,480 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:59:08,600 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 10:59:08,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:08,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:59:08,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:59:08,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:59:08,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:59:08,602 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 10:59:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:08,869 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:59:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:59:08,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:59:08,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:08,870 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:59:08,870 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:59:08,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:59:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:59:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:59:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:59:08,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:59:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:08,875 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:59:08,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:59:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:59:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:59:08,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:08,877 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:59:08,877 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:08,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:08,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 10:59:08,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:08,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:59:08,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:08,963 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_9|], 2=[|v_#valid_10|]} [2019-08-05 10:59:08,980 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:08,982 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 10:59:08,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:09,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:09,024 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 10:59:09,025 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:09,071 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:59:09,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:09,074 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:09,307 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 10:59:09,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:09,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:59:09,309 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:59:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:59:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:59:09,310 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 10:59:09,588 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 10:59:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:09,768 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:59:09,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:59:09,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:59:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:09,769 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:59:09,769 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:59:09,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:59:09,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:59:09,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:59:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:59:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:59:09,774 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:59:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:09,774 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:59:09,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:59:09,774 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:59:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:59:09,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:09,775 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:59:09,775 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 10:59:09,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:09,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:59:09,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:09,856 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_10|], 2=[|v_#valid_11|]} [2019-08-05 10:59:09,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:09,908 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 11 treesize of output 13 [2019-08-05 10:59:09,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:09,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:09,970 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 10:59:09,971 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:10,003 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:10,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:10,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:10,253 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 10:59:10,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:10,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:59:10,254 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:59:10,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:59:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:59:10,255 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 10:59:10,571 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-08-05 10:59:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:10,806 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:59:10,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:59:10,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:59:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:10,807 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:59:10,807 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:59:10,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:59:10,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:59:10,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:59:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:59:10,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:59:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:10,810 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:59:10,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:59:10,811 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:59:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:59:10,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:10,812 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:59:10,812 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:10,812 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 10:59:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:10,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:59:10,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:10,901 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 2=[|v_#valid_12|]} [2019-08-05 10:59:10,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:10,935 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 10:59:10,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:10,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:10,975 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 10:59:10,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:11,028 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 10:59:11,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:11,029 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:11,354 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 10:59:11,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:11,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:59:11,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:59:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:59:11,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:59:11,355 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 10:59:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:11,826 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:59:11,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:59:11,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 10:59:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:11,828 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:59:11,828 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:59:11,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:59:11,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:59:11,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:59:11,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:59:11,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:59:11,832 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:59:11,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:11,833 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:59:11,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:59:11,833 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:59:11,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:59:11,833 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:11,834 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:59:11,834 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:11,834 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 10:59:11,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:11,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:59:11,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:11,908 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_12|], 2=[|v_#valid_13|]} [2019-08-05 10:59:11,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:11,926 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 10:59:11,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:11,939 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:11,954 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 10:59:11,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:11,976 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:59:11,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:11,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:12,246 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 10:59:12,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:12,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:59:12,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:59:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:59:12,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:59:12,248 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 10:59:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:12,857 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:59:12,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:59:12,860 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 10:59:12,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:12,861 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:59:12,861 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:59:12,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:59:12,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:59:12,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:59:12,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:59:12,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:59:12,865 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:59:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:12,865 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:59:12,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:59:12,865 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:59:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:59:12,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:12,866 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:59:12,866 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:12,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:12,867 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 10:59:12,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:12,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:59:12,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:12,946 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_13|], 2=[|v_#valid_14|]} [2019-08-05 10:59:12,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:12,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:12,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:13,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:13,094 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 10:59:13,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:13,119 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:13,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:13,121 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:13,377 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 10:59:13,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:13,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:59:13,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:59:13,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:59:13,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:59:13,378 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 10:59:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:13,925 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:59:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:59:13,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 10:59:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:13,927 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:59:13,927 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:59:13,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 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 10:59:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:59:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:59:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:59:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:59:13,931 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:59:13,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:13,931 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:59:13,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:59:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:59:13,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:59:13,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:13,932 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:59:13,932 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:13,932 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 10:59:13,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:14,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:59:14,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:14,044 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_14|], 2=[|v_#valid_15|]} [2019-08-05 10:59:14,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:14,096 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 10:59:14,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:14,235 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:59:14,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:14,253 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 10:59:14,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:14,282 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 10:59:14,283 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:14,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:14,548 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 10:59:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:59:14,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:59:14,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:59:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:59:14,550 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 10:59:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:15,323 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:59:15,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:59:15,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 10:59:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:15,326 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:59:15,326 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:59:15,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:59:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:59:15,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:59:15,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:59:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:59:15,331 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:59:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:15,331 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:59:15,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:59:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:59:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:59:15,333 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:15,333 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:59:15,333 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:15,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 10:59:15,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:15,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:59:15,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:15,403 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_15|], 2=[|v_#valid_16|]} [2019-08-05 10:59:15,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:15,468 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 11 treesize of output 13 [2019-08-05 10:59:15,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:15,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:15,511 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 10:59:15,511 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:15,551 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:15,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:15,552 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:15,833 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 10:59:15,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:15,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:59:15,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:59:15,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:59:15,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:59:15,835 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 10:59:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:16,541 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:59:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:59:16,541 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 10:59:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:16,542 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:59:16,543 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:59:16,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:59:16,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:59:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:59:16,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:59:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:59:16,547 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:59:16,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:16,547 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:59:16,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:59:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:59:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:59:16,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:16,548 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:59:16,548 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:16,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:16,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 10:59:16,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:16,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:59:16,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:16,625 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_16|], 2=[|v_#valid_17|]} [2019-08-05 10:59:16,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:16,668 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 10:59:16,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:16,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:16,691 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 10:59:16,691 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:16,714 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:59:16,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:16,715 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:17,283 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:59:17,596 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 10:59:17,918 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 10:59:18,255 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:18,274 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 10:59:18,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:18,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:59:18,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:59:18,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:59:18,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:59:18,275 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 10:59:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:19,154 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:59:19,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:59:19,158 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 10:59:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:19,159 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:59:19,159 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:59:19,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:59:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:59:19,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:59:19,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:59:19,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:59:19,167 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:59:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:19,170 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:59:19,170 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:59:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:59:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:59:19,171 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:19,171 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:59:19,171 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:19,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:19,171 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 10:59:19,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:19,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:59:19,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:19,259 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_17|], 2=[|v_#valid_18|]} [2019-08-05 10:59:19,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:19,313 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 11 treesize of output 13 [2019-08-05 10:59:19,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:19,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:19,361 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 10:59:19,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:19,392 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:19,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:19,394 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:19,684 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 10:59:19,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:19,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:59:19,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:59:19,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:59:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:59:19,686 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 10:59:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:20,502 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:59:20,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:59:20,503 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 10:59:20,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:20,504 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:59:20,504 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:59:20,505 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 10:59:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:59:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:59:20,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:59:20,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:59:20,508 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:59:20,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:20,509 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:59:20,509 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:59:20,509 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:59:20,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:59:20,510 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:20,510 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:59:20,510 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:20,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:20,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 10:59:20,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:20,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:59:20,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:20,585 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_18|], 2=[|v_#valid_19|]} [2019-08-05 10:59:20,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:20,636 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 11 treesize of output 13 [2019-08-05 10:59:20,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:20,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:20,689 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 10:59:20,690 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:20,719 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:20,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:20,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:21,054 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 10:59:21,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:21,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:59:21,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:59:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:59:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:59:21,056 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 10:59:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:21,868 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:59:21,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:59:21,868 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 10:59:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:21,869 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:59:21,870 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:59:21,870 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:59:21,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:59:21,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:59:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:59:21,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:59:21,874 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:59:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:21,874 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:59:21,874 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:59:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:59:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:59:21,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:21,875 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:59:21,875 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:21,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:21,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 10:59:21,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:21,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:59:21,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:21,943 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_19|], 2=[|v_#valid_20|]} [2019-08-05 10:59:21,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:21,980 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 10:59:21,980 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:22,006 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:22,011 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 10:59:22,012 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:22,029 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:59:22,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:22,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:22,483 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 10:59:22,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:22,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:59:22,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:59:22,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:59:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:59:22,485 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 10:59:23,370 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 10:59:23,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:23,701 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:59:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:59:23,701 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 10:59:23,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:23,702 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:59:23,702 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:59:23,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:59:23,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:59:23,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:59:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:59:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:59:23,707 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:59:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:23,708 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:59:23,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:59:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:59:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:59:23,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:23,709 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:59:23,709 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 10:59:23,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:23,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:59:23,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:23,786 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 2=[|v_#valid_21|]} [2019-08-05 10:59:23,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:23,835 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 11 treesize of output 13 [2019-08-05 10:59:23,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:23,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:23,889 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 10:59:23,890 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:23,919 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:23,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:23,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:24,333 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 10:59:24,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:24,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:59:24,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:59:24,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:59:24,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:59:24,335 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 10:59:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:25,327 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:59:25,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:59:25,327 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 10:59:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:25,328 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:59:25,329 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:59:25,330 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:59:25,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:59:25,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:59:25,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:59:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:59:25,334 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:59:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:25,334 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:59:25,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:59:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:59:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:59:25,335 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:25,335 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:59:25,336 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:25,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 10:59:25,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:25,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:59:25,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:25,425 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_21|], 2=[|v_#valid_22|]} [2019-08-05 10:59:25,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:25,465 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 11 treesize of output 13 [2019-08-05 10:59:25,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:25,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:25,537 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 10:59:25,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:25,583 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:25,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:25,585 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:26,064 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 10:59:26,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:26,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:59:26,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:59:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:59:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:59:26,066 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 10:59:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:27,302 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:59:27,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:59:27,304 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 10:59:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:27,304 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:59:27,305 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:59:27,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:59:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:59:27,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:59:27,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:59:27,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:59:27,308 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:59:27,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:27,309 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:59:27,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:59:27,309 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:59:27,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:59:27,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:27,310 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:59:27,310 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:27,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:27,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 10:59:27,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:27,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:59:27,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:27,399 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 2=[|v_#valid_23|]} [2019-08-05 10:59:27,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:27,452 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 11 treesize of output 13 [2019-08-05 10:59:27,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:27,618 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:27,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:27,701 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 10:59:27,701 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:28,180 WARN L188 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:59:28,181 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:28,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:28,182 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:28,918 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 10:59:28,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:28,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:59:28,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:59:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:59:28,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:59:28,919 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 10:59:30,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:30,073 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:59:30,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:59:30,073 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 10:59:30,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:30,074 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:59:30,074 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:59:30,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:59:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:59:30,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:59:30,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:59:30,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:59:30,079 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:59:30,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:30,080 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:59:30,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:59:30,080 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:59:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:59:30,080 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:30,081 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:59:30,081 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:30,081 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 10:59:30,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:30,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:59:30,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:30,162 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 2=[|v_#valid_24|]} [2019-08-05 10:59:30,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:30,209 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 10:59:30,210 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:30,361 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:59:30,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:30,437 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 10:59:30,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:30,462 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:59:30,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:30,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:31,236 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 10:59:31,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:31,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:59:31,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:59:31,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:59:31,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:59:31,238 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2019-08-05 10:59:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:32,576 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:59:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:59:32,577 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 10:59:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:32,578 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:59:32,578 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:59:32,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:59:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:59:32,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:59:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:59:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:59:32,583 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:59:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:32,583 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:59:32,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:59:32,583 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:59:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:59:32,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:32,584 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:59:32,584 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:32,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 10:59:32,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:32,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:59:32,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:32,660 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 2=[|v_#valid_25|]} [2019-08-05 10:59:32,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:32,704 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 10:59:32,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:32,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:32,726 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 10:59:32,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:32,746 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:59:32,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:32,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:33,029 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:59:33,516 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 10:59:33,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:33,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:59:33,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:59:33,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:59:33,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:59:33,518 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 10:59:34,449 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 10:59:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:35,288 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:59:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:59:35,288 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 10:59:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:35,289 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:59:35,289 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:59:35,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:59:35,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:59:35,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:59:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:59:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:59:35,294 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:59:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:35,294 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:59:35,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:59:35,295 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:59:35,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:59:35,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:35,296 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:59:35,296 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:35,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:35,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 10:59:35,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:35,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:59:35,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:35,379 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 2=[|v_#valid_26|]} [2019-08-05 10:59:35,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:35,413 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 10:59:35,414 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:35,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:35,450 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 10:59:35,451 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:35,471 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:59:35,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:35,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:36,250 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 10:59:36,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:36,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:59:36,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:59:36,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:59:36,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:59:36,252 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 10:59:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:38,152 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:59:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:59:38,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 10:59:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:38,154 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:59:38,154 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:59:38,155 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 10:59:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:59:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:59:38,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:59:38,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:59:38,159 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:59:38,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:38,159 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:59:38,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:59:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:59:38,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:59:38,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:38,160 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:59:38,161 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 10:59:38,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:38,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:59:38,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:38,255 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 2=[|v_#valid_27|]} [2019-08-05 10:59:38,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:38,298 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 11 treesize of output 13 [2019-08-05 10:59:38,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:38,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:38,325 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 10:59:38,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:38,349 INFO L567 ElimStorePlain]: treesize reduction 12, result has 68.4 percent of original size [2019-08-05 10:59:38,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:38,350 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:39,036 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 10:59:39,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:39,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:59:39,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:59:39,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:59:39,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:59:39,037 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 10:59:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:40,525 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:59:40,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:59:40,526 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 10:59:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:40,527 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:59:40,527 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:59:40,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:59:40,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:59:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:59:40,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:59:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:59:40,531 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:59:40,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:40,532 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:59:40,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:59:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:59:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:59:40,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:40,533 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:59:40,533 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:40,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 10:59:40,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:40,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:59:40,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:40,655 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 2=[|v_#valid_28|]} [2019-08-05 10:59:40,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:40,696 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 11 treesize of output 13 [2019-08-05 10:59:40,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:40,865 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:40,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:40,949 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 10:59:40,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:41,332 WARN L188 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-08-05 10:59:41,332 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:41,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:41,333 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:41,931 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 10:59:41,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:41,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:59:41,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:59:41,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:59:41,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:59:41,932 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2019-08-05 10:59:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:43,476 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:59:43,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:59:43,478 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 10:59:43,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:43,479 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:59:43,479 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:59:43,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:59:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:59:43,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:59:43,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:59:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:59:43,483 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:59:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:43,483 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:59:43,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:59:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:59:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:59:43,484 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:43,484 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:59:43,484 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:43,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:43,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 10:59:43,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:43,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:59:43,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:43,592 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 2=[|v_#valid_29|]} [2019-08-05 10:59:43,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:43,641 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 11 treesize of output 13 [2019-08-05 10:59:43,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:43,810 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:43,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:43,875 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 10:59:43,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:43,906 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:43,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:43,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:44,580 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 10:59:44,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:44,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:59:44,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:59:44,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:59:44,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:59:44,582 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 10:59:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:46,358 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:59:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:59:46,359 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 10:59:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:46,359 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:59:46,359 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:59:46,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:59:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:59:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:59:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:59:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:59:46,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:59:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:46,365 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:59:46,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:59:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:59:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:59:46,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:46,366 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:59:46,366 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 10:59:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:46,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:59:46,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:46,469 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 2=[|v_#valid_30|]} [2019-08-05 10:59:46,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:46,521 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 11 treesize of output 13 [2019-08-05 10:59:46,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:46,663 WARN L188 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:46,663 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:46,703 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 10:59:46,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:46,732 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:46,733 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:46,733 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:47,433 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 10:59:47,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:47,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:59:47,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:59:47,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:59:47,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:59:47,434 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 10:59:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:49,240 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:59:49,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:59:49,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 10:59:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:49,241 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:59:49,241 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:59:49,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:59:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:59:49,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:59:49,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:59:49,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:59:49,245 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:59:49,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:49,246 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:59:49,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:59:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:59:49,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:59:49,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:49,246 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:59:49,247 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:49,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:49,247 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 10:59:49,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:49,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:59:49,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:49,352 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 2=[|v_#valid_31|]} [2019-08-05 10:59:49,400 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:49,401 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 11 treesize of output 13 [2019-08-05 10:59:49,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:49,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:49,447 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 10:59:49,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:49,663 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:59:49,663 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:49,664 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:49,665 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:50,278 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:59:51,064 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:59:51,742 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:59:52,631 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 10:59:52,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:52,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:59:52,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:59:52,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:59:52,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:59:52,633 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 10:59:54,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:54,634 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:59:54,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:59:54,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 10:59:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:54,635 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:59:54,635 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:59:54,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:59:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:59:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:59:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:59:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:59:54,640 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:59:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:54,640 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:59:54,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:59:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:59:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:59:54,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:54,641 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:59:54,641 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:54,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:54,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 10:59:54,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:54,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:54,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:59:54,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:54,742 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 2=[|v_#valid_32|]} [2019-08-05 10:59:54,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:54,795 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 11 treesize of output 13 [2019-08-05 10:59:54,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:54,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:54,874 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 10:59:54,875 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:54,906 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:54,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:54,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:55,585 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 10:59:55,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:55,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:59:55,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:59:55,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:59:55,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:59:55,586 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 10:59:57,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:57,637 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:59:57,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:59:57,638 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 10:59:57,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:57,639 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:59:57,639 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:59:57,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:59:57,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:59:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:59:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:59:57,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:59:57,644 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:59:57,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:57,644 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:59:57,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:59:57,644 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:59:57,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:59:57,645 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:57,645 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:59:57,645 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:57,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:57,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 10:59:57,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:57,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:59:57,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:57,780 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 2=[|v_#valid_33|]} [2019-08-05 10:59:57,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:57,828 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 11 treesize of output 13 [2019-08-05 10:59:57,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:57,986 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:57,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:58,042 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 10:59:58,042 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:58,071 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:58,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:58,072 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:58,777 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 10:59:58,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:58,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:59:58,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:59:58,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:59:58,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:59:58,779 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 11:00:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:00,885 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:00:00,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:00:00,886 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 11:00:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:00,887 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:00:00,887 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:00:00,889 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:00:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:00:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 11:00:00,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:00:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:00:00,891 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:00:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:00,891 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:00:00,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:00:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:00:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:00:00,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:00,892 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 11:00:00,893 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:00,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:00,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 11:00:00,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:00,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:00:00,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:01,011 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 2=[|v_#valid_34|]} [2019-08-05 11:00:01,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:01,064 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 11 treesize of output 13 [2019-08-05 11:00:01,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:01,221 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:00:01,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:01,280 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:01,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:01,315 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:01,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:01,315 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:02,768 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:00:02,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:02,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:00:02,769 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:00:02,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:00:02,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:00:02,769 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 11:00:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:05,033 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:00:05,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:00:05,034 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 11:00:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:05,035 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:00:05,035 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:00:05,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:00:05,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:00:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 11:00:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:00:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:00:05,039 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:00:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:05,040 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:00:05,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:00:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:00:05,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:00:05,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:05,040 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 11:00:05,041 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:05,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:05,041 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 11:00:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:05,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:00:05,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:05,168 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 2=[|v_#valid_35|]} [2019-08-05 11:00:05,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:05,214 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 11 treesize of output 13 [2019-08-05 11:00:05,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:05,391 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:00:05,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:05,458 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:05,458 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:05,749 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 11:00:05,749 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:00:05,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:05,750 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:06,601 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:00:06,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:06,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:00:06,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:00:06,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:00:06,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:00:06,602 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 11:00:08,316 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-08-05 11:00:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:09,120 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:00:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:00:09,120 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 11:00:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:09,121 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:00:09,121 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:00:09,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:00:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:00:09,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 11:00:09,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:00:09,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:00:09,125 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:00:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:09,125 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:00:09,125 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:00:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:00:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:00:09,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:09,126 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 11:00:09,126 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 11:00:09,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:09,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:09,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:00:09,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:09,247 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 2=[|v_#valid_36|]} [2019-08-05 11:00:09,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:09,287 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:09,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:09,438 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:00:09,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:09,483 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:09,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:09,514 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:09,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:09,515 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:10,533 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:00:10,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:10,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:00:10,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:00:10,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:00:10,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:00:10,535 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 11:00:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:13,152 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:00:13,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:00:13,152 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 11:00:13,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:13,153 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:00:13,154 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:00:13,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:00:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:00:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 11:00:13,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:00:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:00:13,157 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:00:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:13,158 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:00:13,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:00:13,158 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:00:13,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:00:13,158 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:13,158 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 11:00:13,159 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:13,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:13,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 11:00:13,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:13,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:00:13,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:13,260 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 2=[|v_#valid_37|]} [2019-08-05 11:00:13,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:13,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:00:13,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:13,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:13,312 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:13,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:13,340 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:00:13,341 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:13,341 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:14,209 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:00:14,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:14,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:00:14,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:00:14,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:00:14,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:00:14,210 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 11:00:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:16,735 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:00:16,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:00:16,736 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 11:00:16,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:16,736 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:00:16,737 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:00:16,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:00:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:00:16,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 11:00:16,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:00:16,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:00:16,740 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 11:00:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:16,740 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:00:16,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:00:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:00:16,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:00:16,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:16,741 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 11:00:16,741 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:16,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:16,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 11:00:16,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:16,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:00:16,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:16,868 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 2=[|v_#valid_38|]} [2019-08-05 11:00:16,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:16,903 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 11 treesize of output 13 [2019-08-05 11:00:16,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:17,067 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:00:17,067 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:17,139 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:17,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:17,517 WARN L188 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-08-05 11:00:17,517 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:17,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:17,518 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:17,643 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:00:19,045 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:00:19,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:19,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:00:19,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:00:19,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:00:19,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:00:19,047 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 11:00:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:21,581 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:00:21,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:00:21,581 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 11:00:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:21,582 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:00:21,582 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:00:21,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:00:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:00:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 11:00:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:00:21,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:00:21,586 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 11:00:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:21,586 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:00:21,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:00:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:00:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:00:21,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:21,587 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 11:00:21,587 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:21,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 11:00:21,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:21,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:00:21,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:21,728 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 2=[|v_#valid_39|]} [2019-08-05 11:00:21,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:21,775 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 11 treesize of output 13 [2019-08-05 11:00:21,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:21,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:21,829 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:21,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:21,866 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:21,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:21,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:22,835 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:00:22,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:22,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:00:22,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:00:22,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:00:22,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:00:22,837 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 11:00:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:25,575 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:00:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:00:25,576 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 11:00:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:25,577 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:00:25,577 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:00:25,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:00:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:00:25,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 11:00:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:00:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:00:25,582 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 11:00:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:25,582 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:00:25,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:00:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:00:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:00:25,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:25,583 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 11:00:25,583 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 11:00:25,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:25,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:00:25,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:25,714 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 2=[|v_#valid_40|]} [2019-08-05 11:00:25,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:25,765 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:25,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:25,905 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:00:25,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:25,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 32 treesize of output 30 [2019-08-05 11:00:25,980 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:26,310 WARN L188 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 11:00:26,311 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:00:26,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:26,312 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:27,564 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:00:27,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:27,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:00:27,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:00:27,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:00:27,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:00:27,566 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 11:00:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:30,703 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:00:30,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:00:30,704 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 11:00:30,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:30,705 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:00:30,705 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:00:30,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:00:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:00:30,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 11:00:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:00:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:00:30,708 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 11:00:30,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:30,709 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:00:30,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:00:30,709 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:00:30,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:00:30,709 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:30,709 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 11:00:30,710 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:30,710 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 11:00:30,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:30,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:00:30,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:30,849 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 2=[|v_#valid_41|]} [2019-08-05 11:00:30,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:30,900 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,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,023 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:00:31,024 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:31,041 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:31,041 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:31,063 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:00:31,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:31,064 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:32,332 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:00:32,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:32,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:00:32,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:00:32,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:00:32,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:00:32,333 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 11:00:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:35,616 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:00:35,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:00:35,617 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 11:00:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:35,618 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:00:35,618 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:00:35,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:00:35,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:00:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 11:00:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:00:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:00:35,622 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 11:00:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:35,622 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:00:35,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:00:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:00:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:00:35,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:35,623 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 11:00:35,623 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:35,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 11:00:35,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:35,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:00:35,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:35,763 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_41|], 2=[|v_#valid_42|]} [2019-08-05 11:00:35,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:35,801 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 11 treesize of output 13 [2019-08-05 11:00:35,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:35,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:35,856 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:35,857 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:35,880 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:35,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:35,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:37,032 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:00:37,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:37,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:00:37,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:00:37,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:00:37,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:00:37,033 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 11:00:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:40,206 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:00:40,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:00:40,214 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 11:00:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:40,214 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:00:40,214 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:00:40,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:00:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:00:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 11:00:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:00:40,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:00:40,217 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 11:00:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:40,217 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:00:40,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:00:40,217 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:00:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:00:40,217 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:40,217 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 11:00:40,218 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 11:00:40,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:40,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:40,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:00:40,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:40,384 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_43|]} [2019-08-05 11:00:40,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:40,408 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 11 treesize of output 13 [2019-08-05 11:00:40,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:40,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:40,447 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:40,447 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:40,472 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:40,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:40,473 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:41,555 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:00:41,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:41,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:00:41,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:00:41,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:00:41,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:00:41,557 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 11:00:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:44,923 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:00:44,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:00:44,924 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 11:00:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:44,925 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:00:44,925 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:00:44,926 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:00:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:00:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 11:00:44,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:00:44,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:00:44,929 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 11:00:44,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:44,929 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:00:44,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:00:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:00:44,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:00:44,930 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:44,930 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 11:00:44,931 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:44,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:44,931 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 11:00:44,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:45,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:00:45,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:45,072 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_43|], 2=[|v_#valid_44|]} [2019-08-05 11:00:45,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:45,124 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 11 treesize of output 13 [2019-08-05 11:00:45,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:45,287 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:00:45,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:45,369 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:45,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:45,712 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-08-05 11:00:45,713 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:45,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:45,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:46,903 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:00:46,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:46,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:00:46,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:00:46,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:00:46,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:00:46,904 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 11:00:50,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:50,337 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:00:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:00:50,337 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 11:00:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:50,338 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:00:50,338 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:00:50,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:00:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:00:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 11:00:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:00:50,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:00:50,342 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 11:00:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:50,343 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:00:50,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:00:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:00:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:00:50,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:50,344 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 11:00:50,344 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:50,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 11:00:50,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:50,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:00:50,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:50,494 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_44|], 2=[|v_#valid_45|]} [2019-08-05 11:00:50,511 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:50,512 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 11 treesize of output 13 [2019-08-05 11:00:50,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:50,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:50,548 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:50,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:50,574 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:50,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:50,575 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:51,776 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:00:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:51,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:00:51,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:00:51,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:00:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:00:51,777 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 11:00:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:55,428 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:00:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:00:55,428 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 11:00:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:55,429 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:00:55,429 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:00:55,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:00:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:00:55,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 11:00:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:00:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:00:55,432 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 11:00:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:55,433 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:00:55,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:00:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:00:55,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:00:55,433 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:55,433 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 11:00:55,434 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:55,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 11:00:55,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:55,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:00:55,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:55,585 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 2=[|v_#valid_46|]} [2019-08-05 11:00:55,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:55,604 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 11 treesize of output 13 [2019-08-05 11:00:55,605 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:55,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:55,644 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:55,645 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:55,675 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:00:55,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:55,676 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:56,973 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:00:56,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:56,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:00:56,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:00:56,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:00:56,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:00:56,974 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 11:01:00,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:00,670 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:01:00,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:01:00,670 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 11:01:00,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:00,671 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:01:00,671 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:01:00,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:01:00,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:01:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 11:01:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:01:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:01:00,675 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 11:01:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:00,675 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:01:00,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:01:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:01:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:01:00,676 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:00,676 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 11:01:00,677 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 11:01:00,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:00,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:01:00,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:00,799 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 2=[|v_#valid_47|]} [2019-08-05 11:01:00,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:00,821 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 11 treesize of output 13 [2019-08-05 11:01:00,821 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:00,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:00,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 23 treesize of output 21 [2019-08-05 11:01:00,840 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:00,869 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:01:00,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:00,870 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:02,314 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:01:02,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:02,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:01:02,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:01:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:01:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:01:02,315 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 11:01:06,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:06,107 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:01:06,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:01:06,107 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 11:01:06,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:06,108 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:01:06,109 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:01:06,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:01:06,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:01:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 11:01:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:01:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:01:06,113 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 11:01:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:06,113 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:01:06,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:01:06,113 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:01:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:01:06,114 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:06,114 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 11:01:06,114 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:06,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:06,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 11:01:06,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:06,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:01:06,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:06,286 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_47|], 2=[|v_#valid_48|]} [2019-08-05 11:01:06,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:06,304 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 11 treesize of output 13 [2019-08-05 11:01:06,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:06,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:06,326 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:06,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:06,351 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:01:06,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:06,352 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:08,223 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:01:08,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:08,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:01:08,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:01:08,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:01:08,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:01:08,224 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 11:01:12,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:12,220 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:01:12,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:01:12,221 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 11:01:12,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:12,222 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:01:12,222 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:01:12,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:01:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:01:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 11:01:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:01:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:01:12,225 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 11:01:12,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:12,225 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:01:12,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:01:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:01:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:01:12,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:12,226 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 11:01:12,226 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:12,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:12,226 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 11:01:12,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:12,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:12,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:01:12,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:12,366 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 2=[|v_#valid_49|]} [2019-08-05 11:01:12,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:12,394 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:12,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:12,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:12,422 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:12,422 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:12,446 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:01:12,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:12,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:01:14,478 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:01:14,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:14,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:01:14,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:01:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:01:14,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:01:14,479 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 11:01:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:18,724 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:01:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:01:18,724 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 11:01:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:18,725 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:01:18,725 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:01:18,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:01:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:01:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 11:01:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:01:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:01:18,729 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 11:01:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:18,730 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:01:18,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:01:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:01:18,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:01:18,730 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:18,730 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 11:01:18,731 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:18,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:18,731 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 11:01:18,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:18,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:01:18,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:18,883 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_49|], 2=[|v_#valid_50|]} [2019-08-05 11:01:18,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:18,898 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 11 treesize of output 13 [2019-08-05 11:01:18,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:18,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:18,930 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:18,930 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:18,954 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:01:18,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:18,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:20,684 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:01:20,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:20,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:01:20,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:01:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:01:20,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:01:20,686 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 11:01:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:24,931 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:01:24,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:01:24,932 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 11:01:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:24,933 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:01:24,933 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:01:24,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:01:24,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:01:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 11:01:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:01:24,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:01:24,936 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 11:01:24,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:24,937 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:01:24,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:01:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:01:24,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:01:24,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:24,938 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 11:01:24,938 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:24,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:24,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 11:01:24,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:25,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:01:25,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:25,085 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 2=[|v_#valid_51|]} [2019-08-05 11:01:25,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:25,108 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 11 treesize of output 13 [2019-08-05 11:01:25,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:25,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:25,126 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:25,127 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:25,152 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:01:25,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:25,153 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:26,907 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:01:26,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:01:26,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:01:26,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:01:26,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:01:26,909 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 11:01:31,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:31,262 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:01:31,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:01:31,263 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 11:01:31,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:31,264 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:01:31,264 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:01:31,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:01:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:01:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 11:01:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:01:31,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:01:31,267 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 11:01:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:31,268 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:01:31,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:01:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:01:31,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:01:31,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:31,268 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 11:01:31,269 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:31,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:31,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 11:01:31,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:31,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:01:31,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:31,416 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_51|], 2=[|v_#valid_52|]} [2019-08-05 11:01:31,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:31,437 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 11 treesize of output 13 [2019-08-05 11:01:31,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:31,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:31,461 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:31,461 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:31,483 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:01:31,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:31,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:33,086 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:01:33,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:33,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:01:33,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:01:33,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:01:33,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:01:33,088 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 11:01:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:37,631 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:01:37,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:01:37,631 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 11:01:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:37,632 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:01:37,633 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:01:37,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:01:37,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:01:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 11:01:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:01:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:01:37,636 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 11:01:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:37,636 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:01:37,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:01:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:01:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:01:37,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:37,636 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 11:01:37,637 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 11:01:37,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:37,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:01:37,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:37,860 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 2=[|v_#valid_53|]} [2019-08-05 11:01:37,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:37,902 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 11 treesize of output 13 [2019-08-05 11:01:37,902 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:37,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:37,944 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:37,945 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:38,379 WARN L188 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 11:01:38,379 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:01:38,379 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:38,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:40,249 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:01:40,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:40,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:01:40,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:01:40,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:01:40,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:01:40,250 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 11:01:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:44,837 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:01:44,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:01:44,838 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 11:01:44,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:44,839 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:01:44,839 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:01:44,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:01:44,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:01:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 11:01:44,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:01:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:01:44,842 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 11:01:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:44,842 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:01:44,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:01:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:01:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:01:44,843 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:44,843 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 11:01:44,844 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:44,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:44,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 11:01:44,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:44,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:01:45,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:45,003 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 2=[|v_#valid_54|]} [2019-08-05 11:01:45,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:45,023 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 11 treesize of output 13 [2019-08-05 11:01:45,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:45,089 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:45,089 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:45,114 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:01:45,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:45,115 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:46,856 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:01:46,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:46,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:01:46,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:01:46,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:01:46,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:01:46,858 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 11:01:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:51,676 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:01:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:01:51,676 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 11:01:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:51,677 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:01:51,678 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:01:51,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:01:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:01:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 11:01:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:01:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:01:51,682 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 11:01:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:51,683 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:01:51,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:01:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:01:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:01:51,683 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:51,684 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 11:01:51,684 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 11:01:51,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:51,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:01:51,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:51,863 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_54|], 2=[|v_#valid_55|]} [2019-08-05 11:01:51,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:51,876 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 11 treesize of output 13 [2019-08-05 11:01:51,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:51,900 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:51,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:51,930 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:01:51,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:51,931 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:53,689 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:01:53,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:53,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:01:53,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:01:53,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:01:53,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:01:53,691 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 11:01:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:58,640 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:01:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:01:58,640 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 11:01:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:58,641 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:01:58,641 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:01:58,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:01:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:01:58,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 11:01:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:01:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:01:58,646 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 11:01:58,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:58,647 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:01:58,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:01:58,647 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:01:58,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:01:58,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:58,647 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 11:01:58,648 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:58,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:58,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 11:01:58,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:58,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:01:58,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:58,816 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 2=[|v_#valid_56|]} [2019-08-05 11:01:58,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:01:58,830 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 11 treesize of output 13 [2019-08-05 11:01:58,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:58,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:58,873 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:58,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:01:58,901 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 11:01:58,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:01:58,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:02:00,971 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:02:00,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:00,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:02:00,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:02:00,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:02:00,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:02:00,973 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 11:02:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:06,135 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:02:06,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:02:06,136 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 11:02:06,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:06,137 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:02:06,137 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:02:06,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:02:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:02:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:02:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:02:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:02:06,141 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 11:02:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:06,141 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:02:06,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:02:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:02:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:02:06,142 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:06,142 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 11:02:06,142 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:06,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 11:02:06,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:06,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:02:06,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:06,327 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 2=[|v_#valid_57|]} [2019-08-05 11:02:06,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:06,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, 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:06,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:06,373 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:06,378 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:06,378 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:06,408 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:02:06,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:06,409 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:08,899 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:02:08,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:08,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:02:08,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:02:08,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:02:08,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:02:08,901 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 11:02:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:14,430 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:02:14,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:02:14,431 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 11:02:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:14,432 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:02:14,433 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:02:14,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:02:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:02:14,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 11:02:14,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:02:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:02:14,436 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 11:02:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:14,436 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:02:14,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:02:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:02:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:02:14,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:14,437 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 11:02:14,437 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:14,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:14,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 11:02:14,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:14,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:02:14,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:14,626 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 2=[|v_#valid_58|]} [2019-08-05 11:02:14,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:14,657 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:14,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:14,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:14,684 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:02:14,685 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:14,706 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:02:14,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:14,707 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:17,550 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:02:17,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:17,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:02:17,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:02:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:02:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:02:17,551 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 11:02:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:23,216 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:02:23,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:02:23,217 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 11:02:23,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:23,218 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:02:23,218 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:02:23,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:02:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:02:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 11:02:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:02:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:02:23,222 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 11:02:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:23,222 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:02:23,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:02:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:02:23,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:02:23,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:23,223 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 11:02:23,224 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:23,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:23,224 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 11:02:23,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:23,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:02:23,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:23,543 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_58|], 2=[|v_#valid_59|]} [2019-08-05 11:02:23,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:23,590 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 11 treesize of output 13 [2019-08-05 11:02:23,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:23,698 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 11:02:23,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:23,704 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:02:23,704 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:23,728 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:02:23,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:23,729 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:02:25,956 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:02:25,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:25,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:02:25,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:02:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:02:25,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:02:25,958 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2019-08-05 11:02:31,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:31,554 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:02:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:02:31,555 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2019-08-05 11:02:31,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:31,556 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:02:31,556 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:02:31,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:02:31,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:02:31,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 11:02:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:02:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:02:31,559 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 11:02:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:31,560 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:02:31,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:02:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:02:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:02:31,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:31,560 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 11:02:31,561 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 11:02:31,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:31,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:02:31,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:31,776 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 2=[|v_#valid_60|]} [2019-08-05 11:02:31,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:31,794 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:31,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:31,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:31,829 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:31,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:31,855 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:02:31,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:31,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:34,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:34,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:02:34,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:02:34,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:02:34,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:02:34,566 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2019-08-05 11:02:40,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:40,556 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:02:40,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:02:40,556 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 11:02:40,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:40,557 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:02:40,558 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:02:40,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:02:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:02:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 11:02:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:02:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:02:40,561 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 11:02:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:40,562 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:02:40,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:02:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:02:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:02:40,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:40,563 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 11:02:40,563 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:40,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 11:02:40,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:40,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:40,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:02:40,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:40,793 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 2=[|v_#valid_61|]} [2019-08-05 11:02:40,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:40,844 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:40,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:40,986 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:02:40,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:41,051 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,051 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:02:41,493 WARN L188 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-08-05 11:02:41,493 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:02:41,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:41,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:41,644 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:02:41,801 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:02:41,999 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:02:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:44,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:44,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:02:44,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:02:44,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:02:44,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=1875, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:02:44,915 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2019-08-05 11:02:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:51,118 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:02:51,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:02:51,119 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2019-08-05 11:02:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:51,120 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:02:51,120 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:02:51,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=4793, Invalid=8317, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:02:51,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:02:51,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 11:02:51,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:02:51,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:02:51,123 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 11:02:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:51,124 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:02:51,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:02:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:02:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:02:51,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:51,125 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 11:02:51,125 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:51,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 11:02:51,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:51,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:02:51,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:51,334 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_61|], 2=[|v_#valid_62|]} [2019-08-05 11:02:51,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:02:51,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, 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:51,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:51,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:51,411 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:02:51,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:51,442 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:02:51,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:02:51,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:02:54,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:54,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:54,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:02:54,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:02:54,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:02:54,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=1937, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:02:54,439 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2019-08-05 11:03:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:00,886 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:03:00,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:03:00,887 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 11:03:00,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:00,888 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:03:00,888 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:03:00,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:03:00,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:03:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 11:03:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:03:00,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:03:00,893 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 11:03:00,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:00,893 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:03:00,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:03:00,893 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:03:00,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:03:00,894 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:00,894 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 11:03:00,894 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:00,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:00,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 11:03:00,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:01,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:03:01,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:01,143 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_62|], 2=[|v_#valid_63|]} [2019-08-05 11:03:01,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:01,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 11 treesize of output 13 [2019-08-05 11:03:01,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:01,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:01,199 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:01,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:01,222 INFO L567 ElimStorePlain]: treesize reduction 12, result has 68.4 percent of original size [2019-08-05 11:03:01,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:01,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:03:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:03,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:03,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:03:03,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:03:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:03:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1660, Invalid=2000, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:03:03,781 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 61 states. [2019-08-05 11:03:10,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:10,032 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:03:10,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:03:10,033 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 116 [2019-08-05 11:03:10,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:10,034 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:03:10,034 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:03:10,035 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5138, Invalid=8904, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:03:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:03:10,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-08-05 11:03:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:03:10,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:03:10,038 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 11:03:10,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:10,038 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:03:10,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:03:10,038 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:03:10,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:03:10,039 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:10,039 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 11:03:10,039 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:10,040 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2019-08-05 11:03:10,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:10,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1150 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 11:03:10,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:10,314 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_63|], 2=[|v_#valid_64|]} [2019-08-05 11:03:10,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:03:10,339 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:10,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:10,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:10,371 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:10,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:10,390 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:03:10,391 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:03:10,391 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 Received shutdown request... [2019-08-05 11:03:11,521 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 11:03:11,521 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:03:11,526 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:03:11,526 INFO L202 PluginConnector]: Adding new model 960521-1_false-valid-free.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:03:11 BoogieIcfgContainer [2019-08-05 11:03:11,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:03:11,527 INFO L168 Benchmark]: Toolchain (without parser) took 246241.98 ms. Allocated memory was 135.3 MB in the beginning and 1.0 GB in the end (delta: 876.1 MB). Free memory was 112.6 MB in the beginning and 376.4 MB in the end (delta: -263.9 MB). Peak memory consumption was 612.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:11,527 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:03:11,528 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.80 ms. Allocated memory is still 135.3 MB. Free memory was 112.3 MB in the beginning and 110.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:11,528 INFO L168 Benchmark]: Boogie Preprocessor took 43.06 ms. Allocated memory is still 135.3 MB. Free memory was 110.7 MB in the beginning and 109.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:11,529 INFO L168 Benchmark]: RCFGBuilder took 378.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 96.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:11,529 INFO L168 Benchmark]: TraceAbstraction took 245773.41 ms. Allocated memory was 135.3 MB in the beginning and 1.0 GB in the end (delta: 876.1 MB). Free memory was 96.6 MB in the beginning and 376.4 MB in the end (delta: -279.9 MB). Peak memory consumption was 596.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:03:11,530 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.22 ms. Allocated memory is still 135.3 MB. Free memory was 114.0 MB in the beginning and 113.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.80 ms. Allocated memory is still 135.3 MB. Free memory was 112.3 MB in the beginning and 110.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.06 ms. Allocated memory is still 135.3 MB. Free memory was 110.7 MB in the beginning and 109.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 378.22 ms. Allocated memory is still 135.3 MB. Free memory was 109.5 MB in the beginning and 96.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 245773.41 ms. Allocated memory was 135.3 MB in the beginning and 1.0 GB in the end (delta: 876.1 MB). Free memory was 96.6 MB in the beginning and 376.4 MB in the end (delta: -279.9 MB). Peak memory consumption was 596.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 116). Cancelled while BasicCegarLoop was analyzing trace of length 119 with TraceHistMax 58,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 29 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 245.7s OverallTime, 58 OverallIterations, 58 TraceHistogramMax, 155.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 172 SDtfs, 1 SDslu, 412 SDs, 0 SdLazy, 4431 SolverSat, 6546 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5070 GetRequests, 1598 SyntacticMatches, 0 SemanticMatches, 3472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37235 ImplicationChecksByTransitivity, 200.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=57, 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.1s AutomataMinimizationTime, 57 MinimizatonAttempts, 57 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 82.7s InterpolantComputationTime, 3420 NumberOfCodeBlocks, 3420 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3363 ConstructedInterpolants, 3306 QuantifiedInterpolants, 5304117 SizeOfPredicates, 879 NumberOfNonLiveVariables, 34143 ConjunctsInSsa, 2843 ConjunctsInUnsatCore, 57 InterpolantComputations, 1 PerfectInterpolantSequences, 0/61712 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown