java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:04:28,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:04:28,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:04:28,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:04:28,861 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:04:28,862 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:04:28,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:04:28,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:04:28,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:04:28,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:04:28,869 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:04:28,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:04:28,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:04:28,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:04:28,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:04:28,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:04:28,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:04:28,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:04:28,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:04:28,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:04:28,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:04:28,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:04:28,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:04:28,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:04:28,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:04:28,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:04:28,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:04:28,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:04:28,890 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:04:28,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:04:28,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:04:28,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:04:28,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:04:28,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:04:28,895 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:04:28,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:04:28,896 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:04:28,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:04:28,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:04:28,898 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:04:28,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:04:28,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:04:28,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:04:28,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:04:28,945 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:04:28,946 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:04:28,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl [2019-08-05 11:04:28,947 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl' [2019-08-05 11:04:29,007 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:04:29,008 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:04:29,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:29,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:04:29,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:04:29,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:29,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:04:29,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:04:29,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:04:29,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... [2019-08-05 11:04:29,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:04:29,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:04:29,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:04:29,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:04:29,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:04:29,163 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:04:29,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:04:29,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:04:29,522 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:04:29,523 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:04:29,524 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:29 BoogieIcfgContainer [2019-08-05 11:04:29,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:04:29,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:04:29,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:04:29,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:04:29,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:28" (1/2) ... [2019-08-05 11:04:29,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74dda44d and model type standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:04:29, skipping insertion in model container [2019-08-05 11:04:29,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:29" (2/2) ... [2019-08-05 11:04:29,537 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_strcpy_false-valid-deref_ground.i_8.bpl [2019-08-05 11:04:29,548 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:04:29,559 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:04:29,575 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:04:29,601 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:04:29,602 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:04:29,603 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:04:29,603 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:04:29,603 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:04:29,603 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:04:29,603 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:04:29,603 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:04:29,604 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:04:29,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:04:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:04:29,627 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:29,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:04:29,631 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:29,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 11:04:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:29,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:04:29,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:30,042 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:04:30,043 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:30,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:30,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:30,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:30,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:30,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:30,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:04:30,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:04:30,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:04:30,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:04:30,237 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 11:04:30,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:30,392 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:04:30,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:30,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:04:30,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:30,404 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:04:30,405 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:04:30,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:04:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:04:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:04:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:04:30,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 11:04:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:30,441 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:04:30,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:04:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:04:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:04:30,442 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:30,442 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:04:30,443 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:30,458 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 11:04:30,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:30,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:04:30,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:30,770 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:04:30,770 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:30,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:30,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:30,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:30,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:30,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:30,941 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:04:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:31,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:31,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:04:31,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:31,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:31,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:31,096 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:04:31,286 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:04:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:31,335 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:04:31,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:04:31,336 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:04:31,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:31,337 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:04:31,337 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:04:31,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:31,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:04:31,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:04:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:04:31,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:04:31,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 11:04:31,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:31,344 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:04:31,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:04:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:04:31,346 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:31,346 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 11:04:31,346 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:31,346 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 11:04:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:31,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:04:31,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:31,560 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:31,561 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:31,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:31,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:31,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:31,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:31,988 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:04:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:32,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:32,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:04:32,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:32,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:32,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:32,010 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:04:32,586 WARN L188 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-08-05 11:04:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:32,666 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:04:32,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:04:32,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:04:32,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:32,667 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:04:32,668 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:04:32,669 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:04:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:04:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:04:32,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:04:32,672 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 11:04:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:32,672 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:04:32,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:04:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:04:32,673 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:32,673 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 11:04:32,673 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:32,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:32,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 11:04:32,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:32,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:04:32,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:32,788 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_9|], 2=[|v_#valid_7|]} [2019-08-05 11:04:32,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:32,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:32,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:32,868 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:32,884 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:04:32,885 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:32,922 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:04:32,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:32,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:04:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:33,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:33,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:04:33,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:04:33,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:04:33,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:33,066 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 11:04:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:33,449 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:04:33,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:04:33,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 11:04:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:33,452 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:04:33,452 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:04:33,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:04:33,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:04:33,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:04:33,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:04:33,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 11:04:33,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:33,456 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:04:33,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:04:33,457 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:04:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:04:33,457 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:33,457 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 11:04:33,458 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 11:04:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:33,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:04:33,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:33,630 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:33,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:33,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:33,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:33,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:33,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:33,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:33,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:04:33,926 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:04:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:04:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:33,926 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 11:04:34,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:34,298 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:04:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:04:34,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 11:04:34,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:34,299 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:04:34,299 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:04:34,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:04:34,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:04:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:04:34,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:04:34,302 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 11:04:34,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:34,303 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:04:34,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:04:34,303 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:04:34,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:04:34,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:34,304 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 11:04:34,304 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:34,304 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 11:04:34,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:34,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:04:34,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:34,445 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 2=[|v_#valid_8|]} [2019-08-05 11:04:34,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:34,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:34,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:34,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:34,541 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:04:34,542 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:34,656 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-08-05 11:04:34,656 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:04:34,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:34,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:04:34,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:34,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:34,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:34,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:04:34,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:04:34,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:34,801 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 11:04:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:35,193 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:04:35,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:04:35,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:04:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:35,195 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:04:35,195 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:04:35,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:35,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:04:35,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 11:04:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:04:35,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:04:35,199 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 11:04:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:35,199 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:04:35,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:04:35,200 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:04:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:04:35,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:35,200 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 11:04:35,201 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:35,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 11:04:35,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:35,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:35,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:35,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:35,469 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:35,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:35,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,478 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,478 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:35,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:35,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:04:35,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:04:35,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:04:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:35,654 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 11:04:36,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:36,121 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:04:36,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:04:36,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 11:04:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:36,125 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:04:36,125 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:04:36,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:04:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:04:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:04:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:04:36,129 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 11:04:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:36,130 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:04:36,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:04:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:04:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:04:36,131 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:36,131 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 11:04:36,131 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:36,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:36,131 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 11:04:36,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:36,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:04:36,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:36,454 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:04:36,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:36,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:04:36,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:36,540 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:04:36,541 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:36,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:21 [2019-08-05 11:04:36,546 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,555 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,584 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:04:36,770 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:36,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:36,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:04:36,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:04:36,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:04:36,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:04:36,772 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 11:04:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:37,213 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:04:37,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:04:37,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:04:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:37,220 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:04:37,220 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:04:37,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:37,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:04:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:04:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:04:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:04:37,223 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 11:04:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:37,224 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:04:37,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:04:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:04:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:04:37,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:37,225 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 11:04:37,225 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 11:04:37,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:37,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:04:37,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:37,388 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_14|], 5=[|v_#valid_9|]} [2019-08-05 11:04:37,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:37,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:37,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:37,591 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-08-05 11:04:37,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:37,806 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-08-05 11:04:37,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 62 [2019-08-05 11:04:37,808 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:37,849 INFO L567 ElimStorePlain]: treesize reduction 22, result has 66.2 percent of original size [2019-08-05 11:04:37,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:37,850 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:43 [2019-08-05 11:04:37,954 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-08-05 11:04:38,224 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-08-05 11:04:38,329 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:04:38,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-08-05 11:04:38,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:38,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:38,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2019-08-05 11:04:38,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-08-05 11:04:38,388 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,430 INFO L567 ElimStorePlain]: treesize reduction 53, result has 28.4 percent of original size [2019-08-05 11:04:38,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:38,431 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:120, output treesize:21 [2019-08-05 11:04:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:38,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:38,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:04:38,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:04:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:04:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:38,590 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 11:04:38,957 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-08-05 11:04:39,108 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-08-05 11:04:39,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:39,618 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:04:39,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:04:39,620 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 11:04:39,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:39,621 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:04:39,621 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:04:39,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:04:39,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 11:04:39,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:04:39,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:04:39,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 11:04:39,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:39,627 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:04:39,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:04:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:04:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:04:39,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:39,628 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 11:04:39,628 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:39,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 11:04:39,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:39,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:04:39,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:39,926 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:39,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:39,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:39,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:40,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:40,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:40,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:04:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:04:40,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:40,142 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 11:04:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:40,737 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:04:40,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:04:40,738 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:04:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:40,739 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:04:40,739 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:04:40,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:04:40,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:04:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 11:04:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:04:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:04:40,744 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 11:04:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:40,744 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:04:40,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:04:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:04:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:04:40,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:40,745 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 11:04:40,745 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 11:04:40,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:40,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:04:40,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:40,867 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_16|], 2=[|v_#valid_10|]} [2019-08-05 11:04:40,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:40,918 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:40,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,951 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:40,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:04:40,959 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:40,981 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:04:40,981 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:40,982 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:04:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:41,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:41,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:04:41,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:04:41,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:04:41,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:41,197 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 11:04:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:41,918 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:04:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:04:41,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:04:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:41,919 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:04:41,920 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:04:41,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:04:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:04:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 11:04:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:04:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:04:41,925 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 11:04:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:41,925 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:04:41,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:04:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:04:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:04:41,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:41,927 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 11:04:41,927 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 11:04:41,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:42,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:04:42,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:42,108 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_17|], 2=[|v_#valid_11|]} [2019-08-05 11:04:42,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:42,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:42,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,303 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:04:42,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:04:42,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:42,764 WARN L188 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 11:04:42,765 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:04:42,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,766 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:04:43,009 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:43,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:43,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:04:43,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:04:43,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:04:43,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:04:43,011 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 11:04:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:43,693 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:04:43,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:04:43,695 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:04:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:43,696 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:04:43,696 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:04:43,697 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:04:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:04:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 11:04:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:04:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:04:43,700 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 11:04:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:43,700 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:04:43,700 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:04:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:04:43,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:04:43,701 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:43,701 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 11:04:43,702 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:43,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:43,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 11:04:43,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:43,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:04:43,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:44,024 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:44,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:44,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:44,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:44,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:44,040 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:44,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:44,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:04:44,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:04:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:04:44,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:44,418 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 11:04:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:45,241 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:04:45,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:04:45,242 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:04:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:45,245 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:04:45,245 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:04:45,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:04:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:04:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 11:04:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:04:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:04:45,250 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:04:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:45,250 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:04:45,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:04:45,250 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:04:45,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:04:45,251 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:45,251 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 11:04:45,252 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:45,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:45,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 11:04:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:45,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:04:45,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:45,714 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:04:45,715 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:45,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:45,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:45,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:45,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:45,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:45,965 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:04:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:46,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:46,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:04:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:04:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:46,180 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 11:04:47,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:47,143 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:04:47,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:47,144 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:04:47,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:47,144 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:04:47,145 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:04:47,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:04:47,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:04:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 11:04:47,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:04:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:04:47,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:04:47,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:47,149 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:04:47,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:04:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:04:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:04:47,151 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:47,151 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 11:04:47,151 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 11:04:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:47,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:04:47,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:47,366 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 2=[|v_#valid_12|]} [2019-08-05 11:04:47,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:47,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:47,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,565 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:04:47,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:47,636 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:04:47,637 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,938 WARN L188 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-08-05 11:04:47,938 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:04:47,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:47,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:04:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:48,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:48,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:48,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:48,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:48,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:48,455 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 11:04:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:49,495 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:04:49,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:49,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:04:49,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:49,496 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:04:49,496 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:04:49,498 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:04:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:04:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 11:04:49,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:04:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:04:49,501 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 11:04:49,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:49,501 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:04:49,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:49,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:04:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:04:49,502 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:49,503 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 11:04:49,503 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:49,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:49,503 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 11:04:49,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:49,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:04:49,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:49,799 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_21|], 2=[|v_#valid_13|]} [2019-08-05 11:04:49,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:04:49,851 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:49,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:50,000 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:04:50,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:50,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:04:50,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:04:50,497 WARN L188 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-08-05 11:04:50,498 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:04:50,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:50,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:04:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:50,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:50,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:50,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:50,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:50,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:50,823 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 11:04:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:51,889 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:04:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:51,891 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:04:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:51,891 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:04:51,892 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:04:51,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:04:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:04:51,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 11:04:51,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:04:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:04:51,897 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 11:04:51,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:51,897 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:04:51,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:51,898 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:04:51,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:04:51,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:51,899 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 11:04:51,899 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 11:04:51,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:52,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:04:52,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:52,403 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:04:52,404 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:52,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:52,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:52,524 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:04:52,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:52,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:52,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:52,761 WARN L188 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:04:53,676 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:53,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:53,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:53,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:53,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:53,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:53,678 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 11:04:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:54,736 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:04:54,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:54,736 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:04:54,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:54,737 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:04:54,737 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:04:54,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:04:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:04:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 11:04:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:04:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:04:54,742 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 11:04:54,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:54,742 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:04:54,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:04:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:04:54,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:54,744 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 11:04:54,744 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:54,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 11:04:54,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:55,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:04:55,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:55,363 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:04:55,364 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:55,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:55,364 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:55,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:55,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:55,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:55,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:55,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:55,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:55,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:55,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:55,963 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2019-08-05 11:04:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:57,092 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:04:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:04:57,093 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:04:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:57,094 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:04:57,094 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:04:57,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:04:57,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:04:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 11:04:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:04:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:04:57,099 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 11:04:57,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:57,099 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:04:57,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:57,099 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:04:57,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:04:57,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:57,100 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 11:04:57,101 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:57,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 11:04:57,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:57,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:04:57,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:57,551 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:04:57,551 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:04:57,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:04:57,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:57,669 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:04:57,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:57,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:04:57,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:04:57,878 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:04:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:58,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:58,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:04:58,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:04:58,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:04:59,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:04:59,000 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 11:05:00,108 WARN L188 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 11:05:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:00,692 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:05:00,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:05:00,693 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:05:00,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:00,693 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:05:00,693 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:05:00,694 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:05:00,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:05:00,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 11:05:00,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:05:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:05:00,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 11:05:00,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:00,698 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:05:00,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:05:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:05:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:05:00,699 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:00,699 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 11:05:00,700 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:00,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 11:05:00,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:00,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:05:00,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:01,131 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:05:01,131 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:05:01,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:01,132 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:01,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:01,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:01,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:05:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:02,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:02,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:05:02,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:05:02,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:05:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:05:02,626 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 11:05:03,434 WARN L188 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-08-05 11:05:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:04,826 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:05:04,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:05:04,827 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:05:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:04,828 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:05:04,828 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:05:04,829 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:05:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:05:04,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 11:05:04,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:05:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:05:04,926 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 11:05:04,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:04,926 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:05:04,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:05:04,926 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:05:04,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:05:04,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:04,927 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 11:05:04,928 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:04,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 11:05:04,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:05,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:05:05,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:05,339 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:05:05,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:05,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:05,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:05,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:05,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:05:05,783 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:05,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:05,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:05:05,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:05:05,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:05:05,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:05:05,785 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 11:05:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:07,193 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:05:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:05:07,193 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:05:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:07,194 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:05:07,194 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:05:07,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:05:07,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:05:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 11:05:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:05:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:05:07,199 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 11:05:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:07,200 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:05:07,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:05:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:05:07,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:05:07,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:07,201 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 11:05:07,201 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 11:05:07,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:07,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:05:07,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:07,506 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 2=[|v_#valid_14|]} [2019-08-05 11:05:07,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:07,557 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:05:07,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:07,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:07,604 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:05:07,605 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:07,649 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:05:07,649 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:07,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:05:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:08,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:08,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:05:08,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:05:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:05:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:05:08,323 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2019-08-05 11:05:10,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:10,209 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:05:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:05:10,212 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:05:10,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:10,213 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:05:10,213 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:05:10,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:05:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:05:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 11:05:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:05:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:05:10,218 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 11:05:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:10,218 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:05:10,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:05:10,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:05:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:05:10,219 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:10,219 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 11:05:10,219 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:10,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:10,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 11:05:10,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:11,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:05:11,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:11,044 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 2=[|v_#valid_15|]} [2019-08-05 11:05:11,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:11,095 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:05:11,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:11,233 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 11:05:11,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:11,243 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:05:11,244 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:11,272 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:05:11,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:11,273 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:05:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:11,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:11,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:05:11,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:05:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:05:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:05:11,762 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 11:05:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:13,241 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:05:13,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:05:13,241 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:05:13,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:13,242 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:05:13,242 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:05:13,244 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:05:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:05:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 11:05:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:05:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:05:13,247 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 11:05:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:13,247 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:05:13,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:05:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:05:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:05:13,248 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:13,248 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 11:05:13,249 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:13,249 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 11:05:13,249 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:14,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:05:14,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:14,119 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:05:14,119 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:14,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:14,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:14,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:14,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:05:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:14,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:14,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:05:14,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:05:14,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:05:14,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:05:14,992 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 11:05:16,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:16,641 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:05:16,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:05:16,641 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:05:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:16,642 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:05:16,643 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:05:16,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:05:16,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:05:16,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 11:05:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:05:16,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:05:16,647 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 11:05:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:16,647 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:05:16,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:05:16,647 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:05:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:05:16,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:16,648 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 11:05:16,648 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:16,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:16,648 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 11:05:16,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:17,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:05:17,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:17,143 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 2=[|v_#valid_16|]} [2019-08-05 11:05:17,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:17,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:05:17,186 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:17,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:17,244 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:05:17,245 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:17,263 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:05:17,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:17,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:05:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:17,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:17,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:05:17,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:05:17,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:05:17,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:05:17,929 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 11:05:19,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:19,466 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:05:19,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:05:19,467 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:05:19,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:19,467 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:05:19,467 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:05:19,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:05:19,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:05:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 11:05:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:05:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:05:19,472 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 11:05:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:19,472 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:05:19,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:05:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:05:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:05:19,473 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:19,473 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 11:05:19,473 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 11:05:19,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:20,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:05:20,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:20,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:20,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-08-05 11:05:20,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:20,217 INFO L567 ElimStorePlain]: treesize reduction 10, result has 70.6 percent of original size [2019-08-05 11:05:20,218 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:20,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:20,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:21 [2019-08-05 11:05:20,219 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:20,225 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:20,231 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 11:05:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:20,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:20,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:05:20,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:05:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:05:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:05:20,804 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 11:05:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:22,442 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:05:22,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:05:22,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:05:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:22,444 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:05:22,444 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:05:22,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:05:22,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:05:22,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 11:05:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:05:22,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:05:22,448 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 11:05:22,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:22,448 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:05:22,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:05:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:05:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:05:22,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:22,449 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 11:05:22,450 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:22,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:22,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 11:05:22,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:23,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:23,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:05:23,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:23,270 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 2=[|v_#valid_17|]} [2019-08-05 11:05:23,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:23,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:05:23,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:23,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:23,368 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:05:23,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:23,388 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:05:23,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:23,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:05:23,611 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 11:05:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:24,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:24,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:05:24,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:05:24,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:05:24,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:05:24,155 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 11:05:24,703 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-08-05 11:05:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:26,177 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:05:26,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:05:26,178 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 11:05:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:26,179 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:05:26,179 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:05:26,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:05:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:05:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 11:05:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:05:26,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:05:26,183 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:05:26,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:26,183 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:05:26,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:05:26,184 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:05:26,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:05:26,184 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:26,184 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 11:05:26,185 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:26,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 11:05:26,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:26,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:26,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 1146 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:05:26,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:26,899 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 2=[|v_#valid_18|]} [2019-08-05 11:05:26,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:26,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 11:05:26,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:26,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:26,964 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:05:26,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:26,987 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:05:26,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:26,988 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:05:27,319 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 11:05:28,143 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-08-05 11:05:28,641 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:05:28,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:28,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:05:28,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:05:28,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:05:28,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:05:28,643 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 11:05:31,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:31,401 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:05:31,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:05:31,402 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 11:05:31,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:31,402 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:05:31,403 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:05:31,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:05:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:05:31,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 11:05:31,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:05:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:05:31,407 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:05:31,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:31,407 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:05:31,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:05:31,407 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:05:31,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:05:31,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:31,408 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 11:05:31,408 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:31,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:31,409 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 11:05:31,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:31,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:05:31,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:31,849 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:05:31,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:31,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:31,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:31,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:05:31,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:05:32,542 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:05:32,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:32,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:05:32,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:05:32,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:05:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:05:32,543 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 11:05:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:34,397 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:05:34,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:05:34,397 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 11:05:34,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:34,398 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:05:34,398 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:05:34,401 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:05:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:05:34,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 11:05:34,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:05:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:05:34,402 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:05:34,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:34,402 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:05:34,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:05:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:05:34,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:05:34,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:34,403 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 11:05:34,403 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:34,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:34,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 11:05:34,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:34,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 1228 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:05:34,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:34,800 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:05:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:34,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:34,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:34,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:34,809 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:05:35,708 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:05:35,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:35,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:05:35,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:05:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:05:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:05:35,709 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 11:05:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,818 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:05:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:05:37,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 11:05:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,820 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:05:37,820 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:05:37,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:05:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:05:37,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 11:05:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:05:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:05:37,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:05:37,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,824 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:05:37,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:05:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:05:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:05:37,825 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,825 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 11:05:37,825 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 11:05:37,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:38,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1269 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:05:38,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:38,358 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 2=[|v_#valid_19|]} [2019-08-05 11:05:38,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:38,376 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:05:38,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,412 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:05:38,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:38,436 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:05:38,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:05:39,149 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:05:39,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:39,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:05:39,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:05:39,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:05:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:05:39,151 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 11:05:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:41,472 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:05:41,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:05:41,472 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 11:05:41,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:41,473 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:05:41,473 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:05:41,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:05:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:05:41,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 11:05:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:05:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:05:41,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 11:05:41,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:41,479 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:05:41,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:05:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:05:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:05:41,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:41,480 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 11:05:41,480 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:41,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:41,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 11:05:41,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:42,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 1310 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:05:42,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:42,174 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 2=[|v_#valid_20|]} [2019-08-05 11:05:42,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:42,201 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:05:42,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:42,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:42,219 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:05:42,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:42,242 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:05:42,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:42,243 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:05:42,947 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:05:42,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:42,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:05:42,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:05:42,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:05:42,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:05:42,949 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 11:05:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:45,179 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:05:45,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:05:45,180 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 11:05:45,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:45,181 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:05:45,181 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:05:45,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:05:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:05:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 11:05:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:05:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:05:45,185 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 11:05:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:45,185 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:05:45,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:05:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:05:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:05:45,186 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:45,186 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 11:05:45,186 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:45,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 11:05:45,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:46,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1351 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:05:46,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:46,045 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 2=[|v_#valid_21|]} [2019-08-05 11:05:46,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:46,095 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:05:46,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:46,128 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:05:46,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:46,180 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:05:46,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:46,180 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:05:47,349 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:05:47,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:47,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:05:47,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:05:47,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:05:47,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:05:47,350 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 11:05:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:50,315 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:05:50,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:05:50,315 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 11:05:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:50,316 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:05:50,317 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:05:50,318 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:05:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:05:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 11:05:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:05:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:05:50,320 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 11:05:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:50,321 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:05:50,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:05:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:05:50,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:05:50,322 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:50,322 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 11:05:50,322 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:50,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:50,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 11:05:50,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:50,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 1392 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:05:50,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:50,732 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 2=[|v_#valid_22|]} [2019-08-05 11:05:50,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:05:50,745 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:05:50,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:50,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:50,805 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:05:50,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:05:50,844 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:05:50,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:50,844 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:05:52,002 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:05:52,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:52,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:05:52,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:05:52,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:05:52,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:05:52,004 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 11:05:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:55,203 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:05:55,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:05:55,204 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 11:05:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:55,205 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:05:55,205 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:05:55,206 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:05:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:05:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 11:05:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:05:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:05:55,209 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 11:05:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:55,209 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:05:55,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:05:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:05:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:05:55,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:55,210 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 11:05:55,210 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:55,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 11:05:55,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:55,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 1433 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:05:55,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:55,734 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:05:55,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:05:55,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:55,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:55,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:55,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:05:56,859 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:05:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:05:56,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:05:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:05:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:05:56,861 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 11:05:59,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:59,547 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:05:59,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:05:59,548 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 11:05:59,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:59,549 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:05:59,549 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:05:59,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:05:59,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:05:59,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 11:05:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:05:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:05:59,553 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 11:05:59,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:59,553 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:05:59,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:05:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:05:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:05:59,553 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:59,553 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 11:05:59,554 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:59,554 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 11:05:59,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:00,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 1474 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:06:00,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:00,142 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:06:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:00,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:00,148 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:00,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:00,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:06:01,394 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:06:01,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:01,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:06:01,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:06:01,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:06:01,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:06:01,396 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 11:06:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:04,302 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:06:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:06:04,303 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 11:06:04,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:04,304 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:06:04,304 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:06:04,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:06:04,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:06:04,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 11:06:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:06:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:06:04,307 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 11:06:04,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:04,307 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:06:04,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:06:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:06:04,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:06:04,308 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:04,308 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 11:06:04,308 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 11:06:04,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:04,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 1515 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:06:04,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:04,824 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_23|]} [2019-08-05 11:06:04,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:04,855 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:06:04,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:04,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:04,869 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:06:04,870 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:04,902 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:06:04,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:04,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:06:06,487 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:06:06,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:06,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:06:06,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:06:06,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:06:06,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:06:06,488 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 11:06:10,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:10,193 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:06:10,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:06:10,194 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 11:06:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:10,195 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:06:10,195 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:06:10,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:06:10,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:06:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 11:06:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:06:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:06:10,200 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 11:06:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:10,200 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:06:10,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:06:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:06:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:06:10,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:10,201 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 11:06:10,201 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:10,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 11:06:10,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:11,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 1556 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:06:11,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:11,219 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_43|], 2=[|v_#valid_24|]} [2019-08-05 11:06:11,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:11,234 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:06:11,235 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:11,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:11,301 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:06:11,302 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:11,333 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:06:11,334 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:11,334 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:06:12,814 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:06:12,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:12,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:06:12,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:06:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:06:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:06:12,816 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 11:06:15,365 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 11:06:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:16,847 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:06:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:06:16,847 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 11:06:16,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:16,848 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:06:16,848 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:06:16,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:06:16,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:06:16,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 11:06:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:06:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:06:16,852 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 11:06:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:16,853 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:06:16,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:06:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:06:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:06:16,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:16,854 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 11:06:16,854 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 11:06:16,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:17,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 1597 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:06:17,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:17,937 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_44|], 2=[|v_#valid_25|]} [2019-08-05 11:06:17,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:17,964 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:06:17,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:17,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:17,995 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:06:17,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:18,017 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:06:18,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:18,018 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-08-05 11:06:19,180 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:06:19,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:19,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:06:19,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:06:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:06:19,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:06:19,181 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 11:06:22,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:22,486 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:06:22,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:06:22,486 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 11:06:22,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:22,487 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:06:22,487 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:06:22,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:06:22,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:06:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 11:06:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:06:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:06:22,489 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 11:06:22,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:22,489 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:06:22,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:06:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:06:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:06:22,490 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:22,490 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 11:06:22,490 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 11:06:22,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:24,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 1638 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:06:24,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:24,304 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:06:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:06:24,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:24,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:24,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:24,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:06:25,481 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:06:25,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:25,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:06:25,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:06:25,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:06:25,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:06:25,482 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 11:06:27,260 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-08-05 11:06:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:29,028 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:06:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:06:29,029 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 11:06:29,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:29,030 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:06:29,030 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:06:29,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:06:29,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:06:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 11:06:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:06:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:06:29,034 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 11:06:29,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:29,034 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:06:29,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:06:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:06:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:06:29,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:29,035 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 11:06:29,035 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:29,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 11:06:29,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:29,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:06:29,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:29,756 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 2=[|v_#valid_26|]} [2019-08-05 11:06:29,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:29,806 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:06:29,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,846 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:29,851 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:06:29,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:29,874 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:06:29,874 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:29,875 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:06:30,484 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:06:30,915 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:06:31,370 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:06:31,880 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:06:33,369 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:06:33,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:33,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:06:33,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:06:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:06:33,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:06:33,370 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 11:06:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:37,573 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:06:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:06:37,574 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 11:06:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:37,574 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:06:37,575 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:06:37,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:06:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:06:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 11:06:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:06:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:06:37,578 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 11:06:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:37,579 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:06:37,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:06:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:06:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:06:37,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:37,580 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 11:06:37,580 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 11:06:37,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:38,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 1720 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:06:38,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:38,870 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_47|], 2=[|v_#valid_27|]} [2019-08-05 11:06:38,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:38,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 9 treesize of output 11 [2019-08-05 11:06:38,898 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:38,915 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:38,924 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:06:38,924 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:38,945 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:06:38,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:38,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:06:40,491 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:06:40,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:40,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:06:40,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:06:40,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:06:40,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:06:40,492 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 11:06:45,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:45,172 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:06:45,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:06:45,173 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 11:06:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:45,174 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:06:45,174 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:06:45,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:06:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:06:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 11:06:45,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:06:45,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:06:45,177 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 11:06:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:45,178 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:06:45,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:06:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:06:45,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:06:45,178 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:45,178 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 11:06:45,178 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:45,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:45,179 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 11:06:45,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:46,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1761 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:06:46,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:46,713 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 5=[|v_#valid_28|]} [2019-08-05 11:06:46,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:46,771 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:06:46,772 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:46,819 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:46,929 INFO L341 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-08-05 11:06:46,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 66 [2019-08-05 11:06:46,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:46,989 INFO L567 ElimStorePlain]: treesize reduction 23, result has 65.2 percent of original size [2019-08-05 11:06:46,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:46,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:43 [2019-08-05 11:06:49,301 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 11:06:49,319 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:49,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2019-08-05 11:06:49,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:49,323 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-08-05 11:06:49,324 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:49,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2019-08-05 11:06:49,330 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:49,380 INFO L567 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-08-05 11:06:49,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-08-05 11:06:49,381 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:102, output treesize:43 [2019-08-05 11:06:49,793 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:06:49,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:06:49,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:06:49,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:06:49,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:06:49,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:06:49,794 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 11:06:52,051 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 39 [2019-08-05 11:06:55,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:06:55,768 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:06:55,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:06:55,768 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 11:06:55,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:06:55,769 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:06:55,770 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:06:55,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:06:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:06:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 11:06:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:06:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:06:55,773 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 11:06:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:06:55,774 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:06:55,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:06:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:06:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:06:55,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:06:55,774 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 11:06:55,775 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:06:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:06:55,775 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 11:06:55,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:06:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:06:58,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 1802 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:06:58,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:06:58,381 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_49|], 2=[|v_#valid_29|]} [2019-08-05 11:06:58,397 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:06:58,398 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:06:58,399 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:06:58,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:06:58,436 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:06:58,437 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:06:58,460 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:06:58,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:06:58,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:07:00,598 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:07:00,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:00,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:07:00,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:07:00,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:07:00,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:07:00,599 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 11:07:05,224 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2019-08-05 11:07:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:05,246 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:07:05,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:07:05,246 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 11:07:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:05,248 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:07:05,248 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:07:05,248 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:07:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:07:05,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 11:07:05,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:07:05,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:07:05,251 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 11:07:05,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:05,251 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:07:05,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:07:05,252 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:07:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:07:05,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:05,252 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 11:07:05,253 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:05,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 11:07:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:07,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 1843 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:07:07,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:07,912 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:07:07,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:07,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:07,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:07,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:07,919 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:07:09,826 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:07:09,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:09,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:07:09,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:07:09,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:07:09,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:07:09,828 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 11:07:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:13,738 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:07:13,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:07:13,739 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 11:07:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:13,740 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:07:13,740 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:07:13,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:07:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:07:13,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 11:07:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:07:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:07:13,743 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 11:07:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:13,744 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:07:13,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:07:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:07:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:07:13,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:13,745 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 11:07:13,745 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 11:07:13,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:16,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:07:16,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:16,074 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:07:16,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:16,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:16,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:16,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:17 [2019-08-05 11:07:17,392 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:07:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:07:17,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:07:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:07:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:07:17,394 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 11:07:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:21,357 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:07:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:07:21,357 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 11:07:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:21,358 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:07:21,359 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:07:21,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:07:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:07:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 11:07:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:07:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:07:21,362 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 11:07:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:21,363 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:07:21,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:07:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:07:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:07:21,363 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:21,364 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 11:07:21,364 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 11:07:21,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:22,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:07:22,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:22,953 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 2=[|v_#valid_30|]} [2019-08-05 11:07:23,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:23,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:07:23,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:23,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:23,036 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:07:23,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:23,056 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:07:23,057 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:23,057 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:07:24,666 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:07:24,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:24,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:07:24,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:07:24,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:07:24,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:07:24,667 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 11:07:28,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:28,842 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:07:28,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:07:28,843 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 11:07:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:28,844 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:07:28,844 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:07:28,845 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:07:28,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:07:28,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 11:07:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:07:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:07:28,847 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 11:07:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:28,847 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:07:28,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:07:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:07:28,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:07:28,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:28,848 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 11:07:28,848 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:28,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 11:07:28,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:30,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 1966 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:07:30,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:30,198 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 2=[|v_#valid_31|]} [2019-08-05 11:07:30,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:30,249 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:07:30,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:30,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:30,333 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:07:30,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:07:30,357 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:07:30,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:30,358 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:07:32,435 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:07:32,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:32,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:07:32,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:07:32,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:07:32,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:07:32,437 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 11:07:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:37,731 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:07:37,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:07:37,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 11:07:37,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:37,733 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:07:37,733 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:07:37,734 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:07:37,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:07:37,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 11:07:37,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:07:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:07:37,738 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 11:07:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:37,738 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:07:37,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:07:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:07:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:07:37,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:37,739 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 11:07:37,739 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:37,739 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 11:07:37,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:39,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:39,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:07:39,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:40,143 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 5 [2019-08-05 11:07:40,144 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-08-05 11:07:40,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:07:40,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:40,272 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 11:07:40,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:40,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:07:40,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:17 [2019-08-05 11:07:40,494 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2019-08-05 11:07:42,238 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:07:42,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:42,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:07:42,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:07:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:07:42,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:07:42,239 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 11:07:46,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:46,513 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:07:46,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:07:46,513 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 11:07:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:46,514 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:07:46,515 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:07:46,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:07:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:07:46,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 11:07:46,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:07:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:07:46,519 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 11:07:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:46,519 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:07:46,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:07:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:07:46,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:07:46,520 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:46,520 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 11:07:46,520 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:46,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 11:07:46,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:07:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:07:49,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:07:49,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:07:49,748 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 2=[|v_#valid_32|]} [2019-08-05 11:07:49,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:07:49,767 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:07:49,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:49,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:07:49,782 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:07:49,782 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:07:49,806 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:07:49,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:07:49,806 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:12 [2019-08-05 11:07:51,311 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:07:51,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:07:51,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:07:51,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:07:51,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:07:51,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:07:51,313 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 11:07:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:07:55,771 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:07:55,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:07:55,772 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 11:07:55,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:07:55,773 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:07:55,773 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:07:55,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:07:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:07:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:07:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:07:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:07:55,778 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 11:07:55,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:07:55,779 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:07:55,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:07:55,779 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:07:55,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:07:55,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:07:55,780 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 11:07:55,780 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:07:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:07:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 11:07:55,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:00,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 2089 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 11:08:00,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:00,231 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 2=[|v_#valid_33|]} [2019-08-05 11:08:00,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:08:00,255 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:08:00,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:00,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:00,269 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:08:00,270 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:08:00,295 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:08:00,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:08:00,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:08:02,623 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:08:02,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:02,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:08:02,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:08:02,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:08:02,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:08:02,625 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 11:08:08,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:08,528 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:08:08,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:08:08,529 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 11:08:08,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:08,530 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:08:08,530 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:08:08,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:08:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:08:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 11:08:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:08:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:08:08,534 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 11:08:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:08,534 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:08:08,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:08:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:08:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:08:08,535 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:08,535 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 11:08:08,536 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 11:08:08,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:12,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 2130 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:08:12,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:12,894 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 2=[|v_#valid_34|]} [2019-08-05 11:08:12,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:08:12,916 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:08:12,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:12,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:12,947 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:08:12,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:12,965 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 11:08:12,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:08:12,965 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:08:15,437 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:08:15,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:15,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:08:15,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:08:15,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:08:15,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:08:15,438 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 11:08:21,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:08:21,531 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:08:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:08:21,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 11:08:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:08:21,532 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:08:21,532 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:08:21,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:08:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:08:21,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 11:08:21,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:08:21,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:08:21,537 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 11:08:21,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:08:21,537 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:08:21,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:08:21,537 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:08:21,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:08:21,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:08:21,538 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 11:08:21,538 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:08:21,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:08:21,539 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 11:08:21,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:08:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:08:23,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 2171 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:08:23,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:08:24,015 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_58|], 2=[|v_#valid_35|]} [2019-08-05 11:08:24,062 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:08:24,063 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:08:24,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:08:24,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:08:24,107 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:08:24,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:08:24,148 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:08:24,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:08:24,149 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:21 [2019-08-05 11:08:24,547 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:08:27,216 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:08:27,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:08:27,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:08:27,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:08:27,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:08:27,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:08:27,217 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. Received shutdown request... [2019-08-05 11:08:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:08:30,444 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:08:30,448 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:08:30,448 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:08:30 BoogieIcfgContainer [2019-08-05 11:08:30,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:08:30,449 INFO L168 Benchmark]: Toolchain (without parser) took 241441.59 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 109.1 MB in the beginning and 200.8 MB in the end (delta: -91.7 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-08-05 11:08:30,450 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:08:30,450 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 141.0 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:30,450 INFO L168 Benchmark]: Boogie Preprocessor took 33.25 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:30,451 INFO L168 Benchmark]: RCFGBuilder took 441.77 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 93.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:08:30,452 INFO L168 Benchmark]: TraceAbstraction took 240922.13 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.6 MB in the beginning and 200.8 MB in the end (delta: -107.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-08-05 11:08:30,453 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.25 ms. Allocated memory is still 141.0 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.56 ms. Allocated memory is still 141.0 MB. Free memory was 108.9 MB in the beginning and 107.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.25 ms. Allocated memory is still 141.0 MB. Free memory was 107.1 MB in the beginning and 106.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 441.77 ms. Allocated memory is still 141.0 MB. Free memory was 106.0 MB in the beginning and 93.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240922.13 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 93.6 MB in the beginning and 200.8 MB in the end (delta: -107.2 MB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 108). Cancelled while BasicCegarLoop was constructing difference of abstraction (109states) and FLOYD_HOARE automaton (currently 37 states, 57 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 91 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 240.8s OverallTime, 53 OverallIterations, 53 TraceHistogramMax, 126.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 159 SDtfs, 53 SDslu, 350 SDs, 0 SdLazy, 3883 SolverSat, 5481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4377 GetRequests, 1378 SyntacticMatches, 2 SemanticMatches, 2996 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29474 ImplicationChecksByTransitivity, 164.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 52 MinimizatonAttempts, 52 StatesRemovedByMinimization, 52 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 45.6s SatisfiabilityAnalysisTime, 68.0s InterpolantComputationTime, 2968 NumberOfCodeBlocks, 2968 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2915 ConstructedInterpolants, 602 QuantifiedInterpolants, 3793733 SizeOfPredicates, 716 NumberOfNonLiveVariables, 58565 ConjunctsInSsa, 2518 ConjunctsInUnsatCore, 53 InterpolantComputations, 1 PerfectInterpolantSequences, 0/49608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown