java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_false-valid-deref.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:56:56,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:56:56,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:56:56,853 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:56:56,854 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:56:56,855 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:56:56,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:56:56,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:56:56,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:56:56,863 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:56:56,864 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:56:56,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:56:56,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:56:56,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:56:56,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:56:56,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:56:56,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:56:56,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:56:56,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:56:56,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:56:56,886 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:56:56,887 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:56:56,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:56:56,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:56:56,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:56:56,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:56:56,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:56:56,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:56:56,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:56:56,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:56:56,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:56:56,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:56:56,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:56:56,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:56:56,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:56:56,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:56:56,909 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:56:56,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:56:56,910 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:56:56,911 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:56:56,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:56:56,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:56:56,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:56:56,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:56:56,997 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:56:56,997 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:56:56,998 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_false-valid-deref.i_5.bpl [2019-08-05 10:56:56,999 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/960521-1_false-valid-deref.i_5.bpl' [2019-08-05 10:56:57,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:56:57,062 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:56:57,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:56:57,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:56:57,063 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:56:57,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,107 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:56:57,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:56:57,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:56:57,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:56:57,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,122 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... [2019-08-05 10:56:57,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:56:57,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:56:57,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:56:57,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:56:57,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:56:57,220 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:56:57,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:56:57,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:56:57,459 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:56:57,459 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:56:57,460 INFO L202 PluginConnector]: Adding new model 960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:56:57 BoogieIcfgContainer [2019-08-05 10:56:57,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:56:57,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:56:57,463 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:56:57,466 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:56:57,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:56:57" (1/2) ... [2019-08-05 10:56:57,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519e606c and model type 960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:56:57, skipping insertion in model container [2019-08-05 10:56:57,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:56:57" (2/2) ... [2019-08-05 10:56:57,469 INFO L109 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-deref.i_5.bpl [2019-08-05 10:56:57,478 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:56:57,486 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:56:57,503 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:56:57,529 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:56:57,530 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:56:57,531 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:56:57,531 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:56:57,531 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:56:57,531 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:56:57,531 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:56:57,532 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:56:57,532 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:56:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:56:57,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:56:57,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:57,558 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:56:57,560 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 10:56:57,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:57,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:56:57,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:57,778 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_6|], 2=[|v_#valid_7|]} [2019-08-05 10:56:57,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:57,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:56:57,856 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:58,000 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:56:58,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:58,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:56:58,052 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:56:58,151 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:56:58,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:58,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:56:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:58,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:56:58,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:56:58,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:56:58,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:56:58,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:56:58,315 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:56:58,573 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:56:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:58,710 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:56:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:56:58,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:56:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:58,724 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:56:58,724 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:56:58,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:56:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:56:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:56:58,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:56:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:56:58,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:56:58,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:58,759 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:56:58,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:56:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:56:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:56:58,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:58,760 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:56:58,761 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:58,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 10:56:58,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:58,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:56:58,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:58,861 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_7|], 2=[|v_#valid_8|]} [2019-08-05 10:56:58,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:58,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:56:58,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:58,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:59,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:56:59,004 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:56:59,292 WARN L188 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:56:59,293 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:56:59,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:59,296 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:56:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:59,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:59,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:56:59,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:56:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:56:59,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:56:59,438 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:56:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:59,585 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:56:59,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:56:59,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:56:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:59,586 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:56:59,587 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:56:59,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:56:59,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:56:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:56:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:56:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:56:59,590 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:56:59,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:59,590 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:56:59,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:56:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:56:59,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:56:59,591 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:59,592 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:56:59,592 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 10:56:59,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:59,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:56:59,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:59,668 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_8|], 2=[|v_#valid_9|]} [2019-08-05 10:56:59,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:56:59,689 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:56:59,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:59,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:59,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:56:59,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:59,900 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-08-05 10:56:59,900 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:56:59,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:56:59,902 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:00,287 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:57:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:00,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:00,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:57:00,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:57:00,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:57:00,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:57:00,387 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 10:57:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:00,640 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:57:00,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:57:00,641 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:57:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:00,642 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:57:00,642 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:57:00,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:57:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:57:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:57:00,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:57:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:57:00,646 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:57:00,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:00,646 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:57:00,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:57:00,646 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:57:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:57:00,647 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:00,647 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:57:00,647 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 10:57:00,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:00,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:57:00,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:00,739 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_9|], 2=[|v_#valid_10|]} [2019-08-05 10:57:00,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:00,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:00,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:00,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:00,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 10:57:00,810 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:00,838 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:57:00,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:00,850 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:01,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:01,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:57:01,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:57:01,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:57:01,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:57:01,116 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 10:57:01,353 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 10:57:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:01,549 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:57:01,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:57:01,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:57:01,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:01,551 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:57:01,551 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:57:01,552 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:57:01,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:57:01,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:57:01,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:57:01,556 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:57:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:01,556 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:57:01,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:57:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:57:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:57:01,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:01,557 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:57:01,558 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 10:57:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:01,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:57:01,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:01,643 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_10|], 2=[|v_#valid_11|]} [2019-08-05 10:57:01,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:01,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:01,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:01,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:01,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:01,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:01,751 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:01,754 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:01,754 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:02,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:02,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:02,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:57:02,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:57:02,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:57:02,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:57:02,045 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 10:57:02,394 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-08-05 10:57:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:02,629 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:57:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:57:02,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:57:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:02,630 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:57:02,630 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:57:02,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:57:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:57:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:57:02,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:57:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:57:02,634 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:57:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:02,634 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:57:02,634 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:57:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:57:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:57:02,635 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:02,635 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:57:02,636 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:02,636 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 10:57:02,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:02,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:57:02,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:02,715 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 2=[|v_#valid_12|]} [2019-08-05 10:57:02,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:02,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:02,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:02,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:02,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:02,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:02,819 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 10:57:02,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:02,821 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:03,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:03,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:57:03,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:57:03,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:57:03,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:57:03,210 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 10:57:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:03,700 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:57:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:57:03,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 10:57:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:03,702 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:57:03,702 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:57:03,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:57:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:57:03,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:57:03,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:57:03,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:57:03,707 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:57:03,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:03,707 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:57:03,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:57:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:57:03,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:57:03,708 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:03,708 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:57:03,708 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 10:57:03,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:03,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:57:03,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:03,785 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_12|], 2=[|v_#valid_13|]} [2019-08-05 10:57:03,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:03,846 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:03,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:03,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:03,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:03,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:03,904 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:57:03,905 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:03,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:04,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:04,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:57:04,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:57:04,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:57:04,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:57:04,173 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 10:57:04,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:04,706 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:57:04,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:57:04,708 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 10:57:04,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:04,709 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:57:04,709 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:57:04,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:57:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:57:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:57:04,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:57:04,712 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:57:04,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:04,713 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:57:04,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:57:04,713 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:57:04,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:57:04,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:04,714 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:57:04,714 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:04,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:04,714 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 10:57:04,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:04,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:57:04,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:04,797 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_13|], 2=[|v_#valid_14|]} [2019-08-05 10:57:04,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:04,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:04,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:04,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:04,927 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:04,953 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:57:04,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:04,955 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:05,196 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:05,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:05,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:57:05,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:57:05,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:57:05,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:57:05,198 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 10:57:05,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:05,734 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:57:05,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:57:05,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 10:57:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:05,736 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:57:05,736 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:57:05,737 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:57:05,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:57:05,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:57:05,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:57:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:57:05,739 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:57:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:05,740 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:57:05,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:57:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:57:05,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:57:05,740 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:05,740 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:57:05,741 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 10:57:05,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:05,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:57:05,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:05,807 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_14|], 2=[|v_#valid_15|]} [2019-08-05 10:57:05,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:05,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:05,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:05,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:05,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:05,886 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:05,910 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 10:57:05,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:05,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:06,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:06,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:57:06,213 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:57:06,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:57:06,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:57:06,214 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 10:57:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:06,914 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:57:06,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:57:06,916 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 10:57:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:06,916 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:57:06,917 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:57:06,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:57:06,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:57:06,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:57:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:57:06,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:57:06,921 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:57:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:06,921 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:57:06,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:57:06,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:57:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:57:06,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:06,922 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:57:06,923 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:06,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:06,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 10:57:06,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:06,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:57:06,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:07,006 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_15|], 2=[|v_#valid_16|]} [2019-08-05 10:57:07,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:07,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 11 treesize of output 13 [2019-08-05 10:57:07,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:07,207 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:07,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:07,215 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:07,216 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:07,249 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:57:07,250 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:07,251 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:07,623 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:07,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:07,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:57:07,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:57:07,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:57:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:57:07,625 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 10:57:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:08,311 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:57:08,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:57:08,312 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 10:57:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:08,313 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:57:08,313 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:57:08,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:57:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:57:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:57:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:57:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:57:08,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:57:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:08,318 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:57:08,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:57:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:57:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:57:08,318 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:08,318 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:57:08,319 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:08,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 10:57:08,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:08,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:57:08,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:08,393 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_16|], 2=[|v_#valid_17|]} [2019-08-05 10:57:08,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:08,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:08,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:08,573 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:57:08,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:08,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 10:57:08,640 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:08,938 WARN L188 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 10:57:08,938 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:57:08,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:08,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:09,096 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:57:09,259 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:57:09,595 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:57:09,848 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:57:10,253 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:57:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:10,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:10,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:57:10,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:57:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:57:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:57:10,512 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 10:57:11,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:11,386 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:57:11,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:57:11,386 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 10:57:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:11,387 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:57:11,388 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:57:11,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:57:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:57:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:57:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:57:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:57:11,392 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:57:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:11,392 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:57:11,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:57:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:57:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:57:11,393 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:11,393 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:57:11,393 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:11,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 10:57:11,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:11,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:57:11,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:11,463 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_17|], 2=[|v_#valid_18|]} [2019-08-05 10:57:11,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:11,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:11,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:11,615 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:11,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:11,621 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:11,652 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:11,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:11,653 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:11,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:11,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:57:11,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:57:11,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:57:11,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:57:11,954 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 10:57:12,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:12,831 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:57:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:57:12,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 10:57:12,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:12,835 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:57:12,835 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:57:12,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:57:12,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:57:12,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:57:12,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:57:12,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:57:12,839 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:57:12,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:12,839 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:57:12,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:57:12,839 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:57:12,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:57:12,840 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:12,840 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:57:12,840 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:12,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:12,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 10:57:12,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:12,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:57:12,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:12,909 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_18|], 2=[|v_#valid_19|]} [2019-08-05 10:57:12,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:12,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:12,930 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:12,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:12,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:12,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:13,029 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:13,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:13,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:13,347 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:13,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:13,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:57:13,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:57:13,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:57:13,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:57:13,348 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 10:57:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:14,197 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:57:14,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:57:14,198 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 10:57:14,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:14,199 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:57:14,199 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:57:14,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:57:14,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:57:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:57:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:57:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:57:14,205 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:57:14,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:14,205 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:57:14,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:57:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:57:14,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:57:14,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:14,206 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:57:14,206 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:14,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 10:57:14,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:14,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:57:14,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:14,286 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_19|], 2=[|v_#valid_20|]} [2019-08-05 10:57:14,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:14,308 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:14,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:14,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:14,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:14,340 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:14,388 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:57:14,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:14,389 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:14,724 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:14,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:14,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:57:14,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:57:14,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:57:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:57:14,725 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 10:57:15,557 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 10:57:15,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:15,880 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:57:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:57:15,881 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 10:57:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:15,882 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:57:15,882 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:57:15,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:57:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:57:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:57:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:57:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:57:15,886 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:57:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:15,887 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:57:15,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:57:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:57:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:57:15,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:15,888 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:57:15,888 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:15,888 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 10:57:15,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:15,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:57:15,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:15,971 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_20|], 2=[|v_#valid_21|]} [2019-08-05 10:57:16,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:16,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:16,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:16,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:16,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:16,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:16,098 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:16,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:16,100 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:16,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:16,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:57:16,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:57:16,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:57:16,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:57:16,640 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 10:57:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:17,700 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:57:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:57:17,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 10:57:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:17,701 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:57:17,701 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:57:17,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:57:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:57:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:57:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:57:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:57:17,705 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:57:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:17,705 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:57:17,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:57:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:57:17,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:57:17,706 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:17,706 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:57:17,706 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:17,706 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 10:57:17,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:17,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:17,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:57:17,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:17,791 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_21|], 2=[|v_#valid_22|]} [2019-08-05 10:57:17,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:17,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:17,842 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:17,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:17,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:17,933 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:17,976 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:17,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:17,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:18,426 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:18,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:18,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:57:18,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:57:18,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:57:18,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:57:18,428 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 10:57:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:19,620 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:57:19,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:57:19,623 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 10:57:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:19,623 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:57:19,623 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:57:19,624 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:57:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:57:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:57:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:57:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:57:19,627 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:57:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:19,627 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:57:19,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:57:19,628 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:57:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:57:19,628 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:19,628 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:57:19,629 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:19,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:19,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 10:57:19,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:19,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:57:19,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:19,711 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_22|], 2=[|v_#valid_23|]} [2019-08-05 10:57:19,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:19,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:19,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:19,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:19,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:19,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:19,834 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:19,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:19,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:20,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:20,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:57:20,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:57:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:57:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:57:20,268 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 10:57:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:21,368 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:57:21,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:57:21,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 10:57:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:21,370 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:57:21,370 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:57:21,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:57:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:57:21,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:57:21,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:57:21,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:57:21,375 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:57:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:21,375 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:57:21,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:57:21,376 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:57:21,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:57:21,376 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:21,376 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:57:21,377 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:21,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:21,377 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 10:57:21,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:21,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:57:21,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:21,558 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_23|], 2=[|v_#valid_24|]} [2019-08-05 10:57:21,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:21,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:21,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:21,753 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:57:21,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:21,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 10:57:21,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:21,798 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:57:21,799 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:21,799 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:22,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:22,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:57:22,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:57:22,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:57:22,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:57:22,421 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2019-08-05 10:57:23,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:23,854 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:57:23,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:57:23,855 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 10:57:23,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:23,856 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:57:23,856 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:57:23,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:57:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:57:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:57:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:57:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:57:23,861 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:57:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:23,861 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:57:23,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:57:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:57:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:57:23,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:23,863 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:57:23,863 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 10:57:23,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:23,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:57:23,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:23,959 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_24|], 2=[|v_#valid_25|]} [2019-08-05 10:57:23,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:23,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:23,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:24,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:24,034 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:24,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:24,055 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:57:24,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:24,056 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:24,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:24,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:57:24,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:57:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:57:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:57:24,601 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 10:57:25,706 WARN L188 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 30 [2019-08-05 10:57:26,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:26,541 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:57:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:57:26,542 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 10:57:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:26,543 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:57:26,543 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:57:26,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:57:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:57:26,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:57:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:57:26,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:57:26,548 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:57:26,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:26,548 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:57:26,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:57:26,548 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:57:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:57:26,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:26,549 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:57:26,549 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:26,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 10:57:26,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:26,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:57:26,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:26,638 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_25|], 2=[|v_#valid_26|]} [2019-08-05 10:57:26,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:26,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:57:26,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:26,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:26,726 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:26,727 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:26,747 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 10:57:26,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:26,748 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:57:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:27,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:27,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:57:27,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:57:27,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:57:27,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:57:27,404 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 10:57:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:29,402 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:57:29,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:57:29,403 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 10:57:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:29,403 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:57:29,403 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:57:29,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:57:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:57:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:57:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:57:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:57:29,409 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:57:29,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:29,409 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:57:29,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:57:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:57:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:57:29,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:29,410 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:57:29,411 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:29,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:29,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 10:57:29,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:29,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:57:29,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:29,512 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_26|], 2=[|v_#valid_27|]} [2019-08-05 10:57:29,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:29,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:29,655 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:29,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:29,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 10:57:29,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:29,872 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2019-08-05 10:57:29,873 INFO L567 ElimStorePlain]: treesize reduction 12, result has 68.4 percent of original size [2019-08-05 10:57:29,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:29,874 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:31,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:31,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:31,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:57:31,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:57:31,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:57:31,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:57:31,010 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 10:57:32,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:32,515 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:57:32,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:57:32,516 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 10:57:32,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:32,516 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:57:32,516 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:57:32,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:57:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:57:32,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:57:32,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:57:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:57:32,521 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:57:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:32,521 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:57:32,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:57:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:57:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:57:32,522 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:32,522 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:57:32,522 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:32,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 10:57:32,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:32,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:57:32,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:32,620 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_27|], 2=[|v_#valid_28|]} [2019-08-05 10:57:32,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:32,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:32,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:32,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:32,682 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:32,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:32,708 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:57:32,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:32,709 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:33,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:33,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:57:33,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:57:33,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:57:33,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:57:33,632 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2019-08-05 10:57:35,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:35,202 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:57:35,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:57:35,205 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 10:57:35,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:35,206 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:57:35,206 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:57:35,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:57:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:57:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:57:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:57:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:57:35,210 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:57:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:35,210 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:57:35,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:57:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:57:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:57:35,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:35,211 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:57:35,211 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:35,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:35,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 10:57:35,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:35,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:57:35,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:35,305 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_28|], 2=[|v_#valid_29|]} [2019-08-05 10:57:35,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:35,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:35,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:35,530 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:35,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:35,600 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:35,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:35,906 WARN L188 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:57:35,907 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:35,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:35,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:36,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:36,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:57:36,572 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:57:36,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:57:36,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:57:36,573 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 10:57:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:38,329 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:57:38,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:57:38,329 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 10:57:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:38,330 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:57:38,330 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:57:38,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:57:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:57:38,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:57:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:57:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:57:38,335 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:57:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:38,335 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:57:38,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:57:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:57:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:57:38,336 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:38,336 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:57:38,337 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 10:57:38,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:38,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:57:38,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:38,437 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_29|], 2=[|v_#valid_30|]} [2019-08-05 10:57:38,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:38,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:38,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:38,662 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:38,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:38,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:38,734 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:39,216 WARN L188 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:57:39,217 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:39,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:39,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:39,495 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:57:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:40,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:40,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:57:40,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:57:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:57:40,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:57:40,175 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 10:57:41,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:41,950 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:57:41,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:57:41,950 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 10:57:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:41,951 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:57:41,951 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:57:41,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:57:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:57:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:57:41,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:57:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:57:41,956 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:57:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:41,956 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:57:41,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:57:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:57:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:57:41,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:41,957 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:57:41,957 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:41,957 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 10:57:41,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:42,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:57:42,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:42,060 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_30|], 2=[|v_#valid_31|]} [2019-08-05 10:57:42,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:42,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:42,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:42,281 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:42,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:42,359 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:42,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:42,651 WARN L188 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:57:42,651 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:42,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:42,652 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:43,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:43,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:57:43,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:57:43,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:57:43,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:57:43,777 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 10:57:45,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:45,713 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:57:45,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:57:45,713 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 10:57:45,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:45,714 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:57:45,714 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:57:45,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:57:45,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:57:45,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:57:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:57:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:57:45,719 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:57:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:45,719 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:57:45,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:57:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:57:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:57:45,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:45,720 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:57:45,720 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:45,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 10:57:45,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:45,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:57:45,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:45,844 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_31|], 2=[|v_#valid_32|]} [2019-08-05 10:57:45,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:45,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:45,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:46,069 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:46,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:46,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:46,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:46,181 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:46,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:46,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:48,609 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-08-05 10:57:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:48,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:57:48,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:57:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:57:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:57:48,820 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 10:57:50,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:50,753 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:57:50,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:57:50,754 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 10:57:50,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:50,755 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:57:50,755 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:57:50,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:57:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:57:50,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:57:50,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:57:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:57:50,759 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:57:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:50,759 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:57:50,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:57:50,759 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:57:50,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:57:50,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:50,760 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:57:50,760 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:50,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 10:57:50,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:50,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:57:50,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:50,897 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_32|], 2=[|v_#valid_33|]} [2019-08-05 10:57:50,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:50,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:50,943 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:51,102 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:51,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:51,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:51,176 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:51,597 WARN L188 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:57:51,597 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:51,597 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:51,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:52,290 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:52,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:52,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:57:52,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:57:52,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:57:52,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:57:52,292 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 10:57:54,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:54,496 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:57:54,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:57:54,497 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 10:57:54,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:54,498 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:57:54,498 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:57:54,499 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 10:57:54,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:57:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 10:57:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:57:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:57:54,502 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:57:54,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:54,502 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:57:54,502 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:57:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:57:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:57:54,503 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:54,503 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:57:54,504 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:54,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 10:57:54,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:54,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:57:54,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:54,621 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_33|], 2=[|v_#valid_34|]} [2019-08-05 10:57:54,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:54,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:54,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:54,835 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:57:54,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:54,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:57:54,853 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:54,876 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:57:54,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:54,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:55,633 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 10:57:55,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:55,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:57:55,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:57:55,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:57:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:57:55,634 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 10:57:57,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:57,826 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:57:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:57:57,827 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 10:57:57,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:57,828 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:57:57,828 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:57:57,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:57:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:57:57,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:57:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:57:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:57:57,833 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:57:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:57,833 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:57:57,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:57:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:57:57,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:57:57,834 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:57,834 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:57:57,834 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:57,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 10:57:57,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:57,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:57:57,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:57,948 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_34|], 2=[|v_#valid_35|]} [2019-08-05 10:57:58,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:57:58,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:57:58,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:58,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:58,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:57:58,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:57:58,106 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:57:58,107 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:57:58,107 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:57:59,237 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 10:57:59,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:59,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:57:59,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:57:59,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:57:59,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:57:59,239 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 10:58:00,766 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2019-08-05 10:58:01,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:01,572 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:58:01,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:58:01,572 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 10:58:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:01,573 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:58:01,573 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:58:01,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:58:01,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:58:01,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 10:58:01,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:58:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:58:01,578 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:58:01,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:01,578 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:58:01,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:58:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:58:01,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:58:01,578 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:01,579 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:58:01,579 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:01,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:01,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 10:58:01,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:01,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:58:01,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:01,695 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_35|], 2=[|v_#valid_36|]} [2019-08-05 10:58:01,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:01,733 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:58:01,734 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:01,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:01,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:58:01,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:01,839 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 10:58:01,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:01,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:58:02,814 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 10:58:02,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:02,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:58:02,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:58:02,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:58:02,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:58:02,815 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 10:58:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:05,435 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:58:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:58:05,436 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 10:58:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:05,437 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:58:05,437 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:58:05,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:58:05,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:58:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:58:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:58:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:58:05,441 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:58:05,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:05,441 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:58:05,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:58:05,441 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:58:05,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:58:05,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:05,442 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:58:05,442 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:05,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:05,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 10:58:05,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:05,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:05,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:58:05,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:05,552 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_36|], 2=[|v_#valid_37|]} [2019-08-05 10:58:05,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:05,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:05,603 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:05,778 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:58:05,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:05,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:58:05,858 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:06,329 WARN L188 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-08-05 10:58:06,329 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:58:06,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:06,330 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:06,594 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:58:07,491 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 10:58:07,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:07,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:58:07,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:58:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:58:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:58:07,493 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 10:58:10,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:10,174 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:58:10,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:58:10,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 10:58:10,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:10,175 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:58:10,175 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:58:10,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:58:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:58:10,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 10:58:10,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:58:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:58:10,179 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:58:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:10,179 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:58:10,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:58:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:58:10,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:58:10,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:10,180 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:58:10,180 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:10,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 10:58:10,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:10,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:58:10,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:10,315 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_37|], 2=[|v_#valid_38|]} [2019-08-05 10:58:10,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:10,362 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:10,362 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:10,397 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:58:10,397 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:10,420 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:58:10,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:10,421 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:11,761 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 10:58:11,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:11,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:58:11,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:58:11,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:58:11,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:58:11,762 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 10:58:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:14,527 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:58:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:58:14,527 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 10:58:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:14,528 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:58:14,528 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:58:14,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:58:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:58:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:58:14,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:58:14,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:58:14,532 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:58:14,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:14,533 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:58:14,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:58:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:58:14,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:58:14,533 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:14,533 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:58:14,534 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:14,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:14,534 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 10:58:14,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:14,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:58:14,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:14,694 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_38|], 2=[|v_#valid_39|]} [2019-08-05 10:58:14,729 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:14,730 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:14,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,759 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:14,765 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:58:14,766 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:14,791 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:58:14,792 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:14,792 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:15,750 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 10:58:15,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:15,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:58:15,751 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:58:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:58:15,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:58:15,752 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 10:58:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:18,486 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:58:18,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:58:18,486 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 10:58:18,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:18,487 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:58:18,487 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:58:18,489 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:58:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:58:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:58:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:58:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:58:18,491 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:58:18,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:18,492 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:58:18,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:58:18,492 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:58:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:58:18,492 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:18,492 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:58:18,493 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 10:58:18,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:18,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:58:18,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:18,623 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_39|], 2=[|v_#valid_40|]} [2019-08-05 10:58:18,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:18,665 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:58:18,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:18,808 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 10:58:18,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:18,875 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 10:58:18,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:19,221 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2019-08-05 10:58:19,222 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:58:19,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:19,223 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:58:19,368 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:58:20,690 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 10:58:20,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:20,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:58:20,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:58:20,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:58:20,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:58:20,692 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 10:58:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:23,708 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:58:23,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:58:23,709 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 10:58:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:23,710 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:58:23,710 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:58:23,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:58:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:58:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:58:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:58:23,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:58:23,713 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:58:23,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:23,714 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:58:23,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:58:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:58:23,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:58:23,714 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:23,715 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:58:23,715 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:23,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:23,715 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 10:58:23,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:23,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:23,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:58:23,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:23,851 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_40|], 2=[|v_#valid_41|]} [2019-08-05 10:58:23,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:23,900 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:58:23,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:23,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:23,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 10:58:23,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:24,011 INFO L567 ElimStorePlain]: treesize reduction 12, result has 63.6 percent of original size [2019-08-05 10:58:24,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:24,011 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:58:25,472 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 10:58:25,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:25,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:58:25,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:58:25,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:58:25,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:58:25,474 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 10:58:28,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:28,640 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:58:28,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:58:28,640 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 10:58:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:28,641 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:58:28,641 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:58:28,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:58:28,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:58:28,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:58:28,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:58:28,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:58:28,645 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:58:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:28,645 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:58:28,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:58:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:58:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:58:28,646 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:28,646 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:58:28,646 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:28,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:28,647 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 10:58:28,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:28,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:28,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:58:28,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:28,781 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_41|], 2=[|v_#valid_42|]} [2019-08-05 10:58:28,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:28,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:28,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:28,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:28,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:58:28,863 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:28,887 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:58:28,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:28,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:30,289 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 10:58:30,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:30,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:58:30,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:58:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:58:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:58:30,290 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 10:58:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:33,391 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:58:33,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:58:33,392 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 10:58:33,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:33,393 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:58:33,393 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:58:33,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:58:33,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:58:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:58:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:58:33,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:58:33,396 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:58:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:33,396 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:58:33,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:58:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:58:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:58:33,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:33,397 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:58:33,397 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 10:58:33,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:33,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:58:33,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:33,547 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_42|], 2=[|v_#valid_43|]} [2019-08-05 10:58:33,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:33,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:33,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:33,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:33,605 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:58:33,606 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:33,631 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:58:33,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:33,632 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:35,059 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 10:58:35,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:35,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:58:35,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:58:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:58:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:58:35,060 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 10:58:38,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:38,307 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:58:38,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:58:38,307 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 10:58:38,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:38,309 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:58:38,309 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:58:38,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:58:38,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:58:38,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:58:38,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:58:38,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:58:38,313 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:58:38,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:38,313 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:58:38,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:58:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:58:38,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:58:38,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:38,314 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:58:38,314 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 10:58:38,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:38,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:58:38,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:38,478 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_43|], 2=[|v_#valid_44|]} [2019-08-05 10:58:38,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:38,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:38,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:38,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:38,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:58:38,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:38,595 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:58:38,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:38,596 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:40,069 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 10:58:40,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:40,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:58:40,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:58:40,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:58:40,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:58:40,071 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 10:58:43,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:43,451 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:58:43,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:58:43,452 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 10:58:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:43,453 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:58:43,453 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:58:43,454 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:58:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:58:43,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:58:43,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:58:43,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:58:43,457 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:58:43,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:43,457 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:58:43,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:58:43,458 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:58:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:58:43,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:43,458 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:58:43,459 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:43,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:43,459 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 10:58:43,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:43,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:58:43,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:43,611 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_44|], 2=[|v_#valid_45|]} [2019-08-05 10:58:43,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:43,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:43,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:43,810 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:58:43,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:43,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:58:43,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:44,277 WARN L188 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-08-05 10:58:44,278 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:58:44,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:44,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:45,869 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 10:58:45,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:45,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:58:45,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:58:45,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:58:45,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:58:45,870 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 10:58:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:49,459 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:58:49,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:58:49,459 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 10:58:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:49,460 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:58:49,460 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:58:49,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:58:49,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:58:49,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:58:49,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:58:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:58:49,462 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:58:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:49,463 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:58:49,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:58:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:58:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:58:49,463 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:49,463 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:58:49,464 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:49,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 10:58:49,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:49,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:58:49,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:49,577 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_45|], 2=[|v_#valid_46|]} [2019-08-05 10:58:49,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:49,593 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:49,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:49,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:49,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:58:49,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:49,714 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:58:49,715 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:49,716 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:51,135 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 10:58:51,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:51,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:58:51,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:58:51,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:58:51,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:58:51,136 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 10:58:54,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:54,840 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:58:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:58:54,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 10:58:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:54,841 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:58:54,841 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:58:54,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:58:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:58:54,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:58:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:58:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:58:54,845 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:58:54,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:54,845 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:58:54,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:58:54,846 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:58:54,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:58:54,846 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:54,846 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:58:54,846 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:54,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:54,847 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 10:58:54,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:54,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:58:54,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:54,973 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_46|], 2=[|v_#valid_47|]} [2019-08-05 10:58:54,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:58:54,992 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:58:54,992 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:55,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:55,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:58:55,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:58:55,086 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:58:55,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:58:55,087 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:58:56,452 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 10:58:56,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:56,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:58:56,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:58:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:58:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:58:56,453 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 10:59:00,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:00,437 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:59:00,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:59:00,438 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 10:59:00,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:00,439 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:59:00,439 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:59:00,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:59:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:59:00,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:59:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:59:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:59:00,443 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:59:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:00,443 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:59:00,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:59:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:59:00,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:59:00,444 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:00,444 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:59:00,444 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:00,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:00,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 10:59:00,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:00,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:59:00,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:00,579 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_47|], 2=[|v_#valid_48|]} [2019-08-05 10:59:00,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:00,601 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:00,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:00,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:00,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:59:00,622 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:00,648 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:00,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:00,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:02,306 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 10:59:02,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:02,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:59:02,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:59:02,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:59:02,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:59:02,307 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 10:59:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:06,380 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:59:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:59:06,380 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 10:59:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:06,381 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:59:06,381 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:59:06,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:59:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:59:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:59:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:59:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:59:06,385 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:59:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:06,385 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:59:06,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:59:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:59:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:59:06,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:06,385 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:59:06,386 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 10:59:06,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:06,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:59:06,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:06,538 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_48|], 2=[|v_#valid_49|]} [2019-08-05 10:59:06,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:06,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 10:59:06,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:06,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:06,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:59:06,588 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:06,613 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 10:59:06,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:06,614 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 10:59:08,500 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 10:59:08,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:08,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:59:08,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:59:08,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:59:08,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:59:08,501 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 10:59:13,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:13,153 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:59:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:59:13,155 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 10:59:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:13,156 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:59:13,156 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:59:13,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:59:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:59:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 10:59:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:59:13,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:59:13,159 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:59:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:13,159 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:59:13,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:59:13,159 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:59:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:59:13,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:13,160 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:59:13,160 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 10:59:13,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:13,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:59:13,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:13,314 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_49|], 2=[|v_#valid_50|]} [2019-08-05 10:59:13,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:13,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:13,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:13,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:13,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:59:13,361 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:13,386 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:13,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:13,387 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:14,935 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 10:59:14,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:14,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:59:14,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:59:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:59:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:59:14,937 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 10:59:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:19,210 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:59:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:59:19,210 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 10:59:19,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:19,212 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:59:19,212 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:59:19,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:59:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:59:19,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:59:19,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:59:19,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:59:19,215 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:59:19,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:19,215 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:59:19,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:59:19,216 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:59:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:59:19,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:19,216 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:59:19,217 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:19,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:19,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 10:59:19,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:19,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 903 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:59:19,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:19,360 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_50|], 2=[|v_#valid_51|]} [2019-08-05 10:59:19,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:19,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:19,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:19,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:19,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:59:19,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:19,436 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:19,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:19,437 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:21,531 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 10:59:21,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:21,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:59:21,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:59:21,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:59:21,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:59:21,532 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 10:59:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:25,978 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:59:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:59:25,978 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 10:59:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:25,980 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:59:25,980 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:59:25,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:59:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:59:25,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 10:59:25,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:59:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:59:25,983 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:59:25,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:25,983 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:59:25,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:59:25,984 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:59:25,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:59:25,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:25,984 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:59:25,984 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:25,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:25,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 10:59:25,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:26,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:59:26,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:26,127 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_51|], 2=[|v_#valid_52|]} [2019-08-05 10:59:26,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:26,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:26,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:26,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:26,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 10:59:26,182 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:26,205 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:26,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:26,206 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:28,238 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 10:59:28,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:28,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:59:28,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:59:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:59:28,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:59:28,240 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 10:59:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:32,845 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:59:32,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:59:32,845 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 10:59:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:32,847 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:59:32,847 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:59:32,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:59:32,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:59:32,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:59:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:59:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:59:32,850 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:59:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:32,850 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:59:32,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:59:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:59:32,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:59:32,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:32,851 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:59:32,851 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:32,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:32,851 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 10:59:32,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:33,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:33,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:59:33,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:33,113 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_52|], 2=[|v_#valid_53|]} [2019-08-05 10:59:33,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:33,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:33,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:33,280 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-08-05 10:59:33,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:33,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:59:33,287 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:33,319 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:33,319 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:33,320 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:35,017 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 10:59:35,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:35,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:59:35,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:59:35,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:59:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:59:35,018 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 10:59:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:39,754 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:59:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:59:39,755 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 10:59:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:39,756 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:59:39,756 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:59:39,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:59:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:59:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 10:59:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:59:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:59:39,759 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:59:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:39,759 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:59:39,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:59:39,759 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:59:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:59:39,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:39,760 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:59:39,760 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:39,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:39,760 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 10:59:39,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:39,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:59:39,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:39,904 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_53|], 2=[|v_#valid_54|]} [2019-08-05 10:59:39,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:39,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:39,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:39,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:39,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 38 treesize of output 34 [2019-08-05 10:59:39,947 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:39,973 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 10:59:39,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:39,974 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:42,005 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 10:59:42,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:42,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:59:42,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:59:42,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:59:42,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:59:42,007 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 10:59:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:46,925 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:59:46,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:59:46,926 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 10:59:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:46,927 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:59:46,927 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:59:46,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:59:46,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:59:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:59:46,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:59:46,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:59:46,930 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:59:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:46,930 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:59:46,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:59:46,931 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:59:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:59:46,931 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:46,931 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:59:46,931 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:46,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:46,932 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 10:59:46,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:47,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 979 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:59:47,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:47,099 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_54|], 2=[|v_#valid_55|]} [2019-08-05 10:59:47,109 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:47,109 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:47,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:47,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:47,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:59:47,143 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:47,173 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:47,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:47,174 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:49,698 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 10:59:49,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:49,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:59:49,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:59:49,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:59:49,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:59:49,699 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 10:59:54,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:54,789 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:59:54,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:59:54,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 10:59:54,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:54,791 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:59:54,791 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:59:54,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:59:54,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:59:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 10:59:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:59:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:59:54,794 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:59:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:54,795 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:59:54,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:59:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:59:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:59:54,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:54,796 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:59:54,796 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 10:59:54,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:54,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:59:54,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:54,953 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_55|], 2=[|v_#valid_56|]} [2019-08-05 10:59:54,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 10:59:54,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 10:59:54,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:54,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:55,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 10:59:55,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 10:59:55,032 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-08-05 10:59:55,032 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 10:59:55,033 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 10:59:57,226 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 10:59:57,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:57,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:59:57,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:59:57,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:59:57,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:59:57,227 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 11:00:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:02,730 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:00:02,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:00:02,731 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 11:00:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:02,732 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:00:02,732 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:00:02,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:00:02,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:00:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:00:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:00:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:00:02,737 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 11:00:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:02,737 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:00:02,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:00:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:00:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:00:02,738 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:02,738 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 11:00:02,738 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:02,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 11:00:02,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:02,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:00:02,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:02,918 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_56|], 2=[|v_#valid_57|]} [2019-08-05 11:00:02,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:02,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:02,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:02,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:02,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 23 treesize of output 21 [2019-08-05 11:00:02,965 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:02,990 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:02,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:02,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:05,556 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:00:05,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:05,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:00:05,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:00:05,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:00:05,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:00:05,558 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 11:00:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:11,228 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:00:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:00:11,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 11:00:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:11,230 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:00:11,230 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:00:11,231 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:00:11,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:00:11,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 11:00:11,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:00:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:00:11,233 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 11:00:11,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:11,234 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:00:11,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:00:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:00:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:00:11,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:11,235 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 11:00:11,235 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 11:00:11,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:11,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:00:11,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:11,418 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_57|], 2=[|v_#valid_58|]} [2019-08-05 11:00:11,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:11,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:11,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:11,508 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:11,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:00:11,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:11,533 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:00:11,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:11,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:14,491 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:00:14,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:14,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:00:14,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:00:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:00:14,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:00:14,493 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 11:00:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:20,262 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:00:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:00:20,262 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 11:00:20,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:20,263 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:00:20,264 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:00:20,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:00:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:00:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 11:00:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:00:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:00:20,268 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 11:00:20,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:20,269 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:00:20,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:00:20,269 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:00:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:00:20,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:20,270 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 11:00:20,270 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:20,270 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 11:00:20,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:20,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:00:20,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:20,566 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_58|], 2=[|v_#valid_59|]} [2019-08-05 11:00:20,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:20,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:00:20,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:20,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:00:20,688 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:20,713 INFO L567 ElimStorePlain]: treesize reduction 13, result has 66.7 percent of original size [2019-08-05 11:00:20,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:20,714 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:00:22,816 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:00:22,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:22,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:00:22,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:00:22,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:00:22,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:00:22,817 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2019-08-05 11:00:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:28,570 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:00:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:00:28,571 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2019-08-05 11:00:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:28,572 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:00:28,572 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:00:28,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:00:28,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:00:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 11:00:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:00:28,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:00:28,576 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 11:00:28,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:28,577 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:00:28,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:00:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:00:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:00:28,577 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:28,577 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 11:00:28,577 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:28,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:28,578 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 11:00:28,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:28,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1074 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 11:00:28,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:28,779 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_59|], 2=[|v_#valid_60|]} [2019-08-05 11:00:28,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:28,803 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:28,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:28,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:28,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:00:28,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:28,858 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:28,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:28,859 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:31,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:31,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:00:31,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:00:31,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:00:31,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:00:31,605 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2019-08-05 11:00:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:37,776 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:00:37,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:00:37,776 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 11:00:37,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:37,777 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:00:37,778 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:00:37,779 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:00:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:00:37,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 11:00:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:00:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:00:37,782 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 11:00:37,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:37,782 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:00:37,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:00:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:00:37,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:00:37,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:37,783 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 11:00:37,783 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:37,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 11:00:37,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:38,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 11:00:38,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:38,066 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_60|], 2=[|v_#valid_61|]} [2019-08-05 11:00:38,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:38,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:38,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:38,248 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:00:38,249 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:38,312 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2019-08-05 11:00:38,312 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-08-05 11:00:38,709 WARN L188 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 16 [2019-08-05 11:00:38,709 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-08-05 11:00:38,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:38,710 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:38,852 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:00:39,032 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:00:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:42,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:42,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:00:42,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:00:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:00:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=1875, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:00:42,034 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2019-08-05 11:00:48,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:48,362 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:00:48,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:00:48,362 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2019-08-05 11:00:48,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:48,363 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:00:48,363 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:00:48,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=4793, Invalid=8317, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:00:48,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:00:48,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 11:00:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:00:48,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:00:48,366 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 11:00:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:48,367 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:00:48,367 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:00:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:00:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:00:48,368 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:48,368 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 11:00:48,371 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:48,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 11:00:48,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:48,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 1112 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 11:00:48,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:48,565 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_61|], 2=[|v_#valid_62|]} [2019-08-05 11:00:48,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:48,582 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-08-05 11:00:48,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:48,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:48,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-08-05 11:00:48,651 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:48,688 INFO L567 ElimStorePlain]: treesize reduction 13, result has 61.8 percent of original size [2019-08-05 11:00:48,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:48,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2019-08-05 11:00:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:00:51,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:00:51,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:00:51,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:00:51,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:00:51,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=1937, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:00:51,784 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2019-08-05 11:00:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:00:58,466 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:00:58,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:00:58,467 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 11:00:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:00:58,468 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:00:58,468 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:00:58,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:00:58,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:00:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 11:00:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:00:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:00:58,473 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 11:00:58,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:00:58,473 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:00:58,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:00:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:00:58,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:00:58,474 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:00:58,474 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 11:00:58,474 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:00:58,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:00:58,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 11:00:58,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:00:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:00:58,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:00:58,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:00:58,698 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_62|], 2=[|v_#valid_63|]} [2019-08-05 11:00:58,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-05 11:00:58,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2019-08-05 11:00:58,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:58,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:00:58,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-08-05 11:00:58,762 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-05 11:00:58,821 INFO L567 ElimStorePlain]: treesize reduction 12, result has 68.4 percent of original size [2019-08-05 11:00:58,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-05 11:00:58,822 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:32, output treesize:17 [2019-08-05 11:01:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:01,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:01,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:01:01,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:01:01,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:01:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1660, Invalid=2000, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:01:01,377 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 61 states. Received shutdown request... [2019-08-05 11:01:01,444 WARN L196 SmtUtils]: Removed 3 from assertion stack [2019-08-05 11:01:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:01:01,445 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:01:01,448 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:01:01,449 INFO L202 PluginConnector]: Adding new model 960521-1_false-valid-deref.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:01:01 BoogieIcfgContainer [2019-08-05 11:01:01,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:01:01,450 INFO L168 Benchmark]: Toolchain (without parser) took 244388.69 ms. Allocated memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: 931.7 MB). Free memory was 108.0 MB in the beginning and 648.5 MB in the end (delta: -540.5 MB). Peak memory consumption was 391.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:01,451 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 141.0 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 11:01:01,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 141.0 MB. Free memory was 107.8 MB in the beginning and 106.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:01,452 INFO L168 Benchmark]: Boogie Preprocessor took 38.59 ms. Allocated memory is still 141.0 MB. Free memory was 106.2 MB in the beginning and 104.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:01,452 INFO L168 Benchmark]: RCFGBuilder took 313.55 ms. Allocated memory is still 141.0 MB. Free memory was 104.9 MB in the beginning and 92.4 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:01,452 INFO L168 Benchmark]: TraceAbstraction took 243986.35 ms. Allocated memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: 931.7 MB). Free memory was 92.0 MB in the beginning and 648.5 MB in the end (delta: -556.5 MB). Peak memory consumption was 375.1 MB. Max. memory is 7.1 GB. [2019-08-05 11:01:01,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.21 ms. Allocated memory is still 141.0 MB. Free memory was 109.5 MB in the beginning and 109.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.22 ms. Allocated memory is still 141.0 MB. Free memory was 107.8 MB in the beginning and 106.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.59 ms. Allocated memory is still 141.0 MB. Free memory was 106.2 MB in the beginning and 104.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 313.55 ms. Allocated memory is still 141.0 MB. Free memory was 104.9 MB in the beginning and 92.4 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243986.35 ms. Allocated memory was 141.0 MB in the beginning and 1.1 GB in the end (delta: 931.7 MB). Free memory was 92.0 MB in the beginning and 648.5 MB in the end (delta: -556.5 MB). Peak memory consumption was 375.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 116). Cancelled while BasicCegarLoop was constructing difference of abstraction (117states) and FLOYD_HOARE automaton (currently 3 states, 61 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 27 for 15ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 243.9s OverallTime, 57 OverallIterations, 57 TraceHistogramMax, 151.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 170 SDtfs, 1 SDslu, 392 SDs, 0 SdLazy, 4292 SolverSat, 6325 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5014 GetRequests, 1598 SyntacticMatches, 0 SemanticMatches, 3415 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35583 ImplicationChecksByTransitivity, 200.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 56 MinimizatonAttempts, 56 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 86.3s InterpolantComputationTime, 3420 NumberOfCodeBlocks, 3420 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 3363 ConstructedInterpolants, 3306 QuantifiedInterpolants, 5304117 SizeOfPredicates, 879 NumberOfNonLiveVariables, 34143 ConjunctsInSsa, 2843 ConjunctsInUnsatCore, 57 InterpolantComputations, 1 PerfectInterpolantSequences, 0/61712 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown