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/real-life/threadpooling_product_WithProcedures.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-04 21:21:39,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-04 21:21:39,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-04 21:21:40,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-04 21:21:40,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-04 21:21:40,006 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-04 21:21:40,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-04 21:21:40,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-04 21:21:40,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-04 21:21:40,015 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-04 21:21:40,016 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-04 21:21:40,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-04 21:21:40,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-04 21:21:40,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-04 21:21:40,020 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-04 21:21:40,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-04 21:21:40,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-04 21:21:40,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-04 21:21:40,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-04 21:21:40,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-04 21:21:40,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-04 21:21:40,041 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-04 21:21:40,042 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-04 21:21:40,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-04 21:21:40,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-04 21:21:40,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-04 21:21:40,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-04 21:21:40,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-04 21:21:40,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-04 21:21:40,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-04 21:21:40,052 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-04 21:21:40,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-04 21:21:40,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-04 21:21:40,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-04 21:21:40,058 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-04 21:21:40,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-04 21:21:40,059 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-04 21:21:40,059 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-04 21:21:40,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-04 21:21:40,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-04 21:21:40,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-04 21:21:40,094 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-04 21:21:40,108 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-04 21:21:40,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-04 21:21:40,114 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-04 21:21:40,115 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-04 21:21:40,115 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl [2019-08-04 21:21:40,116 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/threadpooling_product_WithProcedures.bpl' [2019-08-04 21:21:40,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-04 21:21:40,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-04 21:21:40,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:40,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-04 21:21:40,155 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-04 21:21:40,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,184 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,193 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-04 21:21:40,194 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-04 21:21:40,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-04 21:21:40,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-04 21:21:40,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,222 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/1) ... [2019-08-04 21:21:40,225 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-04 21:21:40,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-04 21:21:40,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-04 21:21:40,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-04 21:21:40,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (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-04 21:21:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure l0l1 [2019-08-04 21:21:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l1 [2019-08-04 21:21:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure l1l0 [2019-08-04 21:21:40,303 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l0 [2019-08-04 21:21:40,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-04 21:21:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-04 21:21:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure l0l0 [2019-08-04 21:21:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure l0l0 [2019-08-04 21:21:40,304 INFO L130 BoogieDeclarations]: Found specification of procedure l1l1 [2019-08-04 21:21:40,304 INFO L138 BoogieDeclarations]: Found implementation of procedure l1l1 [2019-08-04 21:21:40,843 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-04 21:21:40,843 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-04 21:21:40,845 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:40 BoogieIcfgContainer [2019-08-04 21:21:40,845 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-04 21:21:40,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-04 21:21:40,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-04 21:21:40,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-04 21:21:40,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.08 09:21:40" (1/2) ... [2019-08-04 21:21:40,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39246354 and model type threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:21:40, skipping insertion in model container [2019-08-04 21:21:40,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:21:40" (2/2) ... [2019-08-04 21:21:40,853 INFO L109 eAbstractionObserver]: Analyzing ICFG threadpooling_product_WithProcedures.bpl [2019-08-04 21:21:40,862 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-04 21:21:40,872 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-08-04 21:21:40,888 INFO L252 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-08-04 21:21:40,915 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-04 21:21:40,916 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-04 21:21:40,916 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-04 21:21:40,916 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-04 21:21:40,916 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-04 21:21:40,917 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-04 21:21:40,917 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-04 21:21:40,917 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-04 21:21:40,917 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-04 21:21:40,934 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-08-04 21:21:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:40,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:40,945 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:40,948 INFO L418 AbstractCegarLoop]: === Iteration 1 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:40,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:40,954 INFO L82 PathProgramCache]: Analyzing trace with hash 441427311, now seen corresponding path program 1 times [2019-08-04 21:21:41,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:41,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:21:41,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:41,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:41,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:41,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:41,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:41,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:41,315 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 5 states. [2019-08-04 21:21:42,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:42,171 INFO L93 Difference]: Finished difference Result 86 states and 122 transitions. [2019-08-04 21:21:42,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:42,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-04 21:21:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:42,184 INFO L225 Difference]: With dead ends: 86 [2019-08-04 21:21:42,184 INFO L226 Difference]: Without dead ends: 86 [2019-08-04 21:21:42,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04 21:21:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-04 21:21:42,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2019-08-04 21:21:42,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-04 21:21:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 71 transitions. [2019-08-04 21:21:42,232 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 71 transitions. Word has length 7 [2019-08-04 21:21:42,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:42,233 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-08-04 21:21:42,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2019-08-04 21:21:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-04 21:21:42,235 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:42,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:42,236 INFO L418 AbstractCegarLoop]: === Iteration 2 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:42,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash 450963827, now seen corresponding path program 1 times [2019-08-04 21:21:42,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:42,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-04 21:21:42,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:42,588 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-04 21:21:42,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:42,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:42,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-04 21:21:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-04 21:21:42,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:42,591 INFO L87 Difference]: Start difference. First operand 52 states and 71 transitions. Second operand 5 states. [2019-08-04 21:21:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:43,190 INFO L93 Difference]: Finished difference Result 99 states and 141 transitions. [2019-08-04 21:21:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:43,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-08-04 21:21:43,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:43,193 INFO L225 Difference]: With dead ends: 99 [2019-08-04 21:21:43,193 INFO L226 Difference]: Without dead ends: 99 [2019-08-04 21:21:43,194 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04 21:21:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-04 21:21:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 65. [2019-08-04 21:21:43,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-04 21:21:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2019-08-04 21:21:43,204 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 7 [2019-08-04 21:21:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:43,205 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2019-08-04 21:21:43,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-04 21:21:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2019-08-04 21:21:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:43,206 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:43,206 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:43,207 INFO L418 AbstractCegarLoop]: === Iteration 3 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:43,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:43,207 INFO L82 PathProgramCache]: Analyzing trace with hash -617229569, now seen corresponding path program 1 times [2019-08-04 21:21:43,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:43,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:21:43,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:43,476 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-04 21:21:43,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:43,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:43,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:43,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:43,478 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand 6 states. [2019-08-04 21:21:44,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:44,212 INFO L93 Difference]: Finished difference Result 119 states and 169 transitions. [2019-08-04 21:21:44,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:44,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-04 21:21:44,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:44,216 INFO L225 Difference]: With dead ends: 119 [2019-08-04 21:21:44,217 INFO L226 Difference]: Without dead ends: 119 [2019-08-04 21:21:44,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:44,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-04 21:21:44,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 81. [2019-08-04 21:21:44,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-04 21:21:44,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2019-08-04 21:21:44,228 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 10 [2019-08-04 21:21:44,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:44,228 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2019-08-04 21:21:44,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2019-08-04 21:21:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:44,229 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:44,230 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:44,230 INFO L418 AbstractCegarLoop]: === Iteration 4 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:44,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2116843270, now seen corresponding path program 1 times [2019-08-04 21:21:44,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:44,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-04 21:21:44,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:44,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:44,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:21:44,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:21:44,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:21:44,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:21:44,332 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 4 states. [2019-08-04 21:21:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:44,468 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2019-08-04 21:21:44,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:21:44,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-08-04 21:21:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:44,471 INFO L225 Difference]: With dead ends: 77 [2019-08-04 21:21:44,471 INFO L226 Difference]: Without dead ends: 77 [2019-08-04 21:21:44,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:21:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-04 21:21:44,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-04 21:21:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-04 21:21:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 104 transitions. [2019-08-04 21:21:44,479 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 104 transitions. Word has length 10 [2019-08-04 21:21:44,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:44,479 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 104 transitions. [2019-08-04 21:21:44,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:21:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 104 transitions. [2019-08-04 21:21:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-04 21:21:44,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:44,481 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:44,481 INFO L418 AbstractCegarLoop]: === Iteration 5 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash -3707729, now seen corresponding path program 1 times [2019-08-04 21:21:44,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:44,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-04 21:21:44,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:44,747 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-04 21:21:44,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:21:44,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-08-04 21:21:44,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-04 21:21:44,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-04 21:21:44,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-04 21:21:44,749 INFO L87 Difference]: Start difference. First operand 77 states and 104 transitions. Second operand 6 states. [2019-08-04 21:21:45,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:45,037 INFO L93 Difference]: Finished difference Result 129 states and 176 transitions. [2019-08-04 21:21:45,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-04 21:21:45,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-08-04 21:21:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:45,041 INFO L225 Difference]: With dead ends: 129 [2019-08-04 21:21:45,041 INFO L226 Difference]: Without dead ends: 129 [2019-08-04 21:21:45,042 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:21:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-08-04 21:21:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2019-08-04 21:21:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-04 21:21:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2019-08-04 21:21:45,052 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 10 [2019-08-04 21:21:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:45,052 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2019-08-04 21:21:45,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-04 21:21:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2019-08-04 21:21:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:45,054 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:45,054 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:45,054 INFO L418 AbstractCegarLoop]: === Iteration 6 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash -700443962, now seen corresponding path program 1 times [2019-08-04 21:21:45,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:45,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:45,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:45,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:45,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:45,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:45,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:45,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:45,415 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 7 states. [2019-08-04 21:21:45,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:45,964 INFO L93 Difference]: Finished difference Result 177 states and 245 transitions. [2019-08-04 21:21:45,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:45,968 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:21:45,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:45,978 INFO L225 Difference]: With dead ends: 177 [2019-08-04 21:21:45,978 INFO L226 Difference]: Without dead ends: 177 [2019-08-04 21:21:45,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-08-04 21:21:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 132. [2019-08-04 21:21:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-04 21:21:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2019-08-04 21:21:45,992 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 14 [2019-08-04 21:21:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:45,993 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2019-08-04 21:21:45,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2019-08-04 21:21:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:45,994 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:45,994 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:45,995 INFO L418 AbstractCegarLoop]: === Iteration 7 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:45,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:45,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1055436978, now seen corresponding path program 1 times [2019-08-04 21:21:45,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:46,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:46,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:46,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:46,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:46,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:46,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:46,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:46,234 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand 7 states. [2019-08-04 21:21:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:46,866 INFO L93 Difference]: Finished difference Result 225 states and 316 transitions. [2019-08-04 21:21:46,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:46,867 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:21:46,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:46,868 INFO L225 Difference]: With dead ends: 225 [2019-08-04 21:21:46,869 INFO L226 Difference]: Without dead ends: 225 [2019-08-04 21:21:46,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:46,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-08-04 21:21:46,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 159. [2019-08-04 21:21:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-08-04 21:21:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 224 transitions. [2019-08-04 21:21:46,880 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 224 transitions. Word has length 14 [2019-08-04 21:21:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:46,881 INFO L475 AbstractCegarLoop]: Abstraction has 159 states and 224 transitions. [2019-08-04 21:21:46,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 224 transitions. [2019-08-04 21:21:46,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:46,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:46,883 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:46,883 INFO L418 AbstractCegarLoop]: === Iteration 8 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:46,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:46,884 INFO L82 PathProgramCache]: Analyzing trace with hash -680785956, now seen corresponding path program 1 times [2019-08-04 21:21:46,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:46,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:46,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:47,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:47,011 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:47,013 INFO L87 Difference]: Start difference. First operand 159 states and 224 transitions. Second operand 7 states. [2019-08-04 21:21:47,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:47,598 INFO L93 Difference]: Finished difference Result 298 states and 420 transitions. [2019-08-04 21:21:47,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:47,599 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:21:47,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:47,601 INFO L225 Difference]: With dead ends: 298 [2019-08-04 21:21:47,601 INFO L226 Difference]: Without dead ends: 298 [2019-08-04 21:21:47,602 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:47,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-08-04 21:21:47,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 189. [2019-08-04 21:21:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-08-04 21:21:47,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2019-08-04 21:21:47,627 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 14 [2019-08-04 21:21:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:47,627 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2019-08-04 21:21:47,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2019-08-04 21:21:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:47,629 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:47,629 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:47,629 INFO L418 AbstractCegarLoop]: === Iteration 9 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash -718236170, now seen corresponding path program 1 times [2019-08-04 21:21:47,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:47,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-04 21:21:47,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:47,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:47,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:47,762 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:47,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:47,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:47,762 INFO L87 Difference]: Start difference. First operand 189 states and 270 transitions. Second operand 7 states. [2019-08-04 21:21:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:48,620 INFO L93 Difference]: Finished difference Result 431 states and 632 transitions. [2019-08-04 21:21:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:48,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:21:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:48,629 INFO L225 Difference]: With dead ends: 431 [2019-08-04 21:21:48,629 INFO L226 Difference]: Without dead ends: 431 [2019-08-04 21:21:48,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:48,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-08-04 21:21:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 288. [2019-08-04 21:21:48,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-08-04 21:21:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 422 transitions. [2019-08-04 21:21:48,656 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 422 transitions. Word has length 14 [2019-08-04 21:21:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:48,656 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 422 transitions. [2019-08-04 21:21:48,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 422 transitions. [2019-08-04 21:21:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:48,659 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:48,659 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:48,660 INFO L418 AbstractCegarLoop]: === Iteration 10 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:48,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:48,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1073229186, now seen corresponding path program 1 times [2019-08-04 21:21:48,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:48,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:48,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:48,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:48,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:48,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:48,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:48,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:48,799 INFO L87 Difference]: Start difference. First operand 288 states and 422 transitions. Second operand 7 states. [2019-08-04 21:21:49,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:49,305 INFO L93 Difference]: Finished difference Result 546 states and 804 transitions. [2019-08-04 21:21:49,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:49,312 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:21:49,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:49,315 INFO L225 Difference]: With dead ends: 546 [2019-08-04 21:21:49,315 INFO L226 Difference]: Without dead ends: 546 [2019-08-04 21:21:49,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-08-04 21:21:49,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 342. [2019-08-04 21:21:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-08-04 21:21:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 503 transitions. [2019-08-04 21:21:49,329 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 503 transitions. Word has length 14 [2019-08-04 21:21:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:49,329 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 503 transitions. [2019-08-04 21:21:49,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 503 transitions. [2019-08-04 21:21:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-04 21:21:49,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:49,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:49,331 INFO L418 AbstractCegarLoop]: === Iteration 11 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1801721143, now seen corresponding path program 1 times [2019-08-04 21:21:49,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:49,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:49,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:49,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:49,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-04 21:21:49,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:49,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:49,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:49,654 INFO L87 Difference]: Start difference. First operand 342 states and 503 transitions. Second operand 7 states. [2019-08-04 21:21:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:50,537 INFO L93 Difference]: Finished difference Result 789 states and 1158 transitions. [2019-08-04 21:21:50,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-04 21:21:50,538 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-08-04 21:21:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:50,542 INFO L225 Difference]: With dead ends: 789 [2019-08-04 21:21:50,543 INFO L226 Difference]: Without dead ends: 789 [2019-08-04 21:21:50,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:50,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-08-04 21:21:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 495. [2019-08-04 21:21:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2019-08-04 21:21:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 734 transitions. [2019-08-04 21:21:50,562 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 734 transitions. Word has length 14 [2019-08-04 21:21:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:50,562 INFO L475 AbstractCegarLoop]: Abstraction has 495 states and 734 transitions. [2019-08-04 21:21:50,562 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 734 transitions. [2019-08-04 21:21:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:50,563 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:50,564 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:50,564 INFO L418 AbstractCegarLoop]: === Iteration 12 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:50,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:50,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1090415723, now seen corresponding path program 1 times [2019-08-04 21:21:50,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:50,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:50,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:50,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:50,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:50,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:50,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:50,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:50,873 INFO L87 Difference]: Start difference. First operand 495 states and 734 transitions. Second operand 7 states. [2019-08-04 21:21:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:52,304 INFO L93 Difference]: Finished difference Result 1041 states and 1552 transitions. [2019-08-04 21:21:52,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:21:52,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:52,310 INFO L225 Difference]: With dead ends: 1041 [2019-08-04 21:21:52,310 INFO L226 Difference]: Without dead ends: 1041 [2019-08-04 21:21:52,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:52,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-08-04 21:21:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 693. [2019-08-04 21:21:52,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2019-08-04 21:21:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1050 transitions. [2019-08-04 21:21:52,337 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1050 transitions. Word has length 18 [2019-08-04 21:21:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:52,337 INFO L475 AbstractCegarLoop]: Abstraction has 693 states and 1050 transitions. [2019-08-04 21:21:52,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1050 transitions. [2019-08-04 21:21:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:52,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:52,339 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:52,340 INFO L418 AbstractCegarLoop]: === Iteration 13 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1151545451, now seen corresponding path program 2 times [2019-08-04 21:21:52,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:52,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:52,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:52,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:52,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:52,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:52,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:52,624 INFO L87 Difference]: Start difference. First operand 693 states and 1050 transitions. Second operand 7 states. [2019-08-04 21:21:53,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:53,491 INFO L93 Difference]: Finished difference Result 996 states and 1494 transitions. [2019-08-04 21:21:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:53,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:53,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:53,500 INFO L225 Difference]: With dead ends: 996 [2019-08-04 21:21:53,500 INFO L226 Difference]: Without dead ends: 996 [2019-08-04 21:21:53,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2019-08-04 21:21:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 717. [2019-08-04 21:21:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2019-08-04 21:21:53,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 1088 transitions. [2019-08-04 21:21:53,526 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 1088 transitions. Word has length 18 [2019-08-04 21:21:53,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:53,527 INFO L475 AbstractCegarLoop]: Abstraction has 717 states and 1088 transitions. [2019-08-04 21:21:53,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 1088 transitions. [2019-08-04 21:21:53,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:53,529 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:53,529 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:53,529 INFO L418 AbstractCegarLoop]: === Iteration 14 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:53,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:53,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1506538467, now seen corresponding path program 2 times [2019-08-04 21:21:53,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:53,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:53,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:54,058 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-04 21:21:54,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:54,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:54,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:54,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:54,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:54,061 INFO L87 Difference]: Start difference. First operand 717 states and 1088 transitions. Second operand 7 states. [2019-08-04 21:21:54,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:54,953 INFO L93 Difference]: Finished difference Result 1044 states and 1565 transitions. [2019-08-04 21:21:54,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:54,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:54,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:54,959 INFO L225 Difference]: With dead ends: 1044 [2019-08-04 21:21:54,959 INFO L226 Difference]: Without dead ends: 1044 [2019-08-04 21:21:54,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-08-04 21:21:54,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 783. [2019-08-04 21:21:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-08-04 21:21:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1186 transitions. [2019-08-04 21:21:54,982 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1186 transitions. Word has length 18 [2019-08-04 21:21:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:54,982 INFO L475 AbstractCegarLoop]: Abstraction has 783 states and 1186 transitions. [2019-08-04 21:21:54,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:54,983 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1186 transitions. [2019-08-04 21:21:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:54,984 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:54,984 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:54,984 INFO L418 AbstractCegarLoop]: === Iteration 15 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:54,985 INFO L82 PathProgramCache]: Analyzing trace with hash -594057576, now seen corresponding path program 1 times [2019-08-04 21:21:54,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:55,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:55,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:55,129 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-04 21:21:55,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:55,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:55,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:55,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:55,131 INFO L87 Difference]: Start difference. First operand 783 states and 1186 transitions. Second operand 7 states. [2019-08-04 21:21:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:55,485 INFO L93 Difference]: Finished difference Result 1030 states and 1540 transitions. [2019-08-04 21:21:55,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:55,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:55,490 INFO L225 Difference]: With dead ends: 1030 [2019-08-04 21:21:55,490 INFO L226 Difference]: Without dead ends: 1030 [2019-08-04 21:21:55,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-08-04 21:21:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 755. [2019-08-04 21:21:55,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2019-08-04 21:21:55,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1140 transitions. [2019-08-04 21:21:55,511 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1140 transitions. Word has length 18 [2019-08-04 21:21:55,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:55,511 INFO L475 AbstractCegarLoop]: Abstraction has 755 states and 1140 transitions. [2019-08-04 21:21:55,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:55,512 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1140 transitions. [2019-08-04 21:21:55,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:55,513 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:55,513 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:55,513 INFO L418 AbstractCegarLoop]: === Iteration 16 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:55,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:55,514 INFO L82 PathProgramCache]: Analyzing trace with hash -949050592, now seen corresponding path program 1 times [2019-08-04 21:21:55,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:55,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:55,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:55,949 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-04 21:21:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:55,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:55,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:55,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:55,950 INFO L87 Difference]: Start difference. First operand 755 states and 1140 transitions. Second operand 7 states. [2019-08-04 21:21:56,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:56,392 INFO L93 Difference]: Finished difference Result 1116 states and 1666 transitions. [2019-08-04 21:21:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:56,396 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:56,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:56,401 INFO L225 Difference]: With dead ends: 1116 [2019-08-04 21:21:56,401 INFO L226 Difference]: Without dead ends: 1116 [2019-08-04 21:21:56,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-08-04 21:21:56,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 713. [2019-08-04 21:21:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-08-04 21:21:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1072 transitions. [2019-08-04 21:21:56,426 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1072 transitions. Word has length 18 [2019-08-04 21:21:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:56,426 INFO L475 AbstractCegarLoop]: Abstraction has 713 states and 1072 transitions. [2019-08-04 21:21:56,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1072 transitions. [2019-08-04 21:21:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:56,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:56,428 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:56,428 INFO L418 AbstractCegarLoop]: === Iteration 17 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash -574399570, now seen corresponding path program 1 times [2019-08-04 21:21:56,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:56,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:56,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:56,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:56,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:56,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:56,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:56,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:56,554 INFO L87 Difference]: Start difference. First operand 713 states and 1072 transitions. Second operand 7 states. [2019-08-04 21:21:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:56,976 INFO L93 Difference]: Finished difference Result 1003 states and 1496 transitions. [2019-08-04 21:21:56,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:21:56,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:56,980 INFO L225 Difference]: With dead ends: 1003 [2019-08-04 21:21:56,980 INFO L226 Difference]: Without dead ends: 1003 [2019-08-04 21:21:56,980 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:21:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-08-04 21:21:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 711. [2019-08-04 21:21:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-08-04 21:21:57,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1064 transitions. [2019-08-04 21:21:57,015 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1064 transitions. Word has length 18 [2019-08-04 21:21:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:57,015 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 1064 transitions. [2019-08-04 21:21:57,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1064 transitions. [2019-08-04 21:21:57,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:57,017 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:57,017 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:57,017 INFO L418 AbstractCegarLoop]: === Iteration 18 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:57,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash 331727805, now seen corresponding path program 2 times [2019-08-04 21:21:57,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:57,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:57,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:57,166 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-04 21:21:57,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:57,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:57,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:57,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:57,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:57,167 INFO L87 Difference]: Start difference. First operand 711 states and 1064 transitions. Second operand 7 states. [2019-08-04 21:21:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:57,723 INFO L93 Difference]: Finished difference Result 1008 states and 1498 transitions. [2019-08-04 21:21:57,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:21:57,724 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:57,728 INFO L225 Difference]: With dead ends: 1008 [2019-08-04 21:21:57,728 INFO L226 Difference]: Without dead ends: 1008 [2019-08-04 21:21:57,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:21:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2019-08-04 21:21:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 701. [2019-08-04 21:21:57,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-08-04 21:21:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1048 transitions. [2019-08-04 21:21:57,744 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1048 transitions. Word has length 18 [2019-08-04 21:21:57,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:57,744 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 1048 transitions. [2019-08-04 21:21:57,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1048 transitions. [2019-08-04 21:21:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:57,746 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:57,746 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:57,746 INFO L418 AbstractCegarLoop]: === Iteration 19 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:57,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash -23265211, now seen corresponding path program 1 times [2019-08-04 21:21:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:57,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:57,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:58,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:58,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:58,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:58,288 INFO L87 Difference]: Start difference. First operand 701 states and 1048 transitions. Second operand 7 states. [2019-08-04 21:21:59,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:21:59,279 INFO L93 Difference]: Finished difference Result 935 states and 1385 transitions. [2019-08-04 21:21:59,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:21:59,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:21:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:21:59,291 INFO L225 Difference]: With dead ends: 935 [2019-08-04 21:21:59,291 INFO L226 Difference]: Without dead ends: 935 [2019-08-04 21:21:59,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:21:59,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-08-04 21:21:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 742. [2019-08-04 21:21:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-08-04 21:21:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1108 transitions. [2019-08-04 21:21:59,307 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1108 transitions. Word has length 18 [2019-08-04 21:21:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:21:59,307 INFO L475 AbstractCegarLoop]: Abstraction has 742 states and 1108 transitions. [2019-08-04 21:21:59,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:21:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1108 transitions. [2019-08-04 21:21:59,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:21:59,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:21:59,309 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:21:59,309 INFO L418 AbstractCegarLoop]: === Iteration 20 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:21:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:21:59,309 INFO L82 PathProgramCache]: Analyzing trace with hash -84394939, now seen corresponding path program 2 times [2019-08-04 21:21:59,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:21:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:21:59,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:21:59,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:21:59,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:21:59,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:21:59,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:21:59,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:21:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:21:59,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:21:59,464 INFO L87 Difference]: Start difference. First operand 742 states and 1108 transitions. Second operand 7 states. [2019-08-04 21:22:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:00,392 INFO L93 Difference]: Finished difference Result 1002 states and 1473 transitions. [2019-08-04 21:22:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:22:00,395 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:22:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:00,399 INFO L225 Difference]: With dead ends: 1002 [2019-08-04 21:22:00,400 INFO L226 Difference]: Without dead ends: 1002 [2019-08-04 21:22:00,400 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:00,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2019-08-04 21:22:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 804. [2019-08-04 21:22:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2019-08-04 21:22:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1196 transitions. [2019-08-04 21:22:00,416 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 1196 transitions. Word has length 18 [2019-08-04 21:22:00,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:00,416 INFO L475 AbstractCegarLoop]: Abstraction has 804 states and 1196 transitions. [2019-08-04 21:22:00,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:22:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 1196 transitions. [2019-08-04 21:22:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:00,418 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:00,418 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:00,418 INFO L418 AbstractCegarLoop]: === Iteration 21 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:00,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:00,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1150088966, now seen corresponding path program 1 times [2019-08-04 21:22:00,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:00,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:22:00,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:00,562 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-04 21:22:00,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:00,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:22:00,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:22:00,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:22:00,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:22:00,563 INFO L87 Difference]: Start difference. First operand 804 states and 1196 transitions. Second operand 7 states. [2019-08-04 21:22:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:01,446 INFO L93 Difference]: Finished difference Result 1007 states and 1494 transitions. [2019-08-04 21:22:01,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:01,447 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:22:01,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:01,450 INFO L225 Difference]: With dead ends: 1007 [2019-08-04 21:22:01,450 INFO L226 Difference]: Without dead ends: 1007 [2019-08-04 21:22:01,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:22:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-08-04 21:22:01,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 767. [2019-08-04 21:22:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-08-04 21:22:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1138 transitions. [2019-08-04 21:22:01,464 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1138 transitions. Word has length 18 [2019-08-04 21:22:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:01,465 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1138 transitions. [2019-08-04 21:22:01,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:22:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1138 transitions. [2019-08-04 21:22:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-04 21:22:01,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:01,466 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:01,467 INFO L418 AbstractCegarLoop]: === Iteration 22 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:01,467 INFO L82 PathProgramCache]: Analyzing trace with hash -269928001, now seen corresponding path program 2 times [2019-08-04 21:22:01,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:01,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-04 21:22:01,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:01,610 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-04 21:22:01,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:01,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-04 21:22:01,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-04 21:22:01,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-04 21:22:01,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-04 21:22:01,611 INFO L87 Difference]: Start difference. First operand 767 states and 1138 transitions. Second operand 7 states. [2019-08-04 21:22:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:02,036 INFO L93 Difference]: Finished difference Result 1093 states and 1618 transitions. [2019-08-04 21:22:02,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:02,039 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-08-04 21:22:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:02,043 INFO L225 Difference]: With dead ends: 1093 [2019-08-04 21:22:02,043 INFO L226 Difference]: Without dead ends: 1093 [2019-08-04 21:22:02,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2019-08-04 21:22:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 785. [2019-08-04 21:22:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-08-04 21:22:02,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1162 transitions. [2019-08-04 21:22:02,058 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1162 transitions. Word has length 18 [2019-08-04 21:22:02,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:02,058 INFO L475 AbstractCegarLoop]: Abstraction has 785 states and 1162 transitions. [2019-08-04 21:22:02,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-04 21:22:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1162 transitions. [2019-08-04 21:22:02,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:22:02,060 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:02,060 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:02,061 INFO L418 AbstractCegarLoop]: === Iteration 23 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:02,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1192962470, now seen corresponding path program 1 times [2019-08-04 21:22:02,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:02,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-04 21:22:02,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-04 21:22:02,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-04 21:22:02,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-04 21:22:02,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-04 21:22:02,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-04 21:22:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-04 21:22:02,162 INFO L87 Difference]: Start difference. First operand 785 states and 1162 transitions. Second operand 4 states. [2019-08-04 21:22:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:02,204 INFO L93 Difference]: Finished difference Result 719 states and 1028 transitions. [2019-08-04 21:22:02,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-04 21:22:02,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-08-04 21:22:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:02,206 INFO L225 Difference]: With dead ends: 719 [2019-08-04 21:22:02,207 INFO L226 Difference]: Without dead ends: 719 [2019-08-04 21:22:02,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-04 21:22:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-08-04 21:22:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2019-08-04 21:22:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-08-04 21:22:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1028 transitions. [2019-08-04 21:22:02,218 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1028 transitions. Word has length 21 [2019-08-04 21:22:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:02,218 INFO L475 AbstractCegarLoop]: Abstraction has 719 states and 1028 transitions. [2019-08-04 21:22:02,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-04 21:22:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1028 transitions. [2019-08-04 21:22:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:22:02,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:02,220 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:02,221 INFO L418 AbstractCegarLoop]: === Iteration 24 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:02,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1410780444, now seen corresponding path program 1 times [2019-08-04 21:22:02,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:02,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:22:02,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:02,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:02,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:02,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:22:02,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:02,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:02,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:02,451 INFO L87 Difference]: Start difference. First operand 719 states and 1028 transitions. Second operand 10 states. [2019-08-04 21:22:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:03,496 INFO L93 Difference]: Finished difference Result 1055 states and 1506 transitions. [2019-08-04 21:22:03,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-04 21:22:03,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-08-04 21:22:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:03,500 INFO L225 Difference]: With dead ends: 1055 [2019-08-04 21:22:03,500 INFO L226 Difference]: Without dead ends: 1055 [2019-08-04 21:22:03,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2019-08-04 21:22:03,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2019-08-04 21:22:03,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 509. [2019-08-04 21:22:03,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-08-04 21:22:03,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 735 transitions. [2019-08-04 21:22:03,510 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 735 transitions. Word has length 21 [2019-08-04 21:22:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:03,510 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 735 transitions. [2019-08-04 21:22:03,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 735 transitions. [2019-08-04 21:22:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:22:03,512 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:03,512 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:03,512 INFO L418 AbstractCegarLoop]: === Iteration 25 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:03,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:03,512 INFO L82 PathProgramCache]: Analyzing trace with hash 517147244, now seen corresponding path program 1 times [2019-08-04 21:22:03,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:03,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-04 21:22:03,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:03,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:03,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:03,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:03,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:03,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:03,992 INFO L87 Difference]: Start difference. First operand 509 states and 735 transitions. Second operand 9 states. [2019-08-04 21:22:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:04,591 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2019-08-04 21:22:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:22:04,592 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-08-04 21:22:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:04,595 INFO L225 Difference]: With dead ends: 753 [2019-08-04 21:22:04,596 INFO L226 Difference]: Without dead ends: 753 [2019-08-04 21:22:04,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:22:04,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-08-04 21:22:04,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 565. [2019-08-04 21:22:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-08-04 21:22:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 822 transitions. [2019-08-04 21:22:04,607 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 822 transitions. Word has length 21 [2019-08-04 21:22:04,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:04,607 INFO L475 AbstractCegarLoop]: Abstraction has 565 states and 822 transitions. [2019-08-04 21:22:04,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:04,607 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 822 transitions. [2019-08-04 21:22:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-04 21:22:04,609 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:04,609 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:04,609 INFO L418 AbstractCegarLoop]: === Iteration 26 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:04,609 INFO L82 PathProgramCache]: Analyzing trace with hash 939989868, now seen corresponding path program 1 times [2019-08-04 21:22:04,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:04,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:04,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:04,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:04,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:04,809 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:04,810 INFO L87 Difference]: Start difference. First operand 565 states and 822 transitions. Second operand 9 states. [2019-08-04 21:22:05,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:05,356 INFO L93 Difference]: Finished difference Result 723 states and 1046 transitions. [2019-08-04 21:22:05,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:22:05,357 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-08-04 21:22:05,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:05,360 INFO L225 Difference]: With dead ends: 723 [2019-08-04 21:22:05,361 INFO L226 Difference]: Without dead ends: 723 [2019-08-04 21:22:05,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-08-04 21:22:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 392. [2019-08-04 21:22:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-08-04 21:22:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 575 transitions. [2019-08-04 21:22:05,370 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 575 transitions. Word has length 21 [2019-08-04 21:22:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:05,370 INFO L475 AbstractCegarLoop]: Abstraction has 392 states and 575 transitions. [2019-08-04 21:22:05,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:05,370 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 575 transitions. [2019-08-04 21:22:05,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:05,372 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:05,372 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:05,372 INFO L418 AbstractCegarLoop]: === Iteration 27 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:05,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:05,373 INFO L82 PathProgramCache]: Analyzing trace with hash 521348607, now seen corresponding path program 1 times [2019-08-04 21:22:05,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:05,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:05,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:05,820 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-04 21:22:05,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:05,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:05,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:05,822 INFO L87 Difference]: Start difference. First operand 392 states and 575 transitions. Second operand 9 states. [2019-08-04 21:22:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:06,379 INFO L93 Difference]: Finished difference Result 479 states and 691 transitions. [2019-08-04 21:22:06,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:06,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:06,382 INFO L225 Difference]: With dead ends: 479 [2019-08-04 21:22:06,382 INFO L226 Difference]: Without dead ends: 479 [2019-08-04 21:22:06,383 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-08-04 21:22:06,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 379. [2019-08-04 21:22:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-08-04 21:22:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 557 transitions. [2019-08-04 21:22:06,390 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 557 transitions. Word has length 25 [2019-08-04 21:22:06,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:06,390 INFO L475 AbstractCegarLoop]: Abstraction has 379 states and 557 transitions. [2019-08-04 21:22:06,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 557 transitions. [2019-08-04 21:22:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:06,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:06,392 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:06,392 INFO L418 AbstractCegarLoop]: === Iteration 28 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash 460218879, now seen corresponding path program 2 times [2019-08-04 21:22:06,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:06,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:06,892 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-04 21:22:06,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:06,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:06,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:06,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:06,893 INFO L87 Difference]: Start difference. First operand 379 states and 557 transitions. Second operand 9 states. [2019-08-04 21:22:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:07,500 INFO L93 Difference]: Finished difference Result 469 states and 676 transitions. [2019-08-04 21:22:07,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:07,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:07,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:07,503 INFO L225 Difference]: With dead ends: 469 [2019-08-04 21:22:07,503 INFO L226 Difference]: Without dead ends: 469 [2019-08-04 21:22:07,504 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-08-04 21:22:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 377. [2019-08-04 21:22:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-08-04 21:22:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-08-04 21:22:07,509 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 25 [2019-08-04 21:22:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:07,510 INFO L475 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-08-04 21:22:07,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-08-04 21:22:07,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:07,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:07,512 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:07,512 INFO L418 AbstractCegarLoop]: === Iteration 29 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:07,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:07,512 INFO L82 PathProgramCache]: Analyzing trace with hash 105225863, now seen corresponding path program 1 times [2019-08-04 21:22:07,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:07,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:07,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:08,471 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:08,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:08,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:08,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:08,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:08,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:08,473 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 9 states. [2019-08-04 21:22:09,122 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-08-04 21:22:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:09,928 INFO L93 Difference]: Finished difference Result 488 states and 703 transitions. [2019-08-04 21:22:09,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:09,929 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:09,931 INFO L225 Difference]: With dead ends: 488 [2019-08-04 21:22:09,932 INFO L226 Difference]: Without dead ends: 488 [2019-08-04 21:22:09,932 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2019-08-04 21:22:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 358. [2019-08-04 21:22:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-08-04 21:22:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 527 transitions. [2019-08-04 21:22:09,940 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 527 transitions. Word has length 25 [2019-08-04 21:22:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:09,940 INFO L475 AbstractCegarLoop]: Abstraction has 358 states and 527 transitions. [2019-08-04 21:22:09,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 527 transitions. [2019-08-04 21:22:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:09,942 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:09,942 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:09,942 INFO L418 AbstractCegarLoop]: === Iteration 30 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:09,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1017706754, now seen corresponding path program 1 times [2019-08-04 21:22:09,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:09,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:09,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:10,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:10,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:10,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:10,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:10,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:10,321 INFO L87 Difference]: Start difference. First operand 358 states and 527 transitions. Second operand 9 states. [2019-08-04 21:22:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:10,906 INFO L93 Difference]: Finished difference Result 437 states and 631 transitions. [2019-08-04 21:22:10,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:10,906 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:10,909 INFO L225 Difference]: With dead ends: 437 [2019-08-04 21:22:10,909 INFO L226 Difference]: Without dead ends: 437 [2019-08-04 21:22:10,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:22:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-08-04 21:22:10,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 374. [2019-08-04 21:22:10,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-08-04 21:22:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 551 transitions. [2019-08-04 21:22:10,915 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 551 transitions. Word has length 25 [2019-08-04 21:22:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:10,916 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 551 transitions. [2019-08-04 21:22:10,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 551 transitions. [2019-08-04 21:22:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:10,917 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:10,917 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:10,917 INFO L418 AbstractCegarLoop]: === Iteration 31 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:10,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash 662713738, now seen corresponding path program 1 times [2019-08-04 21:22:10,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:10,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:22:10,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:11,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:11,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:22:11,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:22:11,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:22:11,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:22:11,653 INFO L87 Difference]: Start difference. First operand 374 states and 551 transitions. Second operand 12 states. [2019-08-04 21:22:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:12,687 INFO L93 Difference]: Finished difference Result 549 states and 794 transitions. [2019-08-04 21:22:12,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:12,688 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-08-04 21:22:12,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:12,690 INFO L225 Difference]: With dead ends: 549 [2019-08-04 21:22:12,690 INFO L226 Difference]: Without dead ends: 549 [2019-08-04 21:22:12,690 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-08-04 21:22:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 433. [2019-08-04 21:22:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-08-04 21:22:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 637 transitions. [2019-08-04 21:22:12,695 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 637 transitions. Word has length 25 [2019-08-04 21:22:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 433 states and 637 transitions. [2019-08-04 21:22:12,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:22:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 637 transitions. [2019-08-04 21:22:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:12,697 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:12,697 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:12,697 INFO L418 AbstractCegarLoop]: === Iteration 32 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:12,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:12,698 INFO L82 PathProgramCache]: Analyzing trace with hash 662802633, now seen corresponding path program 1 times [2019-08-04 21:22:12,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:12,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-04 21:22:12,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:12,969 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-04 21:22:12,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:12,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:12,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:12,971 INFO L87 Difference]: Start difference. First operand 433 states and 637 transitions. Second operand 8 states. [2019-08-04 21:22:14,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:14,371 INFO L93 Difference]: Finished difference Result 519 states and 748 transitions. [2019-08-04 21:22:14,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-04 21:22:14,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-04 21:22:14,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:14,375 INFO L225 Difference]: With dead ends: 519 [2019-08-04 21:22:14,375 INFO L226 Difference]: Without dead ends: 519 [2019-08-04 21:22:14,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-08-04 21:22:14,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2019-08-04 21:22:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 442. [2019-08-04 21:22:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-08-04 21:22:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 649 transitions. [2019-08-04 21:22:14,384 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 649 transitions. Word has length 25 [2019-08-04 21:22:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:14,384 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 649 transitions. [2019-08-04 21:22:14,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 649 transitions. [2019-08-04 21:22:14,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:14,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:14,386 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:14,387 INFO L418 AbstractCegarLoop]: === Iteration 33 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:14,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:14,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1037364760, now seen corresponding path program 1 times [2019-08-04 21:22:14,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:14,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:22:14,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:14,676 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-04 21:22:14,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:14,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:14,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:14,677 INFO L87 Difference]: Start difference. First operand 442 states and 649 transitions. Second operand 10 states. [2019-08-04 21:22:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:15,333 INFO L93 Difference]: Finished difference Result 939 states and 1363 transitions. [2019-08-04 21:22:15,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:15,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-08-04 21:22:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:15,337 INFO L225 Difference]: With dead ends: 939 [2019-08-04 21:22:15,337 INFO L226 Difference]: Without dead ends: 939 [2019-08-04 21:22:15,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-08-04 21:22:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 509. [2019-08-04 21:22:15,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-08-04 21:22:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 747 transitions. [2019-08-04 21:22:15,345 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 747 transitions. Word has length 25 [2019-08-04 21:22:15,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:15,346 INFO L475 AbstractCegarLoop]: Abstraction has 509 states and 747 transitions. [2019-08-04 21:22:15,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:15,346 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 747 transitions. [2019-08-04 21:22:15,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:15,347 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:15,347 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:15,348 INFO L418 AbstractCegarLoop]: === Iteration 34 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:15,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:15,348 INFO L82 PathProgramCache]: Analyzing trace with hash 269190686, now seen corresponding path program 2 times [2019-08-04 21:22:15,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:15,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:22:15,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:15,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:15,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:15,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:15,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:15,518 INFO L87 Difference]: Start difference. First operand 509 states and 747 transitions. Second operand 9 states. [2019-08-04 21:22:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:16,038 INFO L93 Difference]: Finished difference Result 692 states and 1003 transitions. [2019-08-04 21:22:16,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:22:16,038 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:16,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:16,041 INFO L225 Difference]: With dead ends: 692 [2019-08-04 21:22:16,041 INFO L226 Difference]: Without dead ends: 692 [2019-08-04 21:22:16,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2019-08-04 21:22:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 494. [2019-08-04 21:22:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-08-04 21:22:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 724 transitions. [2019-08-04 21:22:16,048 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 724 transitions. Word has length 25 [2019-08-04 21:22:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:16,048 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 724 transitions. [2019-08-04 21:22:16,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 724 transitions. [2019-08-04 21:22:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:16,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:16,050 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:16,050 INFO L418 AbstractCegarLoop]: === Iteration 35 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash -85802330, now seen corresponding path program 2 times [2019-08-04 21:22:16,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:16,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:22:16,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:16,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:16,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:22:16,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:22:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:22:16,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:22:16,302 INFO L87 Difference]: Start difference. First operand 494 states and 724 transitions. Second operand 12 states. [2019-08-04 21:22:17,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:17,457 INFO L93 Difference]: Finished difference Result 1029 states and 1487 transitions. [2019-08-04 21:22:17,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:17,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-08-04 21:22:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:17,461 INFO L225 Difference]: With dead ends: 1029 [2019-08-04 21:22:17,461 INFO L226 Difference]: Without dead ends: 1029 [2019-08-04 21:22:17,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2019-08-04 21:22:17,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2019-08-04 21:22:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 835. [2019-08-04 21:22:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2019-08-04 21:22:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1228 transitions. [2019-08-04 21:22:17,474 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1228 transitions. Word has length 25 [2019-08-04 21:22:17,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:17,475 INFO L475 AbstractCegarLoop]: Abstraction has 835 states and 1228 transitions. [2019-08-04 21:22:17,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:22:17,475 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1228 transitions. [2019-08-04 21:22:17,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:17,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:17,477 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:17,477 INFO L418 AbstractCegarLoop]: === Iteration 36 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:17,477 INFO L82 PathProgramCache]: Analyzing trace with hash -85713435, now seen corresponding path program 2 times [2019-08-04 21:22:17,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:17,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:22:17,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:17,681 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-04 21:22:17,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:17,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:17,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:17,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:17,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:17,683 INFO L87 Difference]: Start difference. First operand 835 states and 1228 transitions. Second operand 9 states. [2019-08-04 21:22:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:18,366 INFO L93 Difference]: Finished difference Result 1269 states and 1855 transitions. [2019-08-04 21:22:18,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:18,366 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:18,373 INFO L225 Difference]: With dead ends: 1269 [2019-08-04 21:22:18,373 INFO L226 Difference]: Without dead ends: 1269 [2019-08-04 21:22:18,373 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:18,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2019-08-04 21:22:18,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 848. [2019-08-04 21:22:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-08-04 21:22:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1248 transitions. [2019-08-04 21:22:18,390 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1248 transitions. Word has length 25 [2019-08-04 21:22:18,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:18,390 INFO L475 AbstractCegarLoop]: Abstraction has 848 states and 1248 transitions. [2019-08-04 21:22:18,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1248 transitions. [2019-08-04 21:22:18,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:18,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:18,392 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:18,392 INFO L418 AbstractCegarLoop]: === Iteration 37 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:18,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:18,393 INFO L82 PathProgramCache]: Analyzing trace with hash 288848692, now seen corresponding path program 2 times [2019-08-04 21:22:18,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:18,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:22:18,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:18,573 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-04 21:22:18,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:18,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:18,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:18,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:18,574 INFO L87 Difference]: Start difference. First operand 848 states and 1248 transitions. Second operand 9 states. [2019-08-04 21:22:19,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:19,173 INFO L93 Difference]: Finished difference Result 1201 states and 1752 transitions. [2019-08-04 21:22:19,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:19,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:19,179 INFO L225 Difference]: With dead ends: 1201 [2019-08-04 21:22:19,180 INFO L226 Difference]: Without dead ends: 1201 [2019-08-04 21:22:19,180 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-08-04 21:22:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 834. [2019-08-04 21:22:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2019-08-04 21:22:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1226 transitions. [2019-08-04 21:22:19,195 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1226 transitions. Word has length 25 [2019-08-04 21:22:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:19,195 INFO L475 AbstractCegarLoop]: Abstraction has 834 states and 1226 transitions. [2019-08-04 21:22:19,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1226 transitions. [2019-08-04 21:22:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:19,197 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:19,197 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:19,197 INFO L418 AbstractCegarLoop]: === Iteration 38 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1302017705, now seen corresponding path program 2 times [2019-08-04 21:22:19,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:19,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:19,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-04 21:22:19,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:19,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:19,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:22:19,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:19,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:19,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:19,444 INFO L87 Difference]: Start difference. First operand 834 states and 1226 transitions. Second operand 10 states. [2019-08-04 21:22:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:20,343 INFO L93 Difference]: Finished difference Result 1261 states and 1839 transitions. [2019-08-04 21:22:20,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:20,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-08-04 21:22:20,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:20,349 INFO L225 Difference]: With dead ends: 1261 [2019-08-04 21:22:20,350 INFO L226 Difference]: Without dead ends: 1261 [2019-08-04 21:22:20,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:20,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-08-04 21:22:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 881. [2019-08-04 21:22:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2019-08-04 21:22:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1293 transitions. [2019-08-04 21:22:20,364 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1293 transitions. Word has length 25 [2019-08-04 21:22:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:20,365 INFO L475 AbstractCegarLoop]: Abstraction has 881 states and 1293 transitions. [2019-08-04 21:22:20,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1293 transitions. [2019-08-04 21:22:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:20,366 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:20,367 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:20,367 INFO L418 AbstractCegarLoop]: === Iteration 39 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:20,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1819599163, now seen corresponding path program 3 times [2019-08-04 21:22:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:20,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:22:20,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:20,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:20,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-04 21:22:20,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-04 21:22:20,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-04 21:22:20,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-08-04 21:22:20,851 INFO L87 Difference]: Start difference. First operand 881 states and 1293 transitions. Second operand 12 states. [2019-08-04 21:22:21,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:21,657 INFO L93 Difference]: Finished difference Result 1077 states and 1574 transitions. [2019-08-04 21:22:21,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:21,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2019-08-04 21:22:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:21,660 INFO L225 Difference]: With dead ends: 1077 [2019-08-04 21:22:21,660 INFO L226 Difference]: Without dead ends: 1077 [2019-08-04 21:22:21,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:21,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-08-04 21:22:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 919. [2019-08-04 21:22:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 919 states. [2019-08-04 21:22:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1353 transitions. [2019-08-04 21:22:21,673 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1353 transitions. Word has length 25 [2019-08-04 21:22:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:21,673 INFO L475 AbstractCegarLoop]: Abstraction has 919 states and 1353 transitions. [2019-08-04 21:22:21,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-04 21:22:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1353 transitions. [2019-08-04 21:22:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:21,675 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:21,675 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:21,675 INFO L418 AbstractCegarLoop]: === Iteration 40 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:21,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:21,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1819509436, now seen corresponding path program 1 times [2019-08-04 21:22:21,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:21,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:21,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:21,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:21,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:21,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:21,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:21,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:21,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:21,799 INFO L87 Difference]: Start difference. First operand 919 states and 1353 transitions. Second operand 9 states. [2019-08-04 21:22:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:22,471 INFO L93 Difference]: Finished difference Result 1196 states and 1754 transitions. [2019-08-04 21:22:22,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:22,472 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:22,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:22,474 INFO L225 Difference]: With dead ends: 1196 [2019-08-04 21:22:22,474 INFO L226 Difference]: Without dead ends: 1196 [2019-08-04 21:22:22,474 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2019-08-04 21:22:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 822. [2019-08-04 21:22:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-08-04 21:22:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1209 transitions. [2019-08-04 21:22:22,485 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1209 transitions. Word has length 25 [2019-08-04 21:22:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:22,486 INFO L475 AbstractCegarLoop]: Abstraction has 822 states and 1209 transitions. [2019-08-04 21:22:22,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1209 transitions. [2019-08-04 21:22:22,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:22,487 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:22,487 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:22,488 INFO L418 AbstractCegarLoop]: === Iteration 41 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:22,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:22,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2120375117, now seen corresponding path program 1 times [2019-08-04 21:22:22,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:22,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:22,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:22,657 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-04 21:22:22,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:22,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:22,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:22,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:22,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:22,659 INFO L87 Difference]: Start difference. First operand 822 states and 1209 transitions. Second operand 9 states. [2019-08-04 21:22:23,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:23,185 INFO L93 Difference]: Finished difference Result 930 states and 1348 transitions. [2019-08-04 21:22:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:23,185 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:23,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:23,188 INFO L225 Difference]: With dead ends: 930 [2019-08-04 21:22:23,188 INFO L226 Difference]: Without dead ends: 930 [2019-08-04 21:22:23,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-08-04 21:22:23,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-08-04 21:22:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 815. [2019-08-04 21:22:23,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-08-04 21:22:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1197 transitions. [2019-08-04 21:22:23,197 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1197 transitions. Word has length 25 [2019-08-04 21:22:23,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:23,197 INFO L475 AbstractCegarLoop]: Abstraction has 815 states and 1197 transitions. [2019-08-04 21:22:23,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1197 transitions. [2019-08-04 21:22:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:23,198 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:23,199 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:23,199 INFO L418 AbstractCegarLoop]: === Iteration 42 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash 630000947, now seen corresponding path program 4 times [2019-08-04 21:22:23,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:23,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:23,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:23,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:23,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:23,433 INFO L87 Difference]: Start difference. First operand 815 states and 1197 transitions. Second operand 9 states. [2019-08-04 21:22:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:24,299 INFO L93 Difference]: Finished difference Result 989 states and 1433 transitions. [2019-08-04 21:22:24,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-04 21:22:24,305 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:24,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:24,307 INFO L225 Difference]: With dead ends: 989 [2019-08-04 21:22:24,307 INFO L226 Difference]: Without dead ends: 989 [2019-08-04 21:22:24,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2019-08-04 21:22:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 733. [2019-08-04 21:22:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-08-04 21:22:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1068 transitions. [2019-08-04 21:22:24,315 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1068 transitions. Word has length 25 [2019-08-04 21:22:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:24,316 INFO L475 AbstractCegarLoop]: Abstraction has 733 states and 1068 transitions. [2019-08-04 21:22:24,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1068 transitions. [2019-08-04 21:22:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:24,317 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:24,317 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:24,317 INFO L418 AbstractCegarLoop]: === Iteration 43 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash 275007931, now seen corresponding path program 2 times [2019-08-04 21:22:24,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:24,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:24,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:24,491 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-04 21:22:24,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:24,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:24,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:24,492 INFO L87 Difference]: Start difference. First operand 733 states and 1068 transitions. Second operand 9 states. [2019-08-04 21:22:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:25,131 INFO L93 Difference]: Finished difference Result 872 states and 1254 transitions. [2019-08-04 21:22:25,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:25,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:25,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:25,134 INFO L225 Difference]: With dead ends: 872 [2019-08-04 21:22:25,134 INFO L226 Difference]: Without dead ends: 872 [2019-08-04 21:22:25,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-08-04 21:22:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2019-08-04 21:22:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 731. [2019-08-04 21:22:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-08-04 21:22:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1065 transitions. [2019-08-04 21:22:25,144 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1065 transitions. Word has length 25 [2019-08-04 21:22:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:25,144 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1065 transitions. [2019-08-04 21:22:25,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1065 transitions. [2019-08-04 21:22:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:25,145 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:25,146 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:25,146 INFO L418 AbstractCegarLoop]: === Iteration 44 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 213878203, now seen corresponding path program 3 times [2019-08-04 21:22:25,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:25,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:25,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-04 21:22:25,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:25,345 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-04 21:22:25,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:25,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:25,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:25,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:25,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:25,347 INFO L87 Difference]: Start difference. First operand 731 states and 1065 transitions. Second operand 9 states. [2019-08-04 21:22:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:25,964 INFO L93 Difference]: Finished difference Result 856 states and 1227 transitions. [2019-08-04 21:22:25,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:25,965 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:25,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:25,967 INFO L225 Difference]: With dead ends: 856 [2019-08-04 21:22:25,967 INFO L226 Difference]: Without dead ends: 856 [2019-08-04 21:22:25,968 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:25,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2019-08-04 21:22:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 645. [2019-08-04 21:22:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2019-08-04 21:22:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 938 transitions. [2019-08-04 21:22:25,978 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 938 transitions. Word has length 25 [2019-08-04 21:22:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:25,978 INFO L475 AbstractCegarLoop]: Abstraction has 645 states and 938 transitions. [2019-08-04 21:22:25,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 938 transitions. [2019-08-04 21:22:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:25,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:25,980 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:25,981 INFO L418 AbstractCegarLoop]: === Iteration 45 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1668736886, now seen corresponding path program 1 times [2019-08-04 21:22:25,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:26,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:22:26,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:26,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:26,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:26,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:26,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:26,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:26,316 INFO L87 Difference]: Start difference. First operand 645 states and 938 transitions. Second operand 9 states. [2019-08-04 21:22:26,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:26,849 INFO L93 Difference]: Finished difference Result 902 states and 1303 transitions. [2019-08-04 21:22:26,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:26,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:26,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:26,852 INFO L225 Difference]: With dead ends: 902 [2019-08-04 21:22:26,852 INFO L226 Difference]: Without dead ends: 902 [2019-08-04 21:22:26,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:26,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2019-08-04 21:22:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 569. [2019-08-04 21:22:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-08-04 21:22:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 823 transitions. [2019-08-04 21:22:26,862 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 823 transitions. Word has length 25 [2019-08-04 21:22:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:26,862 INFO L475 AbstractCegarLoop]: Abstraction has 569 states and 823 transitions. [2019-08-04 21:22:26,862 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 823 transitions. [2019-08-04 21:22:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:26,864 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:26,864 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:26,864 INFO L418 AbstractCegarLoop]: === Iteration 46 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:26,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1151155428, now seen corresponding path program 2 times [2019-08-04 21:22:26,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:26,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-04 21:22:26,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:27,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:27,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:27,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-04 21:22:27,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-04 21:22:27,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-04 21:22:27,292 INFO L87 Difference]: Start difference. First operand 569 states and 823 transitions. Second operand 8 states. [2019-08-04 21:22:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:27,934 INFO L93 Difference]: Finished difference Result 1000 states and 1427 transitions. [2019-08-04 21:22:27,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:27,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2019-08-04 21:22:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:27,936 INFO L225 Difference]: With dead ends: 1000 [2019-08-04 21:22:27,936 INFO L226 Difference]: Without dead ends: 1000 [2019-08-04 21:22:27,937 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:22:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-08-04 21:22:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 803. [2019-08-04 21:22:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-08-04 21:22:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1165 transitions. [2019-08-04 21:22:27,950 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1165 transitions. Word has length 25 [2019-08-04 21:22:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:27,951 INFO L475 AbstractCegarLoop]: Abstraction has 803 states and 1165 transitions. [2019-08-04 21:22:27,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-04 21:22:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1165 transitions. [2019-08-04 21:22:27,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-04 21:22:27,953 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:27,953 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:27,953 INFO L418 AbstractCegarLoop]: === Iteration 47 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:27,953 INFO L82 PathProgramCache]: Analyzing trace with hash 796162412, now seen corresponding path program 1 times [2019-08-04 21:22:27,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:27,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-04 21:22:27,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:28,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:28,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:28,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:28,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:28,139 INFO L87 Difference]: Start difference. First operand 803 states and 1165 transitions. Second operand 9 states. [2019-08-04 21:22:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:28,804 INFO L93 Difference]: Finished difference Result 1005 states and 1453 transitions. [2019-08-04 21:22:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:22:28,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-08-04 21:22:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:28,806 INFO L225 Difference]: With dead ends: 1005 [2019-08-04 21:22:28,806 INFO L226 Difference]: Without dead ends: 1005 [2019-08-04 21:22:28,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-08-04 21:22:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-08-04 21:22:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 789. [2019-08-04 21:22:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-08-04 21:22:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1142 transitions. [2019-08-04 21:22:28,820 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1142 transitions. Word has length 25 [2019-08-04 21:22:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:28,820 INFO L475 AbstractCegarLoop]: Abstraction has 789 states and 1142 transitions. [2019-08-04 21:22:28,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1142 transitions. [2019-08-04 21:22:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:28,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:28,822 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:28,823 INFO L418 AbstractCegarLoop]: === Iteration 48 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:28,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:28,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1574328464, now seen corresponding path program 1 times [2019-08-04 21:22:28,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:28,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-04 21:22:28,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:29,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:29,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:22:29,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:29,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:29,832 INFO L87 Difference]: Start difference. First operand 789 states and 1142 transitions. Second operand 10 states. [2019-08-04 21:22:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:30,749 INFO L93 Difference]: Finished difference Result 1239 states and 1778 transitions. [2019-08-04 21:22:30,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-04 21:22:30,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-04 21:22:30,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:30,752 INFO L225 Difference]: With dead ends: 1239 [2019-08-04 21:22:30,752 INFO L226 Difference]: Without dead ends: 1239 [2019-08-04 21:22:30,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=576, Unknown=0, NotChecked=0, Total=812 [2019-08-04 21:22:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2019-08-04 21:22:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 701. [2019-08-04 21:22:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-08-04 21:22:30,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1012 transitions. [2019-08-04 21:22:30,763 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1012 transitions. Word has length 29 [2019-08-04 21:22:30,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:30,763 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 1012 transitions. [2019-08-04 21:22:30,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1012 transitions. [2019-08-04 21:22:30,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:30,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:30,764 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:30,765 INFO L418 AbstractCegarLoop]: === Iteration 49 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:30,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:30,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2002868801, now seen corresponding path program 1 times [2019-08-04 21:22:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:30,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:30,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:22:30,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:30,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:30,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:22:30,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-04 21:22:30,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-04 21:22:30,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-08-04 21:22:30,972 INFO L87 Difference]: Start difference. First operand 701 states and 1012 transitions. Second operand 11 states. [2019-08-04 21:22:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:31,603 INFO L93 Difference]: Finished difference Result 993 states and 1422 transitions. [2019-08-04 21:22:31,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:31,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-08-04 21:22:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:31,607 INFO L225 Difference]: With dead ends: 993 [2019-08-04 21:22:31,607 INFO L226 Difference]: Without dead ends: 993 [2019-08-04 21:22:31,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2019-08-04 21:22:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2019-08-04 21:22:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 684. [2019-08-04 21:22:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 684 states. [2019-08-04 21:22:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 990 transitions. [2019-08-04 21:22:31,619 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 990 transitions. Word has length 29 [2019-08-04 21:22:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:31,619 INFO L475 AbstractCegarLoop]: Abstraction has 684 states and 990 transitions. [2019-08-04 21:22:31,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-04 21:22:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 990 transitions. [2019-08-04 21:22:31,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:31,621 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:31,622 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:31,622 INFO L418 AbstractCegarLoop]: === Iteration 50 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:31,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1715693211, now seen corresponding path program 3 times [2019-08-04 21:22:31,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:31,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-04 21:22:31,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:32,023 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-04 21:22:32,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:32,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:32,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:32,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:32,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:32,025 INFO L87 Difference]: Start difference. First operand 684 states and 990 transitions. Second operand 9 states. [2019-08-04 21:22:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:32,664 INFO L93 Difference]: Finished difference Result 1016 states and 1457 transitions. [2019-08-04 21:22:32,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:32,664 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-04 21:22:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:32,666 INFO L225 Difference]: With dead ends: 1016 [2019-08-04 21:22:32,666 INFO L226 Difference]: Without dead ends: 1016 [2019-08-04 21:22:32,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2019-08-04 21:22:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 270. [2019-08-04 21:22:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-08-04 21:22:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 386 transitions. [2019-08-04 21:22:32,673 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 386 transitions. Word has length 29 [2019-08-04 21:22:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:32,674 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 386 transitions. [2019-08-04 21:22:32,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:32,674 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 386 transitions. [2019-08-04 21:22:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:32,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:32,675 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:32,675 INFO L418 AbstractCegarLoop]: === Iteration 51 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2090255338, now seen corresponding path program 3 times [2019-08-04 21:22:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:32,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-04 21:22:32,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-04 21:22:33,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:33,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-04 21:22:33,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:33,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:33,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:33,169 INFO L87 Difference]: Start difference. First operand 270 states and 386 transitions. Second operand 10 states. [2019-08-04 21:22:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:34,079 INFO L93 Difference]: Finished difference Result 481 states and 680 transitions. [2019-08-04 21:22:34,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-04 21:22:34,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-04 21:22:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:34,080 INFO L225 Difference]: With dead ends: 481 [2019-08-04 21:22:34,081 INFO L226 Difference]: Without dead ends: 481 [2019-08-04 21:22:34,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-08-04 21:22:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-08-04 21:22:34,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 117. [2019-08-04 21:22:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-04 21:22:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 159 transitions. [2019-08-04 21:22:34,084 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 159 transitions. Word has length 29 [2019-08-04 21:22:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:34,084 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 159 transitions. [2019-08-04 21:22:34,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:34,084 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 159 transitions. [2019-08-04 21:22:34,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:34,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:34,086 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:34,086 INFO L418 AbstractCegarLoop]: === Iteration 52 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:34,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:34,086 INFO L82 PathProgramCache]: Analyzing trace with hash 140541619, now seen corresponding path program 1 times [2019-08-04 21:22:34,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:34,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:22:34,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:34,272 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:34,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:34,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:22:34,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:22:34,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:22:34,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:22:34,273 INFO L87 Difference]: Start difference. First operand 117 states and 159 transitions. Second operand 13 states. [2019-08-04 21:22:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:35,410 INFO L93 Difference]: Finished difference Result 254 states and 347 transitions. [2019-08-04 21:22:35,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-04 21:22:35,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-08-04 21:22:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:35,411 INFO L225 Difference]: With dead ends: 254 [2019-08-04 21:22:35,411 INFO L226 Difference]: Without dead ends: 254 [2019-08-04 21:22:35,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2019-08-04 21:22:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-08-04 21:22:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 112. [2019-08-04 21:22:35,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-04 21:22:35,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 152 transitions. [2019-08-04 21:22:35,414 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 152 transitions. Word has length 29 [2019-08-04 21:22:35,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:35,415 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 152 transitions. [2019-08-04 21:22:35,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:22:35,415 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 152 transitions. [2019-08-04 21:22:35,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:35,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:35,415 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:35,416 INFO L418 AbstractCegarLoop]: === Iteration 53 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:35,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:35,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1399453137, now seen corresponding path program 1 times [2019-08-04 21:22:35,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:35,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:22:35,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:35,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:35,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:35,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:35,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:35,665 INFO L87 Difference]: Start difference. First operand 112 states and 152 transitions. Second operand 10 states. [2019-08-04 21:22:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:36,310 INFO L93 Difference]: Finished difference Result 249 states and 345 transitions. [2019-08-04 21:22:36,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-04 21:22:36,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-04 21:22:36,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:36,311 INFO L225 Difference]: With dead ends: 249 [2019-08-04 21:22:36,311 INFO L226 Difference]: Without dead ends: 249 [2019-08-04 21:22:36,312 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2019-08-04 21:22:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-08-04 21:22:36,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 99. [2019-08-04 21:22:36,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-04 21:22:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 134 transitions. [2019-08-04 21:22:36,314 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 134 transitions. Word has length 29 [2019-08-04 21:22:36,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:36,315 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 134 transitions. [2019-08-04 21:22:36,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:36,315 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 134 transitions. [2019-08-04 21:22:36,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:36,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:36,316 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:36,316 INFO L418 AbstractCegarLoop]: === Iteration 54 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash 79411891, now seen corresponding path program 2 times [2019-08-04 21:22:36,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:36,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-04 21:22:36,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:37,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:37,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-04 21:22:37,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-04 21:22:37,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-04 21:22:37,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-08-04 21:22:37,248 INFO L87 Difference]: Start difference. First operand 99 states and 134 transitions. Second operand 13 states. [2019-08-04 21:22:38,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:38,594 INFO L93 Difference]: Finished difference Result 237 states and 322 transitions. [2019-08-04 21:22:38,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-04 21:22:38,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2019-08-04 21:22:38,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:38,595 INFO L225 Difference]: With dead ends: 237 [2019-08-04 21:22:38,596 INFO L226 Difference]: Without dead ends: 237 [2019-08-04 21:22:38,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:38,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-08-04 21:22:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 102. [2019-08-04 21:22:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-04 21:22:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 139 transitions. [2019-08-04 21:22:38,599 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 139 transitions. Word has length 29 [2019-08-04 21:22:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:38,599 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 139 transitions. [2019-08-04 21:22:38,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-04 21:22:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 139 transitions. [2019-08-04 21:22:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:38,600 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:38,600 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:38,600 INFO L418 AbstractCegarLoop]: === Iteration 55 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:38,601 INFO L82 PathProgramCache]: Analyzing trace with hash 79501618, now seen corresponding path program 1 times [2019-08-04 21:22:38,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:38,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-04 21:22:38,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:39,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-04 21:22:39,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:39,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:39,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:39,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:39,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:39,566 INFO L87 Difference]: Start difference. First operand 102 states and 139 transitions. Second operand 10 states. [2019-08-04 21:22:40,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:40,431 INFO L93 Difference]: Finished difference Result 238 states and 328 transitions. [2019-08-04 21:22:40,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-04 21:22:40,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-04 21:22:40,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:40,433 INFO L225 Difference]: With dead ends: 238 [2019-08-04 21:22:40,433 INFO L226 Difference]: Without dead ends: 238 [2019-08-04 21:22:40,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2019-08-04 21:22:40,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-08-04 21:22:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 93. [2019-08-04 21:22:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-04 21:22:40,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2019-08-04 21:22:40,436 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 29 [2019-08-04 21:22:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:40,436 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2019-08-04 21:22:40,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2019-08-04 21:22:40,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:40,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:40,437 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:40,438 INFO L418 AbstractCegarLoop]: === Iteration 56 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:40,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:40,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1016689500, now seen corresponding path program 3 times [2019-08-04 21:22:40,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:40,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-04 21:22:40,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-04 21:22:40,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:40,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-04 21:22:40,564 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-04 21:22:40,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-04 21:22:40,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-08-04 21:22:40,564 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand 10 states. [2019-08-04 21:22:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:41,141 INFO L93 Difference]: Finished difference Result 168 states and 229 transitions. [2019-08-04 21:22:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-04 21:22:41,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-08-04 21:22:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:41,142 INFO L225 Difference]: With dead ends: 168 [2019-08-04 21:22:41,142 INFO L226 Difference]: Without dead ends: 168 [2019-08-04 21:22:41,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-08-04 21:22:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 90. [2019-08-04 21:22:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-04 21:22:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 121 transitions. [2019-08-04 21:22:41,145 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 121 transitions. Word has length 29 [2019-08-04 21:22:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:41,145 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 121 transitions. [2019-08-04 21:22:41,146 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-04 21:22:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 121 transitions. [2019-08-04 21:22:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-04 21:22:41,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-04 21:22:41,147 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-04 21:22:41,147 INFO L418 AbstractCegarLoop]: === Iteration 57 === [l0l1Err0ASSERT_VIOLATIONASSERT, l1l0Err0ASSERT_VIOLATIONASSERT, l1l1Err1ASSERT_VIOLATIONASSERT, l1l1Err0ASSERT_VIOLATIONASSERT]=== [2019-08-04 21:22:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-04 21:22:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1016779227, now seen corresponding path program 1 times [2019-08-04 21:22:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-04 21:22:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-04 21:22:41,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-04 21:22:41,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-04 21:22:41,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-04 21:22:41,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-04 21:22:41,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-04 21:22:41,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-04 21:22:41,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-04 21:22:41,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-04 21:22:41,246 INFO L87 Difference]: Start difference. First operand 90 states and 121 transitions. Second operand 9 states. [2019-08-04 21:22:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-04 21:22:41,789 INFO L93 Difference]: Finished difference Result 195 states and 269 transitions. [2019-08-04 21:22:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-04 21:22:41,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-08-04 21:22:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-04 21:22:41,790 INFO L225 Difference]: With dead ends: 195 [2019-08-04 21:22:41,790 INFO L226 Difference]: Without dead ends: 0 [2019-08-04 21:22:41,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-08-04 21:22:41,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-04 21:22:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-04 21:22:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-04 21:22:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-04 21:22:41,792 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-08-04 21:22:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-04 21:22:41,792 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-04 21:22:41,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-04 21:22:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-04 21:22:41,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-04 21:22:41,797 INFO L202 PluginConnector]: Adding new model threadpooling_product_WithProcedures.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:22:41 BoogieIcfgContainer [2019-08-04 21:22:41,797 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-04 21:22:41,799 INFO L168 Benchmark]: Toolchain (without parser) took 61645.47 ms. Allocated memory was 134.2 MB in the beginning and 481.8 MB in the end (delta: 347.6 MB). Free memory was 110.3 MB in the beginning and 300.9 MB in the end (delta: -190.5 MB). Peak memory consumption was 157.1 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:41,800 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-04 21:22:41,800 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 134.2 MB. Free memory was 110.3 MB in the beginning and 108.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:41,801 INFO L168 Benchmark]: Boogie Preprocessor took 30.89 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 107.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:41,801 INFO L168 Benchmark]: RCFGBuilder took 619.83 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 92.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:41,802 INFO L168 Benchmark]: TraceAbstraction took 60951.11 ms. Allocated memory was 134.2 MB in the beginning and 481.8 MB in the end (delta: 347.6 MB). Free memory was 92.0 MB in the beginning and 300.9 MB in the end (delta: -208.9 MB). Peak memory consumption was 138.7 MB. Max. memory is 7.1 GB. [2019-08-04 21:22:41,805 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.20 ms. Allocated memory is still 134.2 MB. Free memory was 111.8 MB in the beginning and 111.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 39.35 ms. Allocated memory is still 134.2 MB. Free memory was 110.3 MB in the beginning and 108.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.89 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 107.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 619.83 ms. Allocated memory is still 134.2 MB. Free memory was 107.3 MB in the beginning and 92.2 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60951.11 ms. Allocated memory was 134.2 MB in the beginning and 481.8 MB in the end (delta: 347.6 MB). Free memory was 92.0 MB in the beginning and 300.9 MB in the end (delta: -208.9 MB). Peak memory consumption was 138.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 99]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 66]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 121]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 112]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 4 error locations. SAFE Result, 60.8s OverallTime, 57 OverallIterations, 3 TraceHistogramMax, 41.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4230 SDtfs, 6563 SDslu, 8021 SDs, 0 SdLazy, 26084 SolverSat, 4364 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 27.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1667 GetRequests, 731 SyntacticMatches, 71 SemanticMatches, 865 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2104 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=919occurred in iteration=39, 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.6s AutomataMinimizationTime, 57 MinimizatonAttempts, 12347 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1168 ConstructedInterpolants, 34 QuantifiedInterpolants, 138228 SizeOfPredicates, 940 NumberOfNonLiveVariables, 16904 ConjunctsInSsa, 1917 ConjunctsInUnsatCore, 57 InterpolantComputations, 6 PerfectInterpolantSequences, 34/410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...