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/sanfoundry_24_false-valid-deref.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:01:49,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:01:49,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:01:49,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:01:49,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:01:49,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:01:49,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:01:49,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:01:49,878 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:01:49,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:01:49,880 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:01:49,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:01:49,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:01:49,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:01:49,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:01:49,884 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:01:49,885 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:01:49,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:01:49,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:01:49,889 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:01:49,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:01:49,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:01:49,893 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:01:49,894 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:01:49,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:01:49,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:01:49,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:01:49,898 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:01:49,898 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:01:49,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:01:49,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:01:49,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:01:49,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:01:49,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:01:49,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:01:49,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:01:49,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:01:49,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:01:49,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:01:49,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:01:49,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:01:49,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:01:49,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:01:49,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:01:49,949 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:01:49,950 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:01:49,951 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sanfoundry_24_false-valid-deref.i_4.bpl [2019-08-05 11:01:49,951 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sanfoundry_24_false-valid-deref.i_4.bpl' [2019-08-05 11:01:49,988 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:01:49,990 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:01:49,991 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:49,991 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:01:49,991 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:01:50,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:01:50,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:01:50,028 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:01:50,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:01:50,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,047 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... [2019-08-05 11:01:50,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:01:50,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:01:50,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:01:50,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:01:50,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:01:50,120 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:01:50,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:01:50,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:01:50,463 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:01:50,463 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:01:50,465 INFO L202 PluginConnector]: Adding new model sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:50 BoogieIcfgContainer [2019-08-05 11:01:50,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:01:50,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:01:50,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:01:50,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:01:50,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:01:49" (1/2) ... [2019-08-05 11:01:50,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65e08bc0 and model type sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:01:50, skipping insertion in model container [2019-08-05 11:01:50,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:01:50" (2/2) ... [2019-08-05 11:01:50,480 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i_4.bpl [2019-08-05 11:01:50,501 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:01:50,516 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:01:50,552 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:01:50,579 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:01:50,580 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:01:50,580 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:01:50,580 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:01:50,580 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:01:50,581 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:01:50,581 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:01:50,581 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:01:50,581 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:01:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 11:01:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:01:50,603 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:50,604 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:01:50,606 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:50,613 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 11:01:50,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:50,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:01:50,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:50,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:50,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:50,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:50,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:50,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:50,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:01:50,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 11:01:50,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:01:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:01:51,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:01:51,004 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 11:01:51,250 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 11:01:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:51,336 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:01:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:01:51,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:01:51,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:51,347 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:01:51,347 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:01:51,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:01:51,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 11:01:51,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:01:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:01:51,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 11:01:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:51,384 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:01:51,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:01:51,384 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:01:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:01:51,385 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:51,385 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 11:01:51,385 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 11:01:51,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:51,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:01:51,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:51,512 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:51,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,570 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:51,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:51,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:51,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:51,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:01:51,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:01:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:01:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:01:51,745 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 11:01:52,020 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-08-05 11:01:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:52,043 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:01:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:01:52,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 11:01:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:52,048 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:01:52,048 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:01:52,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:01:52,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:01:52,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 11:01:52,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:01:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:01:52,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 11:01:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:52,052 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:01:52,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:01:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:01:52,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:01:52,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:52,054 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 11:01:52,054 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:52,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:52,055 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 11:01:52,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:52,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:01:52,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:52,144 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:52,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:52,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:52,171 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:52,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:52,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:52,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:01:52,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:01:52,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:01:52,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:01:52,566 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 11:01:53,037 WARN L188 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-08-05 11:01:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:53,135 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:01:53,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:01:53,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 11:01:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:53,136 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:01:53,136 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:01:53,137 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:01:53,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:01:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 11:01:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:01:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:01:53,140 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 11:01:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:53,140 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:01:53,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:01:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:01:53,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:01:53,141 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:53,141 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 11:01:53,141 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:53,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:53,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 11:01:53,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:53,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:01:53,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:53,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:53,217 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:53,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:53,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:53,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:53,450 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:53,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:53,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:01:53,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:01:53,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:01:53,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:01:53,452 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 11:01:53,791 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-08-05 11:01:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:53,983 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:01:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:01:53,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 11:01:53,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:53,985 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:01:53,985 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:01:53,987 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 11:01:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:01:53,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 11:01:53,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:01:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:01:53,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 11:01:53,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:53,991 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:01:53,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:01:53,991 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:01:53,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:01:53,992 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:53,992 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 11:01:53,992 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:53,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:53,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 11:01:53,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:54,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:01:54,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:54,113 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:54,114 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:54,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:54,148 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:54,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:54,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:54,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:01:54,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:01:54,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:01:54,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:01:54,433 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 11:01:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:54,792 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:01:54,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:01:54,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 11:01:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:54,793 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:01:54,794 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:01:54,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:01:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:01:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 11:01:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:01:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:01:54,798 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 11:01:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:54,798 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:01:54,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:01:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:01:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:01:54,799 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:54,799 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 11:01:54,800 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:54,800 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 11:01:54,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:54,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:01:54,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:54,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:54,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:54,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:54,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:54,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:55,341 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:55,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:55,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:01:55,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:01:55,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:01:55,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:01:55,343 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 11:01:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:55,782 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:01:55,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:01:55,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 11:01:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:55,786 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:01:55,786 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:01:55,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:01:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:01:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 11:01:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:01:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:01:55,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 11:01:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:55,790 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:01:55,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:01:55,791 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:01:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:01:55,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:55,791 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 11:01:55,792 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:55,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 11:01:55,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:55,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 11:01:55,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:55,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:55,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:55,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:55,967 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:56,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:56,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:01:56,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:01:56,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:01:56,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:01:56,113 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 11:01:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:56,476 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:01:56,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:01:56,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 11:01:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:56,480 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:01:56,480 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:01:56,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:01:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:01:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 11:01:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:01:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:01:56,484 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 11:01:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:56,484 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:01:56,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:01:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:01:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:01:56,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:56,485 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 11:01:56,486 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:56,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 11:01:56,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:56,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 11:01:56,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:56,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:56,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:56,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:56,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:56,689 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:56,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:01:56,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:01:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:01:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:01:56,906 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 11:01:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:57,396 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:01:57,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:01:57,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 11:01:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:57,399 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:01:57,399 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:01:57,400 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 11:01:57,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:01:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 11:01:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:01:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:01:57,403 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 11:01:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:57,403 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:01:57,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:01:57,404 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:01:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:01:57,404 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:57,404 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 11:01:57,405 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 11:01:57,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:57,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 11:01:57,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:57,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:57,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:57,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:57,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:57,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:57,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:57,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:01:57,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:01:57,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:01:57,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:01:57,812 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 11:01:58,464 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2019-08-05 11:01:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:58,531 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:01:58,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:01:58,533 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 11:01:58,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:58,534 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:01:58,534 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:01:58,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:01:58,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:01:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 11:01:58,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:01:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:01:58,540 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 11:01:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:58,540 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:01:58,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:01:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:01:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:01:58,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:58,541 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 11:01:58,541 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 11:01:58,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:58,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 11:01:58,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:58,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:58,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:01:58,820 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:01:58,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:01:58,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:01:58,822 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:01:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:01:59,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:01:59,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:01:59,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:01:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:01:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:01:59,297 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 11:01:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:01:59,844 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 11:01:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:01:59,845 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 11:01:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:01:59,846 INFO L225 Difference]: With dead ends: 26 [2019-08-05 11:01:59,846 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 11:01:59,847 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 11:01:59,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 11:01:59,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 11:01:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 11:01:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 11:01:59,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 11:01:59,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:01:59,851 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 11:01:59,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:01:59,851 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 11:01:59,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 11:01:59,851 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:01:59,852 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 11:01:59,852 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:01:59,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:01:59,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 11:01:59,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:01:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:01:59,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 11:01:59,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:01:59,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:01:59,959 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:00,086 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:00,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:00,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:00,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:00,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:00,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:02:00,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:02:00,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:02:00,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:02:00,484 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 11:02:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:01,198 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 11:02:01,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:02:01,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 11:02:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:01,200 INFO L225 Difference]: With dead ends: 28 [2019-08-05 11:02:01,200 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 11:02:01,201 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=463, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:02:01,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 11:02:01,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 11:02:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 11:02:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 11:02:01,204 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 11:02:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:01,205 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 11:02:01,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:02:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 11:02:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 11:02:01,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:01,206 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 11:02:01,206 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:01,206 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 11:02:01,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:01,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 11:02:01,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:01,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:01,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:01,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:01,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:01,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:01,609 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:01,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:02:01,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:02:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:02:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:02:01,612 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 11:02:02,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:02,344 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 11:02:02,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:02:02,344 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 11:02:02,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:02,345 INFO L225 Difference]: With dead ends: 30 [2019-08-05 11:02:02,345 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 11:02:02,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:02:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 11:02:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 11:02:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 11:02:02,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 11:02:02,350 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 11:02:02,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:02,350 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 11:02:02,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:02:02,351 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 11:02:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 11:02:02,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:02,352 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 11:02:02,352 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:02,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 11:02:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:02,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 11:02:02,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:02,466 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:02,467 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:02,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:02,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:02,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:02,807 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:02,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:02,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:02:02,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:02:02,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:02:02,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:02:02,809 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 11:02:03,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:03,529 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 11:02:03,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:02:03,530 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 11:02:03,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:03,531 INFO L225 Difference]: With dead ends: 32 [2019-08-05 11:02:03,531 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 11:02:03,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=610, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:02:03,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 11:02:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 11:02:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 11:02:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 11:02:03,536 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 11:02:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:03,536 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 11:02:03,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:02:03,536 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 11:02:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 11:02:03,537 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:03,537 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 11:02:03,538 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:03,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:03,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 11:02:03,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:03,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 11:02:03,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:03,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:03,645 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:03,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:03,695 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:03,695 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:03,977 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:03,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:03,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:02:03,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:02:03,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:02:03,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:02:03,979 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 11:02:04,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:04,907 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 11:02:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:02:04,908 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 11:02:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:04,909 INFO L225 Difference]: With dead ends: 34 [2019-08-05 11:02:04,909 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 11:02:04,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=365, Invalid=691, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:02:04,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 11:02:04,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 11:02:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 11:02:04,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 11:02:04,914 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 11:02:04,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:04,914 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 11:02:04,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:02:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 11:02:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 11:02:04,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:04,915 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 11:02:04,915 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:04,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:04,916 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 11:02:04,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:04,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 11:02:04,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:05,029 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:05,029 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:05,086 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:05,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:05,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:05,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:05,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:02:05,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:02:05,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:02:05,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:02:05,490 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 11:02:06,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:06,438 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 11:02:06,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:02:06,439 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 11:02:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:06,440 INFO L225 Difference]: With dead ends: 36 [2019-08-05 11:02:06,440 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 11:02:06,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:02:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 11:02:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 11:02:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 11:02:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 11:02:06,446 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 11:02:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:06,446 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 11:02:06,446 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:02:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 11:02:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 11:02:06,447 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:06,447 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 11:02:06,447 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:06,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 11:02:06,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:06,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 11:02:06,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:06,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:06,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:06,699 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:06,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:06,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:06,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:07,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:07,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:02:07,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:02:07,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:02:07,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:02:07,432 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 11:02:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:08,442 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 11:02:08,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:02:08,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 11:02:08,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:08,447 INFO L225 Difference]: With dead ends: 38 [2019-08-05 11:02:08,447 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 11:02:08,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:02:08,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 11:02:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 11:02:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 11:02:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 11:02:08,451 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 11:02:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:08,451 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 11:02:08,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:02:08,452 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 11:02:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 11:02:08,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:08,452 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 11:02:08,452 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:08,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 11:02:08,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:08,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 11:02:08,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:08,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:08,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:08,707 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:08,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:08,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:08,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:09,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:09,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:02:09,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:02:09,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:02:09,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:02:09,225 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 11:02:10,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:10,214 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 11:02:10,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:02:10,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 11:02:10,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:10,216 INFO L225 Difference]: With dead ends: 40 [2019-08-05 11:02:10,216 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 11:02:10,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:02:10,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 11:02:10,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 11:02:10,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 11:02:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 11:02:10,220 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 11:02:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:10,221 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 11:02:10,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:02:10,221 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 11:02:10,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 11:02:10,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:10,222 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 11:02:10,222 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:10,222 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 11:02:10,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:10,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:10,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 11:02:10,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:10,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:10,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:10,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:10,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:10,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:10,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:10,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:02:10,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:02:10,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:02:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:02:10,889 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2019-08-05 11:02:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:12,108 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 11:02:12,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 11:02:12,108 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 11:02:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:12,109 INFO L225 Difference]: With dead ends: 42 [2019-08-05 11:02:12,109 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 11:02:12,110 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:02:12,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 11:02:12,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 11:02:12,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 11:02:12,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 11:02:12,114 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 11:02:12,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:12,115 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 11:02:12,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:02:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 11:02:12,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 11:02:12,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:12,116 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 11:02:12,116 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:12,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:12,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 11:02:12,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:12,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 11:02:12,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:12,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:12,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:12,375 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:12,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:12,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:12,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:12,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:12,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 11:02:12,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 11:02:12,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 11:02:12,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 11:02:12,869 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 11:02:13,799 WARN L188 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 11:02:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:14,417 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 11:02:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 11:02:14,417 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 11:02:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:14,418 INFO L225 Difference]: With dead ends: 44 [2019-08-05 11:02:14,418 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 11:02:14,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:02:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 11:02:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 11:02:14,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 11:02:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 11:02:14,422 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 11:02:14,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:14,423 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 11:02:14,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 11:02:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 11:02:14,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 11:02:14,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:14,424 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 11:02:14,424 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:14,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:14,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 11:02:14,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:14,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 11:02:14,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:14,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:14,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:14,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:14,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:14,593 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:15,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:15,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 11:02:15,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 11:02:15,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 11:02:15,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 11:02:15,033 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 11:02:16,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:16,724 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 11:02:16,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 11:02:16,725 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 11:02:16,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:16,726 INFO L225 Difference]: With dead ends: 46 [2019-08-05 11:02:16,726 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 11:02:16,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:02:16,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 11:02:16,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 11:02:16,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 11:02:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 11:02:16,732 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 11:02:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:16,732 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 11:02:16,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 11:02:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 11:02:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 11:02:16,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:16,733 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 11:02:16,734 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:16,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:16,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 11:02:16,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:16,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 11:02:16,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:16,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:16,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:16,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:16,909 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:16,909 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:18,354 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 11:02:18,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:18,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:18,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 11:02:18,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 11:02:18,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 11:02:18,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 11:02:18,373 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 11:02:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:19,622 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 11:02:19,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 11:02:19,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 11:02:19,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:19,623 INFO L225 Difference]: With dead ends: 48 [2019-08-05 11:02:19,623 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 11:02:19,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:02:19,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 11:02:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 11:02:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 11:02:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 11:02:19,628 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 11:02:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:19,629 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 11:02:19,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 11:02:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 11:02:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 11:02:19,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:19,630 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 11:02:19,630 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:19,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:19,630 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 11:02:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:19,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 11:02:19,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:19,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:19,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:19,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:19,819 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:19,819 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 11:02:20,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 11:02:20,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 11:02:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-08-05 11:02:20,319 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2019-08-05 11:02:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:21,807 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 11:02:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 11:02:21,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 11:02:21,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:21,811 INFO L225 Difference]: With dead ends: 50 [2019-08-05 11:02:21,812 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 11:02:21,812 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:02:21,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 11:02:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 11:02:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 11:02:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 11:02:21,815 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 11:02:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:21,815 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 11:02:21,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 11:02:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 11:02:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 11:02:21,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:21,816 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 11:02:21,816 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 11:02:21,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:21,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 11:02:21,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:21,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:21,964 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:22,087 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:22,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:22,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:22,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:22,667 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:22,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:22,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 11:02:22,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 11:02:22,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 11:02:22,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 11:02:22,668 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 11:02:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:24,101 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 11:02:24,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 11:02:24,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 11:02:24,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:24,102 INFO L225 Difference]: With dead ends: 52 [2019-08-05 11:02:24,102 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 11:02:24,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:02:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 11:02:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 11:02:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 11:02:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 11:02:24,107 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 11:02:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:24,107 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 11:02:24,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 11:02:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 11:02:24,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 11:02:24,108 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:24,108 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 11:02:24,109 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:24,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:24,109 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 11:02:24,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:24,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 11:02:24,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:24,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:24,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:24,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:24,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:24,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:24,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 11:02:24,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 11:02:24,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 11:02:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 11:02:24,765 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 11:02:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:26,359 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 11:02:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 11:02:26,360 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 11:02:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:26,360 INFO L225 Difference]: With dead ends: 54 [2019-08-05 11:02:26,361 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 11:02:26,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:02:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 11:02:26,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 11:02:26,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 11:02:26,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 11:02:26,365 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 11:02:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:26,365 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 11:02:26,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 11:02:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 11:02:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 11:02:26,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:26,365 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 11:02:26,366 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 11:02:26,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:26,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 11:02:26,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:26,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:26,529 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:26,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:26,584 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:26,584 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:27,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:27,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 11:02:27,097 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 11:02:27,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 11:02:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 11:02:27,097 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 11:02:28,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:28,625 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 11:02:28,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 11:02:28,626 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 11:02:28,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:28,627 INFO L225 Difference]: With dead ends: 56 [2019-08-05 11:02:28,627 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 11:02:28,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:02:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 11:02:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 11:02:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 11:02:28,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 11:02:28,632 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 11:02:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:28,632 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 11:02:28,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 11:02:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 11:02:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 11:02:28,633 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:28,633 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 11:02:28,633 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:28,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:28,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 11:02:28,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:28,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 11:02:28,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:28,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:28,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,901 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:28,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:28,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:28,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:29,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:29,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 11:02:29,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 11:02:29,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 11:02:29,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 11:02:29,534 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 11:02:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:31,389 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 11:02:31,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 11:02:31,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 11:02:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:31,391 INFO L225 Difference]: With dead ends: 58 [2019-08-05 11:02:31,391 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 11:02:31,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:02:31,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 11:02:31,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 11:02:31,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 11:02:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 11:02:31,395 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 11:02:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:31,395 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 11:02:31,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 11:02:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 11:02:31,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 11:02:31,396 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:31,396 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 11:02:31,397 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:31,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 11:02:31,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:31,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:31,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 11:02:31,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:31,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:31,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:31,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:31,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:31,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:32,239 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:32,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:32,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 11:02:32,240 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 11:02:32,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 11:02:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 11:02:32,241 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 11:02:34,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:34,015 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 11:02:34,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 11:02:34,016 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 11:02:34,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:34,016 INFO L225 Difference]: With dead ends: 60 [2019-08-05 11:02:34,017 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 11:02:34,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:02:34,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 11:02:34,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 11:02:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 11:02:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 11:02:34,021 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 11:02:34,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:34,021 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 11:02:34,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 11:02:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 11:02:34,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 11:02:34,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:34,022 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 11:02:34,023 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:34,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 11:02:34,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:34,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 11:02:34,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:34,185 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:34,185 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:34,305 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:34,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:34,306 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:34,306 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:35,113 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:02:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:35,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:35,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 11:02:35,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 11:02:35,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 11:02:35,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 11:02:35,811 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 11:02:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:37,715 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 11:02:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 11:02:37,718 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 11:02:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:37,718 INFO L225 Difference]: With dead ends: 62 [2019-08-05 11:02:37,718 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 11:02:37,719 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:02:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 11:02:37,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 11:02:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 11:02:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 11:02:37,721 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 11:02:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:37,722 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 11:02:37,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 11:02:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 11:02:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 11:02:37,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:37,785 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 11:02:37,785 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 11:02:37,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:37,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 11:02:37,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:37,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:37,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:38,071 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:38,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:38,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:38,072 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:38,200 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 11:02:38,354 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 11:02:39,102 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:39,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:39,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 11:02:39,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 11:02:39,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 11:02:39,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 11:02:39,104 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 11:02:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:41,082 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 11:02:41,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 11:02:41,082 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 11:02:41,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:41,083 INFO L225 Difference]: With dead ends: 64 [2019-08-05 11:02:41,083 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 11:02:41,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:02:41,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 11:02:41,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 11:02:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 11:02:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 11:02:41,088 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 11:02:41,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:41,088 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 11:02:41,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 11:02:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 11:02:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 11:02:41,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:41,089 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 11:02:41,089 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:41,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:41,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 11:02:41,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:41,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 11:02:41,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:41,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:41,280 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:41,399 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:41,400 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:41,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:41,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:42,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:42,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 11:02:42,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 11:02:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 11:02:42,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 11:02:42,232 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 11:02:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:44,249 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 11:02:44,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 11:02:44,250 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 11:02:44,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:44,251 INFO L225 Difference]: With dead ends: 66 [2019-08-05 11:02:44,251 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 11:02:44,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1493, Invalid=2667, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:02:44,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 11:02:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 11:02:44,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 11:02:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 11:02:44,255 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 11:02:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:44,255 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 11:02:44,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 11:02:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 11:02:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 11:02:44,256 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:44,256 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 11:02:44,256 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:44,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:44,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 11:02:44,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:44,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 11:02:44,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:44,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:44,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:44,605 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:44,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:44,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:44,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:45,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:45,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 11:02:45,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 11:02:45,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 11:02:45,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 11:02:45,813 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 11:02:48,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:48,146 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 11:02:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 11:02:48,147 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 11:02:48,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:48,148 INFO L225 Difference]: With dead ends: 68 [2019-08-05 11:02:48,148 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 11:02:48,149 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 11:02:48,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 11:02:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 11:02:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 11:02:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 11:02:48,152 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 11:02:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:48,152 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 11:02:48,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 11:02:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 11:02:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 11:02:48,153 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:48,153 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 11:02:48,153 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:48,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:48,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 11:02:48,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:48,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 11:02:48,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:48,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:48,351 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:48,480 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:48,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:48,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:48,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:49,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:49,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 11:02:49,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 11:02:49,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 11:02:49,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 11:02:49,795 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 11:02:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:52,095 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 11:02:52,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 11:02:52,095 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 11:02:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:52,096 INFO L225 Difference]: With dead ends: 70 [2019-08-05 11:02:52,096 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 11:02:52,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 11:02:52,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 11:02:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 11:02:52,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 11:02:52,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 11:02:52,099 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 11:02:52,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:52,099 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 11:02:52,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 11:02:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 11:02:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 11:02:52,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:52,100 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 11:02:52,101 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:52,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:52,101 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 11:02:52,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:52,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 613 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 11:02:52,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:52,333 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:52,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:52,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:52,378 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:52,378 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:53,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:53,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 11:02:53,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 11:02:53,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 11:02:53,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 11:02:53,180 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 11:02:55,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:55,456 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 11:02:55,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 11:02:55,457 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 11:02:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:55,458 INFO L225 Difference]: With dead ends: 72 [2019-08-05 11:02:55,458 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 11:02:55,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 11:02:55,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 11:02:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 11:02:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 11:02:55,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 11:02:55,461 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 11:02:55,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:55,462 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 11:02:55,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 11:02:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 11:02:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 11:02:55,462 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:55,462 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 11:02:55,462 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 11:02:55,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:55,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 11:02:55,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:55,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:55,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:55,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:55,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:55,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:02:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:02:56,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:02:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 11:02:56,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 11:02:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 11:02:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 11:02:56,679 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 11:02:59,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:02:59,097 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 11:02:59,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 11:02:59,097 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 11:02:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:02:59,098 INFO L225 Difference]: With dead ends: 74 [2019-08-05 11:02:59,099 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 11:02:59,100 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 11:02:59,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 11:02:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 11:02:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 11:02:59,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 11:02:59,103 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 11:02:59,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:02:59,103 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 11:02:59,103 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 11:02:59,103 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 11:02:59,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 11:02:59,104 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:02:59,104 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 11:02:59,104 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:02:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:02:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 11:02:59,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:02:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:02:59,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 11:02:59,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:02:59,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:02:59,338 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:02:59,441 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:02:59,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:02:59,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:02:59,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:00,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:00,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 11:03:00,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 11:03:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 11:03:00,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 11:03:00,309 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 11:03:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:02,894 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 11:03:02,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 11:03:02,895 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 11:03:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:02,895 INFO L225 Difference]: With dead ends: 76 [2019-08-05 11:03:02,896 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 11:03:02,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 11:03:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 11:03:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 11:03:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 11:03:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 11:03:02,899 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 11:03:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:02,899 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 11:03:02,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 11:03:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 11:03:02,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 11:03:02,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:02,900 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 11:03:02,900 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 11:03:02,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:03,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:03,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 11:03:03,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:03,145 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:03,146 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:03,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:03,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:03,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:04,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:04,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:04,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 11:03:04,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 11:03:04,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 11:03:04,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 11:03:04,075 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 11:03:06,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:06,769 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 11:03:06,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 11:03:06,770 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 11:03:06,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:06,771 INFO L225 Difference]: With dead ends: 78 [2019-08-05 11:03:06,771 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 11:03:06,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 11:03:06,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 11:03:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 11:03:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 11:03:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 11:03:06,774 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 11:03:06,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:06,775 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 11:03:06,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 11:03:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 11:03:06,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 11:03:06,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:06,775 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 11:03:06,775 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:06,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:06,776 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 11:03:06,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:06,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 11:03:06,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:07,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:07,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:07,079 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:07,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:07,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:07,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:07,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 11:03:07,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 11:03:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 11:03:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 11:03:07,999 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 11:03:10,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:10,714 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 11:03:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 11:03:10,714 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 11:03:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:10,715 INFO L225 Difference]: With dead ends: 80 [2019-08-05 11:03:10,715 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 11:03:10,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 11:03:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 11:03:10,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 11:03:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 11:03:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 11:03:10,720 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 11:03:10,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:10,720 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 11:03:10,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 11:03:10,720 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 11:03:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 11:03:10,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:10,721 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 11:03:10,721 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:10,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:10,721 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 11:03:10,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:10,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 11:03:10,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:10,979 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:10,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:11,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:11,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:11,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:12,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:12,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 11:03:12,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 11:03:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 11:03:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 11:03:12,276 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 11:03:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:15,102 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 11:03:15,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 11:03:15,102 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 11:03:15,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:15,103 INFO L225 Difference]: With dead ends: 82 [2019-08-05 11:03:15,104 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 11:03:15,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 11:03:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 11:03:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 11:03:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 11:03:15,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 11:03:15,108 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 11:03:15,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:15,108 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 11:03:15,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 11:03:15,108 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 11:03:15,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 11:03:15,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:15,109 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 11:03:15,109 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:15,110 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 11:03:15,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:15,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 11:03:15,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:15,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:15,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:15,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:15,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:15,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:16,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:16,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:16,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 11:03:16,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 11:03:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 11:03:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 11:03:16,432 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 11:03:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:19,569 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 11:03:19,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 11:03:19,569 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 11:03:19,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:19,570 INFO L225 Difference]: With dead ends: 84 [2019-08-05 11:03:19,570 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 11:03:19,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 11:03:19,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 11:03:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 11:03:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 11:03:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 11:03:19,572 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 11:03:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:19,572 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 11:03:19,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 11:03:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 11:03:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 11:03:19,573 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:19,573 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 11:03:19,573 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 11:03:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:19,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 11:03:19,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:19,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:19,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:20,063 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:03:20,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:20,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:20,064 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:21,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:21,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 11:03:21,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 11:03:21,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 11:03:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 11:03:21,347 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 11:03:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:24,489 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 11:03:24,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 11:03:24,490 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 11:03:24,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:24,491 INFO L225 Difference]: With dead ends: 86 [2019-08-05 11:03:24,491 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 11:03:24,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 11:03:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 11:03:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 11:03:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 11:03:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 11:03:24,494 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 11:03:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:24,495 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 11:03:24,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 11:03:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 11:03:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 11:03:24,495 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:24,496 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 11:03:24,496 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:24,496 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 11:03:24,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:24,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 11:03:24,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:24,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:24,810 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:24,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:24,848 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:24,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:25,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:25,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:25,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 11:03:25,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 11:03:25,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 11:03:25,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 11:03:25,962 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 11:03:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:29,220 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 11:03:29,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 11:03:29,220 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 11:03:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:29,221 INFO L225 Difference]: With dead ends: 88 [2019-08-05 11:03:29,222 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 11:03:29,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 11:03:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 11:03:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 11:03:29,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 11:03:29,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 11:03:29,225 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 11:03:29,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:29,226 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 11:03:29,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 11:03:29,226 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 11:03:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 11:03:29,226 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:29,227 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 11:03:29,227 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 11:03:29,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:29,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 11:03:29,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:29,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:29,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:29,646 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:03:29,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:29,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:29,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:30,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:30,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 11:03:30,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 11:03:30,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 11:03:30,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 11:03:30,843 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 11:03:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:34,418 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 11:03:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 11:03:34,418 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 11:03:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:34,419 INFO L225 Difference]: With dead ends: 90 [2019-08-05 11:03:34,419 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 11:03:34,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 11:03:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 11:03:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 11:03:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 11:03:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 11:03:34,423 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 11:03:34,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:34,423 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 11:03:34,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 11:03:34,424 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 11:03:34,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 11:03:34,424 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:34,424 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 11:03:34,424 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:34,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:34,425 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 11:03:34,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:34,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:34,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 11:03:34,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:34,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:34,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,785 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:34,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:34,786 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:35,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:35,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:35,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 11:03:35,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 11:03:35,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 11:03:35,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 11:03:35,985 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 11:03:39,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:39,344 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 11:03:39,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 11:03:39,345 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 11:03:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:39,346 INFO L225 Difference]: With dead ends: 92 [2019-08-05 11:03:39,346 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 11:03:39,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 11:03:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 11:03:39,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 11:03:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 11:03:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 11:03:39,350 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 11:03:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:39,350 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 11:03:39,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 11:03:39,350 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 11:03:39,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 11:03:39,351 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:39,351 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 11:03:39,351 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:39,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:39,351 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 11:03:39,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:39,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 811 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 11:03:39,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:39,677 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:39,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:39,794 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:03:39,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:39,795 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:39,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:41,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:41,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 11:03:41,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 11:03:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 11:03:41,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 11:03:41,058 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 11:03:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:44,684 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 11:03:44,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 11:03:44,684 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 11:03:44,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:44,685 INFO L225 Difference]: With dead ends: 94 [2019-08-05 11:03:44,686 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 11:03:44,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 11:03:44,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 11:03:44,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 11:03:44,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 11:03:44,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 11:03:44,689 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 11:03:44,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:44,690 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 11:03:44,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 11:03:44,690 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 11:03:44,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 11:03:44,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:44,691 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 11:03:44,691 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:44,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:44,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 11:03:44,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:44,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 11:03:44,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:45,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:45,013 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:45,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:45,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:45,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:46,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:46,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 11:03:46,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 11:03:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 11:03:46,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 11:03:46,408 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 11:03:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:50,150 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 11:03:50,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 11:03:50,150 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 11:03:50,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:50,151 INFO L225 Difference]: With dead ends: 96 [2019-08-05 11:03:50,152 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 11:03:50,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 11:03:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 11:03:50,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 11:03:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 11:03:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 11:03:50,155 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 11:03:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:50,156 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 11:03:50,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 11:03:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 11:03:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 11:03:50,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:50,157 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 11:03:50,157 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 11:03:50,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:50,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 11:03:50,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:50,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:50,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:50,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:50,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:51,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:51,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 11:03:51,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 11:03:51,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 11:03:51,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 11:03:51,801 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 11:03:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:03:55,679 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 11:03:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 11:03:55,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 11:03:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:03:55,681 INFO L225 Difference]: With dead ends: 98 [2019-08-05 11:03:55,681 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 11:03:55,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 11:03:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 11:03:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 11:03:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 11:03:55,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 11:03:55,684 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 11:03:55,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:03:55,685 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 11:03:55,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 11:03:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 11:03:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 11:03:55,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:03:55,685 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 11:03:55,685 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:03:55,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:03:55,686 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 11:03:55,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:03:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:03:56,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 11:03:56,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:03:56,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:03:56,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,121 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:03:56,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:03:56,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:03:58,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:03:58,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:03:58,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 11:03:58,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 11:03:58,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 11:03:58,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 11:03:58,378 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 11:04:02,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:02,285 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 11:04:02,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 11:04:02,286 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 11:04:02,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:02,287 INFO L225 Difference]: With dead ends: 100 [2019-08-05 11:04:02,287 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 11:04:02,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 11:04:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 11:04:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 11:04:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 11:04:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 11:04:02,290 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 11:04:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:02,290 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 11:04:02,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 11:04:02,290 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 11:04:02,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 11:04:02,290 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:02,291 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 11:04:02,291 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:02,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 11:04:02,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:02,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 11:04:02,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:02,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:02,591 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:02,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:02,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:02,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:04,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:04,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 11:04:04,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 11:04:04,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 11:04:04,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 11:04:04,325 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 11:04:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:08,547 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 11:04:08,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 11:04:08,548 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 11:04:08,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:08,549 INFO L225 Difference]: With dead ends: 102 [2019-08-05 11:04:08,549 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 11:04:08,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 11:04:08,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 11:04:08,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 11:04:08,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 11:04:08,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 11:04:08,554 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 11:04:08,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:08,554 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 11:04:08,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 11:04:08,554 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 11:04:08,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 11:04:08,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:08,555 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 11:04:08,555 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:08,556 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 11:04:08,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:08,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 11:04:08,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:08,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:08,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:08,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:08,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:08,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:10,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:10,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 11:04:10,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 11:04:10,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 11:04:10,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 11:04:10,556 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 11:04:14,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:14,768 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 11:04:14,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 11:04:14,768 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 11:04:14,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:14,769 INFO L225 Difference]: With dead ends: 104 [2019-08-05 11:04:14,769 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 11:04:14,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 11:04:14,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 11:04:14,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 11:04:14,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 11:04:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 11:04:14,774 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 11:04:14,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:14,774 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 11:04:14,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 11:04:14,774 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 11:04:14,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 11:04:14,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:14,775 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 11:04:14,775 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:14,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:14,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 11:04:14,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:15,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 919 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 11:04:15,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:15,085 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:15,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:15,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:15,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:15,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:16,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:16,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 11:04:16,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 11:04:16,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 11:04:16,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 11:04:16,641 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 11:04:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:21,065 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 11:04:21,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 11:04:21,066 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 11:04:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:21,067 INFO L225 Difference]: With dead ends: 106 [2019-08-05 11:04:21,067 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 11:04:21,069 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 11:04:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 11:04:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 11:04:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 11:04:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 11:04:21,072 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 11:04:21,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:21,072 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 11:04:21,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 11:04:21,072 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 11:04:21,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 11:04:21,073 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:21,073 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 11:04:21,073 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 11:04:21,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:21,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 11:04:21,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:21,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:21,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:21,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:21,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:21,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:22,935 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:04:22,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:22,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 11:04:22,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 11:04:22,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 11:04:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 11:04:22,937 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 11:04:27,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:27,399 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 11:04:27,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 11:04:27,399 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 11:04:27,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:27,401 INFO L225 Difference]: With dead ends: 108 [2019-08-05 11:04:27,401 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 11:04:27,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 11:04:27,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 11:04:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 11:04:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 11:04:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 11:04:27,405 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 11:04:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:27,405 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 11:04:27,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 11:04:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 11:04:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 11:04:27,406 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:27,406 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 11:04:27,406 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:27,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 11:04:27,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:27,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 11:04:27,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:27,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:27,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:27,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:27,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:27,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:29,665 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:04:29,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:29,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 11:04:29,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 11:04:29,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 11:04:29,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 11:04:29,667 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 11:04:34,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:34,423 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 11:04:34,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 11:04:34,424 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 11:04:34,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:34,425 INFO L225 Difference]: With dead ends: 110 [2019-08-05 11:04:34,425 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 11:04:34,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 11:04:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 11:04:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 11:04:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 11:04:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 11:04:34,429 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 11:04:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:34,429 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 11:04:34,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 11:04:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 11:04:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 11:04:34,430 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:34,430 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 11:04:34,431 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:34,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:34,431 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 11:04:34,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:34,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 11:04:34,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:34,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:34,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,072 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:04:35,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:35,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:35,073 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:37,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:37,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:37,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 11:04:37,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 11:04:37,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 11:04:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 11:04:37,186 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2019-08-05 11:04:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:41,995 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 11:04:41,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 11:04:41,995 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2019-08-05 11:04:41,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:41,996 INFO L225 Difference]: With dead ends: 112 [2019-08-05 11:04:41,996 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 11:04:41,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 11:04:41,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 11:04:42,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 11:04:42,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 11:04:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 11:04:42,001 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 11:04:42,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:42,001 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 11:04:42,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 11:04:42,001 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 11:04:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 11:04:42,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:42,002 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 11:04:42,002 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:42,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:42,002 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 11:04:42,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:42,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 11:04:42,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:42,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:42,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,522 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 11:04:42,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:42,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:42,523 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:44,426 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:04:44,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:44,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 11:04:44,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 11:04:44,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 11:04:44,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 11:04:44,428 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2019-08-05 11:04:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:49,351 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 11:04:49,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 11:04:49,352 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 11:04:49,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:49,353 INFO L225 Difference]: With dead ends: 114 [2019-08-05 11:04:49,353 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 11:04:49,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 11:04:49,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 11:04:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 11:04:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 11:04:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 11:04:49,356 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 11:04:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:49,356 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 11:04:49,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 11:04:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 11:04:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 11:04:49,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:49,357 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 11:04:49,357 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 11:04:49,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:49,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 11:04:49,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:49,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:49,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:49,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:49,802 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:49,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:51,626 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:04:51,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:51,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 11:04:51,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 11:04:51,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 11:04:51,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=1875, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 11:04:51,628 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2019-08-05 11:04:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:56,742 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 11:04:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 11:04:56,743 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2019-08-05 11:04:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:56,744 INFO L225 Difference]: With dead ends: 116 [2019-08-05 11:04:56,744 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 11:04:56,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1701 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4793, Invalid=8317, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 11:04:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 11:04:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 11:04:56,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 11:04:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 11:04:56,748 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 11:04:56,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:56,748 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 11:04:56,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 11:04:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 11:04:56,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 11:04:56,749 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:56,750 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 11:04:56,750 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:56,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:56,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 11:04:56,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:57,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 11:04:57,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:57,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:04:57,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:04:57,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:04:57,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:04:57,193 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:04:59,082 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:04:59,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:59,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 11:04:59,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 11:04:59,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 11:04:59,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=1937, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 11:04:59,084 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2019-08-05 11:05:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:04,579 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 11:05:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:05:04,580 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 11:05:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:04,581 INFO L225 Difference]: With dead ends: 118 [2019-08-05 11:05:04,581 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 11:05:04,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 11:05:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 11:05:04,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 11:05:04,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 11:05:04,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 11:05:04,584 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 11:05:04,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:04,584 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 11:05:04,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 11:05:04,585 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 11:05:04,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 11:05:04,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:04,586 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 11:05:04,586 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:04,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:04,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 11:05:04,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:04,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:04,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 11:05:04,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:05,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:05,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:05,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:05,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:05,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:05:06,968 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:05:06,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:06,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 11:05:06,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 11:05:06,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 11:05:06,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1660, Invalid=2000, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 11:05:06,970 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 61 states. [2019-08-05 11:05:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:12,453 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 11:05:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 11:05:12,453 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 116 [2019-08-05 11:05:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:12,454 INFO L225 Difference]: With dead ends: 120 [2019-08-05 11:05:12,455 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 11:05:12,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5138, Invalid=8904, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 11:05:12,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 11:05:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-08-05 11:05:12,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 11:05:12,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 11:05:12,457 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 11:05:12,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:12,458 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 11:05:12,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 11:05:12,458 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 11:05:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 11:05:12,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:12,458 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 11:05:12,459 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2019-08-05 11:05:12,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:12,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 11:05:12,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:12,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:12,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:12,847 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:12,847 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:12,848 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:05:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:15,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:15,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 11:05:15,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 11:05:15,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 11:05:15,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 11:05:15,154 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 62 states. [2019-08-05 11:05:20,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:20,828 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 11:05:20,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 11:05:20,829 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 118 [2019-08-05 11:05:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:20,830 INFO L225 Difference]: With dead ends: 122 [2019-08-05 11:05:20,830 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 11:05:20,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5315, Invalid=9205, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 11:05:20,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 11:05:20,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-05 11:05:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 11:05:20,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 11:05:20,834 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-05 11:05:20,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:20,834 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 11:05:20,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 11:05:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 11:05:20,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 11:05:20,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:20,835 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-05 11:05:20,835 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:20,835 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2019-08-05 11:05:20,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:21,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 11:05:21,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:21,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:21,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:21,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:21,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:21,299 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:05:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:23,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:23,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 11:05:23,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 11:05:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 11:05:23,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1777, Invalid=2129, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 11:05:23,324 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 63 states. [2019-08-05 11:05:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:29,094 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 11:05:29,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 11:05:29,095 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 120 [2019-08-05 11:05:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:29,096 INFO L225 Difference]: With dead ends: 124 [2019-08-05 11:05:29,096 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 11:05:29,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1943 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5495, Invalid=9511, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 11:05:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 11:05:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-08-05 11:05:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 11:05:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 11:05:29,101 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-05 11:05:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:29,101 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 11:05:29,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 11:05:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 11:05:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 11:05:29,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:29,102 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-05 11:05:29,102 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:29,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2019-08-05 11:05:29,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:29,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 1099 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 11:05:29,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:29,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:29,579 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:29,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:29,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:29,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:05:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:31,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:31,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 11:05:31,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 11:05:31,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 11:05:31,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1837, Invalid=2195, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 11:05:31,971 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 64 states. [2019-08-05 11:05:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:37,698 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 11:05:37,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 11:05:37,699 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 122 [2019-08-05 11:05:37,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:37,700 INFO L225 Difference]: With dead ends: 126 [2019-08-05 11:05:37,700 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 11:05:37,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5678, Invalid=9822, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 11:05:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 11:05:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-08-05 11:05:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 11:05:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 11:05:37,704 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-05 11:05:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:37,704 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 11:05:37,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 11:05:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 11:05:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 11:05:37,705 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:37,705 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-05 11:05:37,705 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2019-08-05 11:05:37,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:38,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 11:05:38,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:38,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:38,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:38,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:38,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:05:40,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:40,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:40,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 11:05:40,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 11:05:40,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 11:05:40,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1898, Invalid=2262, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 11:05:40,701 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 65 states. [2019-08-05 11:05:46,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:05:46,736 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 11:05:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 11:05:46,737 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 124 [2019-08-05 11:05:46,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:05:46,738 INFO L225 Difference]: With dead ends: 128 [2019-08-05 11:05:46,738 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 11:05:46,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=5864, Invalid=10138, Unknown=0, NotChecked=0, Total=16002 [2019-08-05 11:05:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 11:05:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-08-05 11:05:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 11:05:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 11:05:46,742 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-05 11:05:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:05:46,743 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 11:05:46,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 11:05:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 11:05:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 11:05:46,743 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:05:46,743 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-05 11:05:46,743 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:05:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:05:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2019-08-05 11:05:46,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:05:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:05:47,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 11:05:47,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:05:47,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 11:05:47,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 11:05:47,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 11:05:47,305 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-05 11:05:47,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 11:05:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:05:49,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:05:49,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 11:05:49,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 11:05:49,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 11:05:49,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 11:05:49,498 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 66 states. Received shutdown request... [2019-08-05 11:05:55,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 11:05:55,030 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 11:05:55,035 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 11:05:55,035 INFO L202 PluginConnector]: Adding new model sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:05:55 BoogieIcfgContainer [2019-08-05 11:05:55,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:05:55,036 INFO L168 Benchmark]: Toolchain (without parser) took 245047.06 ms. Allocated memory was 134.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 109.7 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 293.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:55,037 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 11:05:55,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.24 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:55,037 INFO L168 Benchmark]: Boogie Preprocessor took 22.44 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 106.7 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:05:55,038 INFO L168 Benchmark]: RCFGBuilder took 414.62 ms. Allocated memory is still 134.7 MB. Free memory was 106.7 MB in the beginning and 95.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:55,038 INFO L168 Benchmark]: TraceAbstraction took 244568.80 ms. Allocated memory was 134.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 95.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 279.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:05:55,040 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.7 MB. Free memory was 111.2 MB in the beginning and 111.0 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.24 ms. Allocated memory is still 134.7 MB. Free memory was 109.7 MB in the beginning and 108.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.44 ms. Allocated memory is still 134.7 MB. Free memory was 108.0 MB in the beginning and 106.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 414.62 ms. Allocated memory is still 134.7 MB. Free memory was 106.7 MB in the beginning and 95.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244568.80 ms. Allocated memory was 134.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 95.6 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 279.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 83). Cancelled while BasicCegarLoop was constructing difference of abstraction (127states) and FLOYD_HOARE automaton (currently 61 states, 66 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 124 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 244.4s OverallTime, 62 OverallIterations, 62 TraceHistogramMax, 160.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 186 SDtfs, 62 SDslu, 454 SDs, 0 SdLazy, 5187 SolverSat, 7605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5976 GetRequests, 1893 SyntacticMatches, 0 SemanticMatches, 4082 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47017 ImplicationChecksByTransitivity, 204.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=61, 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, 61 MinimizatonAttempts, 61 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 11.4s SatisfiabilityAnalysisTime, 71.5s InterpolantComputationTime, 4030 NumberOfCodeBlocks, 4030 NumberOfCodeBlocksAsserted, 62 NumberOfCheckSat, 3968 ConstructedInterpolants, 60 QuantifiedInterpolants, 4051880 SizeOfPredicates, 742 NumberOfNonLiveVariables, 36332 ConjunctsInSsa, 2884 ConjunctsInUnsatCore, 62 InterpolantComputations, 1 PerfectInterpolantSequences, 0/79422 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown