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/array3_false-valid-deref.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:55:49,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:55:49,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:55:49,901 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:55:49,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:55:49,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:55:49,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:55:49,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:55:49,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:55:49,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:55:49,912 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:55:49,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:55:49,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:55:49,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:55:49,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:55:49,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:55:49,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:55:49,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:55:49,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:55:49,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:55:49,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:55:49,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:55:49,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:55:49,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:55:49,939 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:55:49,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:55:49,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:55:49,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:55:49,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:55:49,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:55:49,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:55:49,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:55:49,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:55:49,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:55:49,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:55:49,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:55:49,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:55:49,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:55:49,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:55:49,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:55:49,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:55:49,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:55:50,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:55:50,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:55:50,018 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:55:50,018 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:55:50,019 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl [2019-08-05 10:55:50,019 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl' [2019-08-05 10:55:50,078 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:55:50,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:55:50,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:55:50,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:55:50,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:55:50,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,123 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:55:50,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:55:50,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:55:50,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:55:50,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,138 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,139 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,151 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... [2019-08-05 10:55:50,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:55:50,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:55:50,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:55:50,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:55:50,155 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:55:50,221 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 10:55:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 10:55:50,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 10:55:50,513 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 10:55:50,513 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:55:50,514 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:55:50 BoogieIcfgContainer [2019-08-05 10:55:50,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:55:50,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:55:50,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:55:50,519 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:55:50,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:55:50" (1/2) ... [2019-08-05 10:55:50,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be5cace and model type array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:55:50, skipping insertion in model container [2019-08-05 10:55:50,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:55:50" (2/2) ... [2019-08-05 10:55:50,523 INFO L109 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i_6.bpl [2019-08-05 10:55:50,532 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:55:50,540 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:55:50,556 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:55:50,586 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:55:50,587 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:55:50,587 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:55:50,587 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:55:50,587 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:55:50,588 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:55:50,588 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:55:50,588 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:55:50,589 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:55:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-08-05 10:55:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:55:50,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:50,610 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:55:50,612 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:50,618 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2019-08-05 10:55:50,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:50,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:50,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:55:50,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:50,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:55:50,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:50,951 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:55:50,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:50,953 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 10:55:50,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:51,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:55:51,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:55:51,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:55:51,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:55:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:55:51,113 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-08-05 10:55:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:51,256 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:55:51,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:55:51,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:55:51,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:51,267 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:55:51,267 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:55:51,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:55:51,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:55:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-08-05 10:55:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:55:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:55:51,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-08-05 10:55:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:51,303 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:55:51,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:55:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:55:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:55:51,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:51,304 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:55:51,305 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2019-08-05 10:55:51,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:51,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:55:51,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:51,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:55:51,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:51,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:51,443 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 10:55:51,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:51,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:51,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:55:51,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:55:51,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:55:51,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:55:51,608 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 5 states. [2019-08-05 10:55:51,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:51,815 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:55:51,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:55:51,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-08-05 10:55:51,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:51,817 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:55:51,817 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:55:51,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:55:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:55:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:55:51,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:55:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:55:51,820 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2019-08-05 10:55:51,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:51,821 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:55:51,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:55:51,821 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:55:51,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:55:51,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:51,822 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2019-08-05 10:55:51,822 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:51,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:51,823 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2019-08-05 10:55:51,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:51,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:55:51,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:51,911 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 10:55:51,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:51,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:51,949 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 10:55:51,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:52,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:52,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:55:52,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:55:52,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:55:52,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:55:52,265 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 7 states. [2019-08-05 10:55:52,780 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-08-05 10:55:52,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:52,906 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:55:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:55:52,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-08-05 10:55:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:52,908 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:55:52,908 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:55:52,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:55:52,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:55:52,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-08-05 10:55:52,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:55:52,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:55:52,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:55:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:52,917 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:55:52,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:55:52,918 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:55:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:55:52,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:52,919 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2019-08-05 10:55:52,919 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:52,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:52,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2019-08-05 10:55:52,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:53,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:55:53,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:53,084 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 10:55:53,085 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:53,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:53,163 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 10:55:53,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:53,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:53,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:55:53,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:55:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:55:53,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:55:53,423 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-08-05 10:55:53,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:53,703 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:55:53,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:55:53,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-08-05 10:55:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:53,705 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:55:53,705 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:55:53,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:55:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:55:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-08-05 10:55:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:55:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:55:53,709 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:55:53,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:53,710 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:55:53,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:55:53,710 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:55:53,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:55:53,711 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:53,711 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2019-08-05 10:55:53,711 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:53,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2019-08-05 10:55:53,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:53,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:55:53,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:53,818 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 10:55:53,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:53,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:53,843 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 10:55:53,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:54,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:54,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:54,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:55:54,082 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:55:54,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:55:54,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:55:54,083 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 9 states. [2019-08-05 10:55:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:54,430 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:55:54,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:55:54,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-08-05 10:55:54,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:54,431 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:55:54,431 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:55:54,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:55:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:55:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-08-05 10:55:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:55:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:55:54,435 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:55:54,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:54,435 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:55:54,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:55:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:55:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:55:54,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:54,436 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2019-08-05 10:55:54,436 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:54,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2019-08-05 10:55:54,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:54,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:55:54,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:54,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:55:54,520 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:54,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:54,534 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 10:55:54,534 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:54,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:54,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:55:54,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:55:54,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:55:54,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:55:54,810 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 10 states. [2019-08-05 10:55:55,287 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-08-05 10:55:55,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:55,402 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:55:55,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:55:55,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-08-05 10:55:55,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:55,403 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:55:55,404 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:55:55,404 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:55:55,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:55:55,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-08-05 10:55:55,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:55:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:55:55,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:55:55,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:55,408 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:55:55,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:55:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:55:55,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:55:55,409 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:55,409 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2019-08-05 10:55:55,409 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:55,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:55,410 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2019-08-05 10:55:55,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:55,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:55,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:55:55,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:55,513 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 10:55:55,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:55,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:55,533 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 10:55:55,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:55,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:55,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:55:55,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:55:55,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:55:55,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:55:55,768 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 11 states. [2019-08-05 10:55:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:56,167 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:55:56,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:55:56,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-08-05 10:55:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:56,170 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:55:56,170 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:55:56,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:55:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:55:56,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-08-05 10:55:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:55:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:55:56,173 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2019-08-05 10:55:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:56,174 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:55:56,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:55:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:55:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:55:56,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:56,175 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2019-08-05 10:55:56,175 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:56,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:56,175 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2019-08-05 10:55:56,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:56,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:55:56,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:56,246 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 10:55:56,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:56,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:56,263 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 10:55:56,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:56,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:56,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:55:56,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:55:56,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:55:56,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:55:56,471 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 12 states. [2019-08-05 10:55:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:56,949 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:55:56,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:55:56,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-08-05 10:55:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:56,951 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:55:56,951 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:55:56,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:55:56,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:55:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-08-05 10:55:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:55:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:55:56,954 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2019-08-05 10:55:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:56,955 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:55:56,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:55:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:55:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:55:56,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:56,956 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2019-08-05 10:55:56,956 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:56,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2019-08-05 10:55:56,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:57,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:55:57,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:57,053 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 10:55:57,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:57,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:57,092 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 10:55:57,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:57,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:57,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:55:57,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:55:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:55:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:55:57,289 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 13 states. [2019-08-05 10:55:57,886 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 10:55:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:57,995 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:55:57,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:55:57,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2019-08-05 10:55:57,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:57,997 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:55:57,998 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:55:57,999 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:55:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:55:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:55:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:55:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:55:58,002 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2019-08-05 10:55:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:58,002 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:55:58,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:55:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:55:58,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:55:58,003 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:58,003 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2019-08-05 10:55:58,003 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:58,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2019-08-05 10:55:58,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:58,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:55:58,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:58,112 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 10:55:58,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:58,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:58,153 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 10:55:58,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:58,329 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:58,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:55:58,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:55:58,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:55:58,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:55:58,331 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 14 states. [2019-08-05 10:55:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:58,875 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:55:58,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:55:58,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-08-05 10:55:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:58,877 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:55:58,877 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:55:58,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:55:58,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:55:58,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-08-05 10:55:58,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:55:58,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:55:58,882 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2019-08-05 10:55:58,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:58,882 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:55:58,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:55:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:55:58,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:55:58,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:58,883 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2019-08-05 10:55:58,883 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:58,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2019-08-05 10:55:58,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:58,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:55:58,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:58,971 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 10:55:58,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:55:59,091 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:55:59,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:55:59,092 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 10:55:59,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:55:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:59,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:59,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:55:59,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:55:59,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:55:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:55:59,439 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 15 states. [2019-08-05 10:56:00,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:00,174 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:56:00,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:56:00,175 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-08-05 10:56:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:00,176 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:56:00,176 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:56:00,177 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 10:56:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:56:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-08-05 10:56:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:56:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:56:00,180 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2019-08-05 10:56:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:00,181 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:56:00,181 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:56:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:56:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:56:00,182 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:00,182 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2019-08-05 10:56:00,182 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:00,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2019-08-05 10:56:00,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:00,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:56:00,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:00,266 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 10:56:00,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:00,307 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:00,308 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 10:56:00,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:00,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:00,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:56:00,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:56:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:56:00,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:56:00,591 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 16 states. [2019-08-05 10:56:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:01,353 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:56:01,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:56:01,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-08-05 10:56:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:01,356 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:56:01,356 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:56:01,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:56:01,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:56:01,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-08-05 10:56:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:56:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:56:01,360 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2019-08-05 10:56:01,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:01,360 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:56:01,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:56:01,360 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:56:01,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:56:01,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:01,361 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2019-08-05 10:56:01,361 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:01,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:01,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2019-08-05 10:56:01,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:01,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:56:01,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:01,446 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 10:56:01,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:01,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:01,480 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 10:56:01,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:01,743 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:01,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:01,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:56:01,744 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:56:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:56:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:56:01,745 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 17 states. [2019-08-05 10:56:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:02,447 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:56:02,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:56:02,448 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2019-08-05 10:56:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:02,449 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:56:02,449 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:56:02,450 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 10:56:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:56:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-08-05 10:56:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:56:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:56:02,455 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2019-08-05 10:56:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:02,455 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:56:02,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:56:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:56:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:56:02,456 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:02,456 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2019-08-05 10:56:02,457 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2019-08-05 10:56:02,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:02,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:56:02,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:02,549 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 10:56:02,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:02,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:02,581 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 10:56:02,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:02,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:02,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:56:02,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:56:02,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:56:02,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:56:02,849 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 18 states. [2019-08-05 10:56:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:03,697 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:56:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:56:03,697 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-08-05 10:56:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:03,698 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:56:03,698 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:56:03,699 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 10:56:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:56:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-08-05 10:56:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:56:03,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:56:03,703 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2019-08-05 10:56:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:03,703 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:56:03,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:56:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:56:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:56:03,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:03,704 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2019-08-05 10:56:03,705 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2019-08-05 10:56:03,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:03,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:03,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:56:03,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:03,800 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 10:56:03,800 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:03,831 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:03,832 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 10:56:03,832 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:04,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:04,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:56:04,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:56:04,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:56:04,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:56:04,158 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 19 states. [2019-08-05 10:56:05,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:05,075 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:56:05,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:56:05,075 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2019-08-05 10:56:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:05,076 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:56:05,076 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:56:05,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=413, Invalid=777, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:56:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:56:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-08-05 10:56:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:56:05,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:56:05,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2019-08-05 10:56:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:05,082 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:56:05,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:56:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:56:05,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:56:05,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:05,083 INFO L399 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2019-08-05 10:56:05,083 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:05,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:05,083 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2019-08-05 10:56:05,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:05,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:56:05,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:05,192 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 10:56:05,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:05,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:05,246 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 10:56:05,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:05,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:56:05,626 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:56:05,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:56:05,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:56:05,626 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 20 states. [2019-08-05 10:56:06,027 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 10:56:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:06,653 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:56:06,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:56:06,655 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-08-05 10:56:06,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:06,656 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:56:06,656 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:56:06,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=464, Invalid=868, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:56:06,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:56:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-08-05 10:56:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:56:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:56:06,659 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2019-08-05 10:56:06,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:06,660 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:56:06,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:56:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:56:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:56:06,661 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:06,661 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2019-08-05 10:56:06,661 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:06,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:06,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2019-08-05 10:56:06,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:06,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:56:06,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:06,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:56:06,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:06,868 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:06,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:06,869 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 10:56:06,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:07,496 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:56:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:08,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:08,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:56:08,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:56:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:56:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=260, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:56:08,024 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 21 states. [2019-08-05 10:56:08,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:08,999 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:56:09,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:56:09,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 36 [2019-08-05 10:56:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:09,001 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:56:09,001 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:56:09,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=518, Invalid=964, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:56:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:56:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-08-05 10:56:09,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:56:09,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:56:09,006 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2019-08-05 10:56:09,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:09,006 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:56:09,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:56:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:56:09,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:56:09,007 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:09,007 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2019-08-05 10:56:09,007 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:09,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:09,008 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2019-08-05 10:56:09,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:09,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:56:09,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:09,118 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 10:56:09,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:09,232 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:09,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:09,233 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 10:56:09,233 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:09,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:09,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:56:09,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:56:09,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:56:09,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=284, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:56:09,950 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 22 states. [2019-08-05 10:56:11,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:11,221 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:56:11,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:56:11,222 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 38 [2019-08-05 10:56:11,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:11,223 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:56:11,223 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:56:11,224 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=575, Invalid=1065, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:56:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:56:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-08-05 10:56:11,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:56:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:56:11,228 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2019-08-05 10:56:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:11,228 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:56:11,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:56:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:56:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:56:11,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:11,229 INFO L399 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2019-08-05 10:56:11,229 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:11,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:11,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2019-08-05 10:56:11,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:11,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:56:11,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:11,332 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 10:56:11,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:11,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:11,373 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 10:56:11,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:11,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:11,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:56:11,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:56:11,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:56:11,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=309, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:56:11,731 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 23 states. [2019-08-05 10:56:12,461 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 10:56:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:13,113 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:56:13,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:56:13,113 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2019-08-05 10:56:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:13,114 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:56:13,114 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:56:13,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=635, Invalid=1171, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:56:13,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:56:13,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-08-05 10:56:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:56:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:56:13,119 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2019-08-05 10:56:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:13,119 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:56:13,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:56:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:56:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:56:13,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:13,120 INFO L399 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2019-08-05 10:56:13,120 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:13,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2019-08-05 10:56:13,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:13,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:56:13,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:13,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 10:56:13,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:13,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:13,251 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 10:56:13,251 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:13,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:13,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:56:13,625 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:56:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:56:13,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=335, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:56:13,625 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 24 states. [2019-08-05 10:56:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:15,181 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:56:15,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:56:15,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2019-08-05 10:56:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:15,183 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:56:15,183 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:56:15,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=698, Invalid=1282, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:56:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:56:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2019-08-05 10:56:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:56:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:56:15,188 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2019-08-05 10:56:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:15,189 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:56:15,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:56:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:56:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:56:15,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:15,190 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2019-08-05 10:56:15,190 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:15,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2019-08-05 10:56:15,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:15,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:56:15,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:15,311 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 10:56:15,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:15,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:15,394 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 10:56:15,394 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:16,343 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-08-05 10:56:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:16,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:16,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:56:16,369 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:56:16,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:56:16,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=362, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:56:16,370 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 25 states. [2019-08-05 10:56:16,782 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-08-05 10:56:17,189 WARN L188 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-08-05 10:56:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:18,375 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:56:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:56:18,375 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 44 [2019-08-05 10:56:18,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:18,376 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:56:18,376 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:56:18,378 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=764, Invalid=1398, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:56:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:56:18,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-08-05 10:56:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:56:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:56:18,382 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2019-08-05 10:56:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:18,382 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:56:18,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:56:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:56:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:56:18,383 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:18,383 INFO L399 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2019-08-05 10:56:18,383 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:18,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:18,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2019-08-05 10:56:18,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:18,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:56:18,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:18,482 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 10:56:18,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:18,605 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:18,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:18,606 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 10:56:18,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:19,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:19,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:56:19,537 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:56:19,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:56:19,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=390, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:56:19,538 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 26 states. [2019-08-05 10:56:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:20,903 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:56:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:56:20,906 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2019-08-05 10:56:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:20,907 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:56:20,907 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:56:20,908 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=833, Invalid=1519, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:56:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:56:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:56:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:56:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:56:20,911 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2019-08-05 10:56:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:20,911 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:56:20,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:56:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:56:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:56:20,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:20,912 INFO L399 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2019-08-05 10:56:20,912 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:20,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2019-08-05 10:56:20,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:20,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:56:20,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:21,017 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 10:56:21,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:21,133 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:21,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:21,134 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 10:56:21,135 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:21,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:21,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:56:21,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:56:21,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:56:21,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=419, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:56:21,860 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 27 states. [2019-08-05 10:56:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:23,267 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:56:23,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:56:23,268 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2019-08-05 10:56:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:23,269 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:56:23,269 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:56:23,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=905, Invalid=1645, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:56:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:56:23,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-08-05 10:56:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:56:23,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:56:23,274 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2019-08-05 10:56:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:23,274 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:56:23,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:56:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:56:23,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:56:23,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:23,275 INFO L399 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2019-08-05 10:56:23,276 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2019-08-05 10:56:23,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:23,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:56:23,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:23,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:56:23,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:23,422 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:23,422 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 10:56:23,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:23,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:23,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:56:23,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:56:23,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:56:23,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=449, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:56:23,879 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 28 states. [2019-08-05 10:56:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:25,334 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:56:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:56:25,335 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 50 [2019-08-05 10:56:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:25,336 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:56:25,336 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:56:25,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=980, Invalid=1776, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:56:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:56:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-08-05 10:56:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:56:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:56:25,340 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2019-08-05 10:56:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:25,341 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:56:25,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:56:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:56:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:56:25,341 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:25,341 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2019-08-05 10:56:25,341 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2019-08-05 10:56:25,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:25,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:56:25,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:25,450 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 10:56:25,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:25,494 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:25,495 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 10:56:25,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:26,011 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:26,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:26,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:56:26,012 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:56:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:56:26,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=480, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:56:26,013 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 29 states. [2019-08-05 10:56:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:27,723 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:56:27,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:56:27,723 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 52 [2019-08-05 10:56:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:27,724 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:56:27,724 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:56:27,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1058, Invalid=1912, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:56:27,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:56:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-08-05 10:56:27,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:56:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:56:27,731 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2019-08-05 10:56:27,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:27,732 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:56:27,732 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:56:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:56:27,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:56:27,733 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:27,733 INFO L399 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2019-08-05 10:56:27,733 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:27,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2019-08-05 10:56:27,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:27,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:56:27,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:27,844 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:56:27,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:27,957 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:27,958 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:27,958 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 10:56:27,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:28,726 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:28,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:28,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:56:28,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:56:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:56:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=512, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:56:28,728 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 30 states. [2019-08-05 10:56:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:30,338 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:56:30,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:56:30,339 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 54 [2019-08-05 10:56:30,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:30,339 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:56:30,340 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:56:30,342 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1139, Invalid=2053, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:56:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:56:30,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2019-08-05 10:56:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:56:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:56:30,344 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2019-08-05 10:56:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:30,344 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:56:30,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:56:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:56:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:56:30,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:30,345 INFO L399 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2019-08-05 10:56:30,346 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2019-08-05 10:56:30,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:30,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:56:30,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:30,459 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 10:56:30,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:30,578 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:30,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:30,579 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 10:56:30,579 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:31,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:31,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:56:31,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:56:31,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:56:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=545, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:56:31,205 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 31 states. [2019-08-05 10:56:33,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:33,141 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:56:33,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:56:33,141 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2019-08-05 10:56:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:33,142 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:56:33,142 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:56:33,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1223, Invalid=2199, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:56:33,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:56:33,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2019-08-05 10:56:33,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:56:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:56:33,146 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2019-08-05 10:56:33,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:33,147 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:56:33,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:56:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:56:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:56:33,147 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:33,147 INFO L399 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2019-08-05 10:56:33,148 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:33,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2019-08-05 10:56:33,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:33,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:56:33,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:33,265 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 10:56:33,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:33,389 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:33,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:33,389 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 10:56:33,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:34,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:34,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:56:34,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:56:34,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:56:34,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=579, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:56:34,069 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 32 states. [2019-08-05 10:56:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:35,898 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:56:35,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:56:35,899 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 58 [2019-08-05 10:56:35,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:35,900 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:56:35,900 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:56:35,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1310, Invalid=2350, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:56:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:56:35,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-08-05 10:56:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:56:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:56:35,905 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2019-08-05 10:56:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:35,905 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:56:35,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:56:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:56:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:56:35,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:35,906 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2019-08-05 10:56:35,908 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:35,909 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2019-08-05 10:56:35,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:35,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:56:35,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:36,028 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 10:56:36,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:36,148 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:36,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:36,149 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 10:56:36,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:37,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:37,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:56:37,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:56:37,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:56:37,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=614, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:56:37,059 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 33 states. [2019-08-05 10:56:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:39,034 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:56:39,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:56:39,034 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 60 [2019-08-05 10:56:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:39,035 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:56:39,035 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:56:39,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1400, Invalid=2506, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:56:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:56:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-08-05 10:56:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:56:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:56:39,039 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2019-08-05 10:56:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:39,039 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:56:39,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:56:39,040 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:56:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:56:39,040 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:39,040 INFO L399 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2019-08-05 10:56:39,041 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2019-08-05 10:56:39,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:39,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:56:39,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:39,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:56:39,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:39,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:39,212 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 10:56:39,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:39,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:39,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:56:39,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:56:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:56:39,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=472, Invalid=650, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:56:39,863 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 34 states. [2019-08-05 10:56:42,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:42,006 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:56:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:56:42,007 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 62 [2019-08-05 10:56:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:42,007 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:56:42,008 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:56:42,009 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 10:56:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:56:42,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-08-05 10:56:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:56:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:56:42,011 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2019-08-05 10:56:42,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:42,011 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:56:42,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:56:42,011 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:56:42,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:56:42,012 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:42,012 INFO L399 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2019-08-05 10:56:42,012 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:42,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:42,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2019-08-05 10:56:42,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:42,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:56:42,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:42,154 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 10:56:42,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:42,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:42,240 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 10:56:42,240 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:43,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:43,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:56:43,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:56:43,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:56:43,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=503, Invalid=687, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:56:43,250 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 35 states. [2019-08-05 10:56:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:45,413 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:56:45,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:56:45,413 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 64 [2019-08-05 10:56:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:45,414 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:56:45,415 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:56:45,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1589, Invalid=2833, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:56:45,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:56:45,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-08-05 10:56:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:56:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:56:45,418 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2019-08-05 10:56:45,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:45,418 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:56:45,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:56:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:56:45,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:56:45,419 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:45,419 INFO L399 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2019-08-05 10:56:45,419 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:45,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2019-08-05 10:56:45,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:45,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:56:45,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:45,559 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 10:56:45,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:45,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:45,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 10:56:45,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:46,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:46,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:56:46,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:56:46,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:56:46,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=535, Invalid=725, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:56:46,359 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2019-08-05 10:56:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:48,725 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:56:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:56:48,726 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2019-08-05 10:56:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:48,727 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:56:48,727 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:56:48,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1688, Invalid=3004, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:56:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:56:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-08-05 10:56:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:56:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:56:48,730 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2019-08-05 10:56:48,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:48,731 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:56:48,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:56:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:56:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:56:48,731 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:48,731 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2019-08-05 10:56:48,731 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2019-08-05 10:56:48,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:48,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:56:48,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:48,872 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 10:56:48,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:48,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:48,921 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 10:56:48,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:56:49,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:56:49,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:56:49,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:56:49,683 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 37 states. [2019-08-05 10:56:52,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:52,037 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:56:52,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:56:52,037 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 68 [2019-08-05 10:56:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:52,038 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:56:52,038 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:56:52,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1790, Invalid=3180, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:56:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:56:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-08-05 10:56:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:56:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:56:52,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2019-08-05 10:56:52,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:52,041 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:56:52,041 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:56:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:56:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:56:52,042 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:52,042 INFO L399 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2019-08-05 10:56:52,042 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2019-08-05 10:56:52,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:52,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:56:52,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:52,193 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 10:56:52,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:52,316 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:52,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:52,316 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 10:56:52,317 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:53,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:53,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:56:53,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:56:53,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:56:53,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=804, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:56:53,155 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 38 states. [2019-08-05 10:56:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:55,557 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:56:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:56:55,557 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 70 [2019-08-05 10:56:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:55,558 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:56:55,558 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:56:55,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1895, Invalid=3361, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:56:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:56:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-08-05 10:56:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:56:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:56:55,561 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2019-08-05 10:56:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:55,562 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:56:55,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:56:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:56:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:56:55,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:55,563 INFO L399 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2019-08-05 10:56:55,563 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:55,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:55,563 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2019-08-05 10:56:55,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:55,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:56:55,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:55,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:56:55,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:55,838 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:55,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:55,839 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 10:56:55,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:56,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:56,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:56:56,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:56:56,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:56:56,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=845, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:56:56,784 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 39 states. [2019-08-05 10:56:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:59,395 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:56:59,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:56:59,395 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 72 [2019-08-05 10:56:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:59,396 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:56:59,397 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:56:59,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2003, Invalid=3547, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:56:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:56:59,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-08-05 10:56:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:56:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:56:59,400 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2019-08-05 10:56:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:59,400 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:56:59,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:56:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:56:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:56:59,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:59,401 INFO L399 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2019-08-05 10:56:59,402 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:59,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2019-08-05 10:56:59,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:59,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:56:59,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:59,566 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 10:56:59,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:56:59,694 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:56:59,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:56:59,696 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 10:56:59,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:56:59,957 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:57:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:01,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:01,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:57:01,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:57:01,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:57:01,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=887, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:57:01,620 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 40 states. [2019-08-05 10:57:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:04,336 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:57:04,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:57:04,337 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-08-05 10:57:04,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:04,338 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:57:04,338 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:57:04,339 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2114, Invalid=3738, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:57:04,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:57:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-08-05 10:57:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:57:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:57:04,341 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2019-08-05 10:57:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:04,342 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:57:04,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:57:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:57:04,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:57:04,342 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:04,342 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2019-08-05 10:57:04,342 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:04,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:04,343 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2019-08-05 10:57:04,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:04,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:57:04,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:04,488 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 10:57:04,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:04,616 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:57:04,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:04,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 10:57:04,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:04,743 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:57:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:06,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:06,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:57:06,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:57:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:57:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=930, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:57:06,117 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 41 states. [2019-08-05 10:57:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:08,950 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:57:08,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:57:08,951 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 76 [2019-08-05 10:57:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:08,952 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:57:08,952 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:57:08,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2228, Invalid=3934, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:57:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:57:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-08-05 10:57:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:57:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:57:08,955 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2019-08-05 10:57:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:08,956 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:57:08,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:57:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:57:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:57:08,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:08,957 INFO L399 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2019-08-05 10:57:08,957 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2019-08-05 10:57:08,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:09,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:57:09,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:09,116 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:57:09,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:09,219 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:57:09,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:09,219 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 10:57:09,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:10,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:10,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:57:10,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:57:10,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:57:10,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=974, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:57:10,203 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 42 states. [2019-08-05 10:57:13,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:13,203 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:57:13,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:57:13,204 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 78 [2019-08-05 10:57:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:13,205 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:57:13,205 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:57:13,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2345, Invalid=4135, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:57:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:57:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-08-05 10:57:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:57:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:57:13,209 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2019-08-05 10:57:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:13,209 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:57:13,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:57:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:57:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:57:13,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:13,210 INFO L399 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2019-08-05 10:57:13,210 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:13,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:13,210 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2019-08-05 10:57:13,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:13,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:57:13,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:13,371 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 10:57:13,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:13,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:13,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 10:57:13,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:14,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:14,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:14,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:57:14,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:57:14,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:57:14,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=1019, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:57:14,462 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 43 states. [2019-08-05 10:57:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:17,448 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:57:17,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:57:17,448 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 80 [2019-08-05 10:57:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:17,449 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:57:17,449 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:57:17,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 893 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2465, Invalid=4341, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:57:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:57:17,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-08-05 10:57:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:57:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:57:17,451 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2019-08-05 10:57:17,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:17,451 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:57:17,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:57:17,451 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:57:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:57:17,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:17,451 INFO L399 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2019-08-05 10:57:17,452 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:17,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:17,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2019-08-05 10:57:17,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:17,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:57:17,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:17,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 10:57:17,590 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:17,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:17,603 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 10:57:17,603 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:18,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:18,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:18,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:57:18,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:57:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:57:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=827, Invalid=1065, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:57:18,801 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 44 states. [2019-08-05 10:57:21,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:21,809 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:57:21,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:57:21,809 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 82 [2019-08-05 10:57:21,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:21,810 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:57:21,810 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:57:21,811 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2588, Invalid=4552, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:57:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:57:21,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-08-05 10:57:21,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:57:21,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:57:21,814 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2019-08-05 10:57:21,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:21,814 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:57:21,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:57:21,814 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:57:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:57:21,815 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:21,815 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2019-08-05 10:57:21,815 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:21,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:21,815 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2019-08-05 10:57:21,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:21,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:57:21,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:21,970 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 10:57:21,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:22,050 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:22,051 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 10:57:22,051 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:23,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:23,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:57:23,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:57:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:57:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=868, Invalid=1112, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:57:23,327 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 45 states. [2019-08-05 10:57:26,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:26,464 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:57:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:57:26,465 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 84 [2019-08-05 10:57:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:26,466 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:57:26,466 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:57:26,466 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2714, Invalid=4768, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:57:26,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:57:26,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-08-05 10:57:26,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:57:26,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:57:26,469 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2019-08-05 10:57:26,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:26,469 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:57:26,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:57:26,470 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:57:26,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:57:26,470 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:26,470 INFO L399 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2019-08-05 10:57:26,470 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:26,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:26,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2019-08-05 10:57:26,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:26,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 901 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:57:26,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:26,646 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 10:57:26,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:26,759 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:57:26,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:26,761 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 10:57:26,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:26,885 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:57:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:28,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:28,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:57:28,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:57:28,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:57:28,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=1160, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:57:28,701 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 46 states. [2019-08-05 10:57:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:32,071 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:57:32,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:57:32,072 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 86 [2019-08-05 10:57:32,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:32,072 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:57:32,073 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:57:32,073 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1025 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2843, Invalid=4989, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:57:32,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:57:32,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-08-05 10:57:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:57:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:57:32,075 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2019-08-05 10:57:32,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:32,076 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:57:32,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:57:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:57:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:57:32,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:32,076 INFO L399 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2019-08-05 10:57:32,076 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:32,077 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2019-08-05 10:57:32,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:32,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:57:32,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:32,254 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 10:57:32,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:32,366 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:57:32,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:32,367 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 10:57:32,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:33,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:33,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:33,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:57:33,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:57:33,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:57:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=1209, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:57:33,832 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 47 states. [2019-08-05 10:57:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:37,208 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:57:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:57:37,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 88 [2019-08-05 10:57:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:37,210 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:57:37,210 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:57:37,211 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2975, Invalid=5215, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:57:37,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:57:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-08-05 10:57:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:57:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:57:37,213 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2019-08-05 10:57:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:37,213 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:57:37,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:57:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:57:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:57:37,214 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:37,214 INFO L399 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2019-08-05 10:57:37,214 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2019-08-05 10:57:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:37,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:57:37,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:37,363 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 10:57:37,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:37,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:37,397 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 10:57:37,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:39,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:39,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:57:39,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:57:39,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:57:39,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=997, Invalid=1259, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:57:39,001 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 48 states. [2019-08-05 10:57:42,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:42,459 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:57:42,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:57:42,459 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 90 [2019-08-05 10:57:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:42,460 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:57:42,460 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:57:42,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3110, Invalid=5446, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:57:42,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:57:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-08-05 10:57:42,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:57:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:57:42,464 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2019-08-05 10:57:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:42,464 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:57:42,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:57:42,464 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:57:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:57:42,465 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:42,465 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2019-08-05 10:57:42,465 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2019-08-05 10:57:42,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:42,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:57:42,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:42,626 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 10:57:42,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:42,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:42,651 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 10:57:42,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:44,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:44,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:57:44,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:57:44,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:57:44,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1042, Invalid=1310, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:57:44,405 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 49 states. [2019-08-05 10:57:48,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:48,005 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:57:48,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:57:48,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 92 [2019-08-05 10:57:48,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:48,006 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:57:48,006 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:57:48,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1166 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3248, Invalid=5682, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:57:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:57:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-08-05 10:57:48,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:57:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:57:48,010 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2019-08-05 10:57:48,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:48,010 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:57:48,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:57:48,010 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:57:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:57:48,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:48,011 INFO L399 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2019-08-05 10:57:48,011 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:48,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2019-08-05 10:57:48,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:48,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:57:48,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:48,204 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 10:57:48,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:48,334 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:57:48,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:48,335 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 10:57:48,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:49,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:49,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:57:49,713 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:57:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:57:49,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=1362, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:57:49,713 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 50 states. [2019-08-05 10:57:50,541 WARN L188 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2019-08-05 10:57:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:54,075 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:57:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:57:54,075 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 94 [2019-08-05 10:57:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:54,076 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:57:54,076 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:57:54,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3389, Invalid=5923, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:57:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:57:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-08-05 10:57:54,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:57:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:57:54,080 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2019-08-05 10:57:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:54,080 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:57:54,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:57:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:57:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:57:54,081 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:54,081 INFO L399 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2019-08-05 10:57:54,081 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2019-08-05 10:57:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:54,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:57:54,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:54,281 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 10:57:54,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:54,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:54,367 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 10:57:54,367 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:57:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:57:55,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:57:55,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:57:55,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:57:55,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:57:55,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1135, Invalid=1415, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:57:55,762 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 51 states. [2019-08-05 10:57:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:57:59,756 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:57:59,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:57:59,757 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 96 [2019-08-05 10:57:59,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:57:59,758 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:57:59,758 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:57:59,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3533, Invalid=6169, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:57:59,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:57:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-08-05 10:57:59,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:57:59,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:57:59,761 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2019-08-05 10:57:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:57:59,761 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:57:59,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:57:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:57:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:57:59,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:57:59,762 INFO L399 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2019-08-05 10:57:59,762 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:57:59,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:57:59,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2019-08-05 10:57:59,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:57:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:57:59,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:57:59,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:57:59,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:57:59,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:57:59,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:57:59,968 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 10:57:59,968 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:01,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:01,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:58:01,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:58:01,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:58:01,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1183, Invalid=1469, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:58:01,515 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 52 states. [2019-08-05 10:58:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:05,606 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:58:05,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:58:05,607 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 98 [2019-08-05 10:58:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:05,608 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:58:05,608 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:58:05,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1316 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=3680, Invalid=6420, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:58:05,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:58:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2019-08-05 10:58:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:58:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:58:05,612 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2019-08-05 10:58:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:05,612 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:58:05,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:58:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:58:05,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:58:05,613 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:05,613 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2019-08-05 10:58:05,613 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:05,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:05,613 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2019-08-05 10:58:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:05,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:58:05,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:05,769 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 10:58:05,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:05,888 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:58:05,889 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:05,890 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 10:58:05,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:06,310 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:58:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:08,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:08,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:58:08,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:58:08,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:58:08,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=1524, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:58:08,323 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 53 states. [2019-08-05 10:58:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:12,591 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:58:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:58:12,591 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 100 [2019-08-05 10:58:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:12,592 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:58:12,593 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:58:12,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3830, Invalid=6676, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:58:12,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:58:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-08-05 10:58:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:58:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:58:12,597 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2019-08-05 10:58:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:12,597 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:58:12,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:58:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:58:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:58:12,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:12,598 INFO L399 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2019-08-05 10:58:12,598 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:12,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2019-08-05 10:58:12,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:12,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:58:12,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:12,802 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 10:58:12,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:12,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:12,851 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 10:58:12,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:58:14,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:14,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:58:14,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:58:14,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:58:14,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1282, Invalid=1580, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:58:14,759 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 54 states. [2019-08-05 10:58:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:19,239 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:58:19,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:58:19,240 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 102 [2019-08-05 10:58:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:19,240 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:58:19,240 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:58:19,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3983, Invalid=6937, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:58:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:58:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-08-05 10:58:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:58:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:58:19,244 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2019-08-05 10:58:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:19,244 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:58:19,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:58:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:58:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:58:19,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:19,245 INFO L399 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2019-08-05 10:58:19,245 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:19,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:19,246 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2019-08-05 10:58:19,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:19,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 1090 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:58:19,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:19,417 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 10:58:19,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:19,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:19,438 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 10:58:19,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:21,036 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 10:58:21,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:21,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:58:21,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:58:21,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:58:21,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1333, Invalid=1637, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:58:21,038 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 55 states. [2019-08-05 10:58:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:25,578 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:58:25,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:58:25,578 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 104 [2019-08-05 10:58:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:25,580 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:58:25,580 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:58:25,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4139, Invalid=7203, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:58:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:58:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-08-05 10:58:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:58:25,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:58:25,582 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2019-08-05 10:58:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:25,583 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:58:25,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:58:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:58:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:58:25,584 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:25,584 INFO L399 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2019-08-05 10:58:25,584 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:25,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2019-08-05 10:58:25,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:25,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:58:25,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:25,758 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 10:58:25,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:25,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:25,790 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 10:58:25,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:27,424 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 10:58:27,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:27,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:58:27,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:58:27,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:58:27,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1385, Invalid=1695, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:58:27,425 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 56 states. [2019-08-05 10:58:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:32,153 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:58:32,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:58:32,154 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 106 [2019-08-05 10:58:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:32,155 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:58:32,155 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:58:32,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1530 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4298, Invalid=7474, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:58:32,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:58:32,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-08-05 10:58:32,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:58:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:58:32,159 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2019-08-05 10:58:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:32,159 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:58:32,159 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:58:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:58:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:58:32,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:32,160 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2019-08-05 10:58:32,160 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:32,161 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2019-08-05 10:58:32,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:32,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:58:32,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:32,457 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 10:58:32,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:32,584 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:58:32,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:32,585 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 10:58:32,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:34,936 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 10:58:34,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:34,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:58:34,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:58:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:58:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1438, Invalid=1754, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:58:34,937 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 57 states. [2019-08-05 10:58:39,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:39,825 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:58:39,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:58:39,826 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 108 [2019-08-05 10:58:39,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:39,827 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:58:39,827 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:58:39,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1586 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=4460, Invalid=7750, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:58:39,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:58:39,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-08-05 10:58:39,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:58:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:58:39,830 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2019-08-05 10:58:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:39,831 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:58:39,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:58:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:58:39,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:58:39,831 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:39,831 INFO L399 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2019-08-05 10:58:39,832 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:39,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:39,832 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2019-08-05 10:58:39,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:39,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1153 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:58:39,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:39,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:58:39,985 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:40,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:40,013 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 10:58:40,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:41,758 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 10:58:41,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:41,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:58:41,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:58:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:58:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=1814, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:58:41,759 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 58 states. [2019-08-05 10:58:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:46,619 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:58:46,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:58:46,620 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 110 [2019-08-05 10:58:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:46,621 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:58:46,621 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:58:46,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1643 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4625, Invalid=8031, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:58:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:58:46,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2019-08-05 10:58:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:58:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:58:46,624 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2019-08-05 10:58:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:46,625 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:58:46,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:58:46,625 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:58:46,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:58:46,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:46,626 INFO L399 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2019-08-05 10:58:46,626 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:46,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:46,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2019-08-05 10:58:46,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:46,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:58:46,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:46,797 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 10:58:46,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:46,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:46,816 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 10:58:46,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:48,582 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 10:58:48,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:48,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:58:48,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:58:48,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:58:48,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1547, Invalid=1875, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:58:48,583 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 59 states. [2019-08-05 10:58:53,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:58:53,688 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:58:53,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:58:53,688 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 112 [2019-08-05 10:58:53,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:58:53,690 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:58:53,690 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:58:53,691 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 10:58:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:58:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-08-05 10:58:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:58:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:58:53,694 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2019-08-05 10:58:53,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:58:53,694 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:58:53,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:58:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:58:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:58:53,695 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:58:53,695 INFO L399 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2019-08-05 10:58:53,695 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:58:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:58:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2019-08-05 10:58:53,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:58:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:58:53,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:58:53,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:58:53,893 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 10:58:53,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:58:53,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:58:53,910 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 10:58:53,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:58:56,079 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 10:58:56,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:58:56,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:58:56,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:58:56,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:58:56,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=1937, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:58:56,081 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 60 states. [2019-08-05 10:59:01,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:01,352 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:59:01,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:59:01,353 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 114 [2019-08-05 10:59:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:01,354 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:59:01,355 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:59:01,356 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=4964, Invalid=8608, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:59:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:59:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-08-05 10:59:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:59:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:59:01,358 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2019-08-05 10:59:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:01,358 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:59:01,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:59:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:59:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:59:01,359 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:01,359 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2019-08-05 10:59:01,359 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:01,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2019-08-05 10:59:01,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:01,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:59:01,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:01,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 10:59:01,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:01,608 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:01,608 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 10:59:01,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:59:03,505 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 10:59:03,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:03,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:59:03,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:59:03,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:59:03,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1660, Invalid=2000, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:59:03,506 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 61 states. [2019-08-05 10:59:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:08,897 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:59:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:59:08,897 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 116 [2019-08-05 10:59:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:08,898 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:59:08,899 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:59:08,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5138, Invalid=8904, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:59:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:59:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-08-05 10:59:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:59:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:59:08,902 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2019-08-05 10:59:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:08,903 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:59:08,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:59:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:59:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:59:08,904 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:08,904 INFO L399 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2019-08-05 10:59:08,904 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:08,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:08,904 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2019-08-05 10:59:08,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:09,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:59:09,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:09,112 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 10:59:09,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:09,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:09,139 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 10:59:09,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:59:11,397 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 10:59:11,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:11,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:59:11,398 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:59:11,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:59:11,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1718, Invalid=2064, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:59:11,398 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 62 states. [2019-08-05 10:59:16,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:16,920 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:59:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:59:16,921 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 118 [2019-08-05 10:59:16,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:16,922 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:59:16,922 INFO L226 Difference]: Without dead ends: 122 [2019-08-05 10:59:16,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5315, Invalid=9205, Unknown=0, NotChecked=0, Total=14520 [2019-08-05 10:59:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-08-05 10:59:16,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-08-05 10:59:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:59:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:59:16,926 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2019-08-05 10:59:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:16,926 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:59:16,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:59:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:59:16,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:59:16,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:16,927 INFO L399 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2019-08-05 10:59:16,927 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:16,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:16,928 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2019-08-05 10:59:16,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:17,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:59:17,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:17,138 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 10:59:17,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:17,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:17,154 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 10:59:17,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:59:19,114 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 10:59:19,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:19,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:59:19,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:59:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:59:19,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1777, Invalid=2129, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:59:19,115 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 63 states. [2019-08-05 10:59:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:24,898 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:59:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:59:24,898 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 120 [2019-08-05 10:59:24,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:24,899 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:59:24,899 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:59:24,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1943 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5495, Invalid=9511, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:59:24,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:59:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2019-08-05 10:59:24,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-08-05 10:59:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2019-08-05 10:59:24,901 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2019-08-05 10:59:24,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:24,901 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2019-08-05 10:59:24,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:59:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2019-08-05 10:59:24,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-08-05 10:59:24,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:24,902 INFO L399 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2019-08-05 10:59:24,903 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:24,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:24,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2019-08-05 10:59:24,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:25,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:59:25,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:25,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:59:25,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:25,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:25,149 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 10:59:25,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:59:27,503 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 10:59:27,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:59:27,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:59:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:59:27,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1837, Invalid=2195, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:59:27,505 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 64 states. [2019-08-05 10:59:33,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:33,380 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-08-05 10:59:33,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:59:33,381 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 122 [2019-08-05 10:59:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:33,382 INFO L225 Difference]: With dead ends: 126 [2019-08-05 10:59:33,382 INFO L226 Difference]: Without dead ends: 126 [2019-08-05 10:59:33,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2006 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=5678, Invalid=9822, Unknown=0, NotChecked=0, Total=15500 [2019-08-05 10:59:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-08-05 10:59:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-08-05 10:59:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-08-05 10:59:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2019-08-05 10:59:33,385 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2019-08-05 10:59:33,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:33,386 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2019-08-05 10:59:33,386 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:59:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2019-08-05 10:59:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-08-05 10:59:33,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:33,387 INFO L399 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2019-08-05 10:59:33,387 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:33,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2019-08-05 10:59:33,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:33,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 1300 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:59:33,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:33,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 10:59:33,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:33,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:33,651 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 10:59:33,651 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:59:36,196 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 10:59:36,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:36,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:59:36,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:59:36,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:59:36,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1898, Invalid=2262, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:59:36,197 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 65 states. [2019-08-05 10:59:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:42,174 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-08-05 10:59:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:59:42,174 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 124 [2019-08-05 10:59:42,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:42,175 INFO L225 Difference]: With dead ends: 128 [2019-08-05 10:59:42,176 INFO L226 Difference]: Without dead ends: 128 [2019-08-05 10:59:42,177 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=5864, Invalid=10138, Unknown=0, NotChecked=0, Total=16002 [2019-08-05 10:59:42,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-08-05 10:59:42,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-08-05 10:59:42,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-08-05 10:59:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-08-05 10:59:42,180 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2019-08-05 10:59:42,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:42,180 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-08-05 10:59:42,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:59:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-08-05 10:59:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-08-05 10:59:42,180 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:42,181 INFO L399 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2019-08-05 10:59:42,181 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2019-08-05 10:59:42,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:42,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:59:42,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:42,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-05 10:59:42,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:42,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:42,493 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 10:59:42,493 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:59:44,642 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 10:59:44,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:44,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:59:44,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:59:44,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:59:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1960, Invalid=2330, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:59:44,644 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 66 states. [2019-08-05 10:59:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:59:50,779 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-08-05 10:59:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:59:50,779 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 126 [2019-08-05 10:59:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:59:50,780 INFO L225 Difference]: With dead ends: 130 [2019-08-05 10:59:50,780 INFO L226 Difference]: Without dead ends: 130 [2019-08-05 10:59:50,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2135 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=6053, Invalid=10459, Unknown=0, NotChecked=0, Total=16512 [2019-08-05 10:59:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-08-05 10:59:50,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2019-08-05 10:59:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-08-05 10:59:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2019-08-05 10:59:50,782 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2019-08-05 10:59:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:59:50,782 INFO L475 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2019-08-05 10:59:50,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:59:50,783 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2019-08-05 10:59:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-08-05 10:59:50,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:59:50,783 INFO L399 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2019-08-05 10:59:50,783 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:59:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:59:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2019-08-05 10:59:50,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:59:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:59:50,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 1342 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:59:50,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:59:51,028 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 10:59:51,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-05 10:59:51,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-05 10:59:51,111 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 10:59:51,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2019-08-05 10:59:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:59:53,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:59:53,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:59:53,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:59:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:59:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2023, Invalid=2399, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:59:53,527 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 67 states. Received shutdown request... [2019-08-05 10:59:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:59:55,251 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:59:55,256 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:59:55,256 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:59:55 BoogieIcfgContainer [2019-08-05 10:59:55,256 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:59:55,257 INFO L168 Benchmark]: Toolchain (without parser) took 245178.83 ms. Allocated memory was 143.1 MB in the beginning and 842.0 MB in the end (delta: 698.9 MB). Free memory was 112.5 MB in the beginning and 391.5 MB in the end (delta: -279.0 MB). Peak memory consumption was 419.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:55,258 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 143.1 MB. Free memory was 113.9 MB in the beginning and 113.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:59:55,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.10 ms. Allocated memory is still 143.1 MB. Free memory was 112.5 MB in the beginning and 110.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:55,258 INFO L168 Benchmark]: Boogie Preprocessor took 29.33 ms. Allocated memory is still 143.1 MB. Free memory was 110.7 MB in the beginning and 109.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:55,259 INFO L168 Benchmark]: RCFGBuilder took 360.88 ms. Allocated memory is still 143.1 MB. Free memory was 109.5 MB in the beginning and 98.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:55,259 INFO L168 Benchmark]: TraceAbstraction took 244740.53 ms. Allocated memory was 143.1 MB in the beginning and 842.0 MB in the end (delta: 698.9 MB). Free memory was 98.2 MB in the beginning and 391.5 MB in the end (delta: -293.3 MB). Peak memory consumption was 405.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:59:55,261 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.23 ms. Allocated memory is still 143.1 MB. Free memory was 113.9 MB in the beginning and 113.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.10 ms. Allocated memory is still 143.1 MB. Free memory was 112.5 MB in the beginning and 110.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.33 ms. Allocated memory is still 143.1 MB. Free memory was 110.7 MB in the beginning and 109.5 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 360.88 ms. Allocated memory is still 143.1 MB. Free memory was 109.5 MB in the beginning and 98.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 244740.53 ms. Allocated memory was 143.1 MB in the beginning and 842.0 MB in the end (delta: 698.9 MB). Free memory was 98.2 MB in the beginning and 391.5 MB in the end (delta: -293.3 MB). Peak memory consumption was 405.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 77]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 77). Cancelled while BasicCegarLoop was constructing difference of abstraction (129states) and FLOYD_HOARE automaton (currently 31 states, 67 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 95 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 244.6s OverallTime, 63 OverallIterations, 63 TraceHistogramMax, 162.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 189 SDtfs, 63 SDslu, 474 SDs, 0 SdLazy, 5285 SolverSat, 7730 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6136 GetRequests, 1955 SyntacticMatches, 0 SemanticMatches, 4180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47851 ImplicationChecksByTransitivity, 210.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=129occurred in iteration=62, 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, 62 MinimizatonAttempts, 62 StatesRemovedByMinimization, 62 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 75.6s InterpolantComputationTime, 4158 NumberOfCodeBlocks, 4158 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 4095 ConstructedInterpolants, 61 QuantifiedInterpolants, 4247079 SizeOfPredicates, 754 NumberOfNonLiveVariables, 43533 ConjunctsInSsa, 2962 ConjunctsInUnsatCore, 63 InterpolantComputations, 1 PerfectInterpolantSequences, 0/83328 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown