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/toy/SimultaneousIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:44:01,859 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:44:01,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:44:01,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:44:01,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:44:01,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:44:01,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:44:01,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:44:01,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:44:01,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:44:01,882 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:44:01,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:44:01,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:44:01,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:44:01,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:44:01,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:44:01,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:44:01,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:44:01,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:44:01,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:44:01,896 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:44:01,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:44:01,901 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:44:01,903 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:44:01,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:44:01,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:44:01,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:44:01,908 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:44:01,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:44:01,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:44:01,913 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:44:01,914 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:44:01,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:44:01,915 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:44:01,916 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:44:01,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:44:01,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:44:01,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:44:01,922 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:44:01,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:44:01,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:44:01,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:44:01,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:44:01,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:44:01,980 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:44:01,981 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:44:01,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SimultaneousIncrement.bpl [2019-08-05 10:44:01,982 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/SimultaneousIncrement.bpl' [2019-08-05 10:44:02,015 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:44:02,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:44:02,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:02,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:44:02,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:44:02,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,055 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:44:02,055 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:44:02,056 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:44:02,058 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:44:02,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:44:02,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:44:02,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:44:02,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... [2019-08-05 10:44:02,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:44:02,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:44:02,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:44:02,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:44:02,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:44:02,161 INFO L124 BoogieDeclarations]: Specification and implementation of procedure SimultaneousIncrement given in one single declaration [2019-08-05 10:44:02,161 INFO L130 BoogieDeclarations]: Found specification of procedure SimultaneousIncrement [2019-08-05 10:44:02,161 INFO L138 BoogieDeclarations]: Found implementation of procedure SimultaneousIncrement [2019-08-05 10:44:02,429 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:44:02,430 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-08-05 10:44:02,432 INFO L202 PluginConnector]: Adding new model SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:44:02 BoogieIcfgContainer [2019-08-05 10:44:02,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:44:02,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:44:02,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:44:02,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:44:02,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:44:02" (1/2) ... [2019-08-05 10:44:02,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be715f6 and model type SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:44:02, skipping insertion in model container [2019-08-05 10:44:02,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:44:02" (2/2) ... [2019-08-05 10:44:02,444 INFO L109 eAbstractionObserver]: Analyzing ICFG SimultaneousIncrement.bpl [2019-08-05 10:44:02,458 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:44:02,466 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:44:02,484 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:44:02,511 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:44:02,512 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:44:02,512 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:44:02,513 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:44:02,513 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:44:02,513 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:44:02,513 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:44:02,513 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:44:02,514 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:44:02,528 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-08-05 10:44:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:44:02,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:02,537 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:44:02,540 INFO L418 AbstractCegarLoop]: === Iteration 1 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:02,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash 926789, now seen corresponding path program 1 times [2019-08-05 10:44:02,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:02,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:44:02,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:02,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:44:02,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:44:02,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:44:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:44:02,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:44:02,874 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-08-05 10:44:03,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,059 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2019-08-05 10:44:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:44:03,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:44:03,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,071 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:44:03,072 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:44:03,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:44:03,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:44:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:44:03,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-08-05 10:44:03,103 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2019-08-05 10:44:03,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,104 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-08-05 10:44:03,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:44:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-08-05 10:44:03,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:44:03,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,105 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:44:03,105 INFO L418 AbstractCegarLoop]: === Iteration 2 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,106 INFO L82 PathProgramCache]: Analyzing trace with hash 28726597, now seen corresponding path program 1 times [2019-08-05 10:44:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,261 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-05 10:44:03,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:44:03,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:44:03,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:44:03,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:03,264 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 5 states. [2019-08-05 10:44:03,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,374 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-08-05 10:44:03,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:44:03,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:44:03,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,376 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:44:03,376 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:44:03,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:03,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:44:03,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:44:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:44:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-08-05 10:44:03,380 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-08-05 10:44:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,380 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-08-05 10:44:03,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:44:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2019-08-05 10:44:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:44:03,381 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,381 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-08-05 10:44:03,381 INFO L418 AbstractCegarLoop]: === Iteration 3 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:03,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash 28751583, now seen corresponding path program 1 times [2019-08-05 10:44:03,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:03,628 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-05 10:44:03,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:03,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:44:03,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:44:03,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:44:03,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:44:03,630 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-08-05 10:44:03,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:03,861 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-08-05 10:44:03,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:44:03,861 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:44:03,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:03,864 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:44:03,864 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:44:03,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:44:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2019-08-05 10:44:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:44:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2019-08-05 10:44:03,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 12 transitions. Word has length 5 [2019-08-05 10:44:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:03,868 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 12 transitions. [2019-08-05 10:44:03,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:44:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2019-08-05 10:44:03,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:44:03,869 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:03,869 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:44:03,869 INFO L418 AbstractCegarLoop]: === Iteration 4 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:03,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:03,870 INFO L82 PathProgramCache]: Analyzing trace with hash 890520645, now seen corresponding path program 2 times [2019-08-05 10:44:03,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:03,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:03,881 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:44:03,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:44:04,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:44:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:44:04,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:04,016 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand 6 states. [2019-08-05 10:44:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,168 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2019-08-05 10:44:04,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:44:04,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:44:04,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,169 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:44:04,170 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:44:04,171 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:04,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:44:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-08-05 10:44:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:44:04,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 10:44:04,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 6 [2019-08-05 10:44:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,175 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 10:44:04,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:44:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 10:44:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:44:04,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,176 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-08-05 10:44:04,176 INFO L418 AbstractCegarLoop]: === Iteration 5 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,176 INFO L82 PathProgramCache]: Analyzing trace with hash 891295211, now seen corresponding path program 1 times [2019-08-05 10:44:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,188 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:44:04,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:44:04,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:44:04,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:04,282 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 10:44:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,405 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-08-05 10:44:04,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:44:04,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:44:04,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,407 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:44:04,407 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:44:04,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:44:04,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-08-05 10:44:04,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:44:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-08-05 10:44:04,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 6 [2019-08-05 10:44:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,410 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-08-05 10:44:04,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:44:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2019-08-05 10:44:04,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:44:04,411 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,411 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-08-05 10:44:04,412 INFO L418 AbstractCegarLoop]: === Iteration 6 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 891320197, now seen corresponding path program 2 times [2019-08-05 10:44:04,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:44:04,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:44:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:44:04,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:44:04,756 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-08-05 10:44:04,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:04,847 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2019-08-05 10:44:04,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:44:04,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:44:04,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:04,849 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:44:04,849 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:44:04,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:04,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:44:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-08-05 10:44:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:44:04,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-08-05 10:44:04,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 15 transitions. Word has length 6 [2019-08-05 10:44:04,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:04,853 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-08-05 10:44:04,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:44:04,853 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-08-05 10:44:04,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:44:04,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:04,854 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 10:44:04,854 INFO L418 AbstractCegarLoop]: === Iteration 7 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:04,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:04,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1836332357, now seen corresponding path program 3 times [2019-08-05 10:44:04,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:04,867 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:44:04,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:04,990 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:04,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:04,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:44:04,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:44:04,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:44:04,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:04,991 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 7 states. [2019-08-05 10:44:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,061 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-08-05 10:44:05,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:44:05,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:44:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,062 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:44:05,063 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:44:05,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:44:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-08-05 10:44:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:44:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 10:44:05,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2019-08-05 10:44:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,067 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 10:44:05,067 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:44:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 10:44:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:44:05,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,068 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:44:05,068 INFO L418 AbstractCegarLoop]: === Iteration 8 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1860343903, now seen corresponding path program 2 times [2019-08-05 10:44:05,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,220 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-05 10:44:05,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:44:05,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:44:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:44:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:05,223 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2019-08-05 10:44:05,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,308 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-08-05 10:44:05,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:44:05,309 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:44:05,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,309 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:44:05,310 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:44:05,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:44:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:44:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:44:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 10:44:05,312 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2019-08-05 10:44:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,313 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 10:44:05,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:44:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 10:44:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:44:05,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,314 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-08-05 10:44:05,314 INFO L418 AbstractCegarLoop]: === Iteration 9 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1861118469, now seen corresponding path program 3 times [2019-08-05 10:44:05,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,326 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,480 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-05 10:44:05,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:44:05,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:44:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:44:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:05,483 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2019-08-05 10:44:05,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,644 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-08-05 10:44:05,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:44:05,646 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:44:05,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,647 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:44:05,647 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:44:05,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:05,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:44:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2019-08-05 10:44:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:44:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-08-05 10:44:05,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2019-08-05 10:44:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,650 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-08-05 10:44:05,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:44:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-08-05 10:44:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:44:05,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,651 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-08-05 10:44:05,652 INFO L418 AbstractCegarLoop]: === Iteration 10 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1861143455, now seen corresponding path program 3 times [2019-08-05 10:44:05,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,662 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:44:05,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:44:05,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:44:05,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:44:05,811 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2019-08-05 10:44:05,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,890 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2019-08-05 10:44:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:44:05,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:44:05,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,892 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:44:05,892 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:44:05,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:44:05,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2019-08-05 10:44:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:44:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-08-05 10:44:05,896 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 7 [2019-08-05 10:44:05,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,896 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-08-05 10:44:05,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:44:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2019-08-05 10:44:05,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:44:05,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,897 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 10:44:05,897 INFO L418 AbstractCegarLoop]: === Iteration 11 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1091724357, now seen corresponding path program 4 times [2019-08-05 10:44:05,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,032 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-05 10:44:06,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:06,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:06,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:06,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:06,034 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 8 states. [2019-08-05 10:44:06,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,102 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-08-05 10:44:06,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:06,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:44:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,104 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:44:06,104 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:44:06,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:44:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2019-08-05 10:44:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:44:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 10:44:06,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2019-08-05 10:44:06,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,108 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 10:44:06,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:06,109 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 10:44:06,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:44:06,109 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,109 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:44:06,110 INFO L418 AbstractCegarLoop]: === Iteration 12 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1836082283, now seen corresponding path program 4 times [2019-08-05 10:44:06,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,120 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,255 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-05 10:44:06,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:06,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:06,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:06,257 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2019-08-05 10:44:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,325 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 10:44:06,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:06,326 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:44:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,327 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:44:06,327 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:44:06,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:44:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:44:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:44:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 10:44:06,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2019-08-05 10:44:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,330 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 10:44:06,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 10:44:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:44:06,331 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,331 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-08-05 10:44:06,332 INFO L418 AbstractCegarLoop]: === Iteration 13 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1860093829, now seen corresponding path program 5 times [2019-08-05 10:44:06,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:06,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:06,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:06,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:06,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:06,443 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2019-08-05 10:44:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,526 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 10:44:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:06,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:44:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,528 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:44:06,528 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:44:06,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:44:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:44:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:44:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 10:44:06,531 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2019-08-05 10:44:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,531 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 10:44:06,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 10:44:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:44:06,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,532 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2019-08-05 10:44:06,532 INFO L418 AbstractCegarLoop]: === Iteration 14 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1860868395, now seen corresponding path program 6 times [2019-08-05 10:44:06,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,541 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:06,650 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-05 10:44:06,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:06,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:06,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:06,652 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2019-08-05 10:44:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:06,941 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2019-08-05 10:44:06,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:06,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:44:06,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:06,943 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:44:06,943 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:44:06,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:44:06,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2019-08-05 10:44:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:44:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-08-05 10:44:06,946 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 8 [2019-08-05 10:44:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:06,946 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-08-05 10:44:06,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2019-08-05 10:44:06,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:44:06,947 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:06,947 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-08-05 10:44:06,948 INFO L418 AbstractCegarLoop]: === Iteration 15 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1860893381, now seen corresponding path program 4 times [2019-08-05 10:44:06,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:06,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:44:06,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,050 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-05 10:44:07,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:44:07,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:44:07,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:44:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:44:07,053 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2019-08-05 10:44:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,158 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2019-08-05 10:44:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:44:07,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:44:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,160 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:44:07,160 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:44:07,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:44:07,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2019-08-05 10:44:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:44:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2019-08-05 10:44:07,164 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 21 transitions. Word has length 8 [2019-08-05 10:44:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,164 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 21 transitions. [2019-08-05 10:44:07,164 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:44:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2019-08-05 10:44:07,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:44:07,165 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,165 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 10:44:07,165 INFO L418 AbstractCegarLoop]: === Iteration 16 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:07,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,166 INFO L82 PathProgramCache]: Analyzing trace with hash -516287163, now seen corresponding path program 5 times [2019-08-05 10:44:07,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,175 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,441 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:07,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:07,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:07,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:07,443 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand 9 states. [2019-08-05 10:44:07,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,523 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-08-05 10:44:07,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:07,524 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:44:07,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,525 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:44:07,525 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:44:07,526 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:07,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:44:07,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2019-08-05 10:44:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 10:44:07,529 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2019-08-05 10:44:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,529 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 10:44:07,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 10:44:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:44:07,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,530 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:44:07,530 INFO L418 AbstractCegarLoop]: === Iteration 17 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1083972063, now seen corresponding path program 7 times [2019-08-05 10:44:07,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,540 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:07,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:07,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:07,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:07,654 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-08-05 10:44:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:07,755 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-05 10:44:07,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:07,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:44:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:07,756 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:07,756 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:07,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:07,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:44:07,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 10:44:07,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2019-08-05 10:44:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:07,760 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 10:44:07,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 10:44:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:44:07,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:07,760 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-08-05 10:44:07,761 INFO L418 AbstractCegarLoop]: === Iteration 18 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1828329989, now seen corresponding path program 8 times [2019-08-05 10:44:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:07,770 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:07,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:07,898 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-05 10:44:07,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:07,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:07,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:07,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:07,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:07,900 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-08-05 10:44:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:08,018 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-05 10:44:08,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:08,019 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:44:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:08,020 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:08,020 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:08,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:08,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:08,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:44:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 10:44:08,024 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2019-08-05 10:44:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:08,024 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 10:44:08,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:08,024 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 10:44:08,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:44:08,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:08,024 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2019-08-05 10:44:08,025 INFO L418 AbstractCegarLoop]: === Iteration 19 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:08,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:08,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1852341535, now seen corresponding path program 9 times [2019-08-05 10:44:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:08,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:08,033 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:08,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:08,166 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-05 10:44:08,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:08,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:08,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:08,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:08,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:08,168 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-08-05 10:44:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:08,368 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-05 10:44:08,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:08,369 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:44:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:08,369 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:08,369 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:08,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:08,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:44:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 10:44:08,372 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2019-08-05 10:44:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:08,372 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 10:44:08,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 10:44:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:44:08,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:08,373 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2019-08-05 10:44:08,374 INFO L418 AbstractCegarLoop]: === Iteration 20 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:08,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1853116101, now seen corresponding path program 10 times [2019-08-05 10:44:08,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:08,388 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:08,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:08,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:08,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:08,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:08,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:08,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:08,781 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-08-05 10:44:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:09,195 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2019-08-05 10:44:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:09,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:44:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:09,197 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:44:09,197 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:44:09,197 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:44:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-08-05 10:44:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:44:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-08-05 10:44:09,200 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2019-08-05 10:44:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:09,201 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-08-05 10:44:09,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2019-08-05 10:44:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:44:09,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:09,202 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-08-05 10:44:09,202 INFO L418 AbstractCegarLoop]: === Iteration 21 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141087, now seen corresponding path program 5 times [2019-08-05 10:44:09,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:09,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:44:09,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:44:09,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:44:09,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:44:09,389 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-08-05 10:44:09,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:09,495 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-08-05 10:44:09,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:44:09,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:44:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:09,496 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:44:09,496 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:44:09,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:44:09,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2019-08-05 10:44:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:44:09,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2019-08-05 10:44:09,499 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 24 transitions. Word has length 9 [2019-08-05 10:44:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:09,500 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-08-05 10:44:09,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:44:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 24 transitions. [2019-08-05 10:44:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:09,500 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:09,500 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 10:44:09,501 INFO L418 AbstractCegarLoop]: === Iteration 22 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:09,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1174963269, now seen corresponding path program 6 times [2019-08-05 10:44:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,509 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:09,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:09,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:09,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:09,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:09,861 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. Second operand 10 states. [2019-08-05 10:44:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:09,950 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-08-05 10:44:09,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:09,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:44:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:09,953 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:44:09,953 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:44:09,954 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:44:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-08-05 10:44:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:09,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 10:44:09,957 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 10 [2019-08-05 10:44:09,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:09,957 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 10:44:09,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 10:44:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:09,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:09,958 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:44:09,958 INFO L418 AbstractCegarLoop]: === Iteration 23 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:09,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:09,958 INFO L82 PathProgramCache]: Analyzing trace with hash -756608277, now seen corresponding path program 11 times [2019-08-05 10:44:09,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:09,966 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:09,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:10,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:10,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:10,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:10,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:10,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:10,111 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 10:44:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:10,204 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 10:44:10,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:10,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:44:10,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:10,206 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:10,207 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:10,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:10,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:44:10,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:10,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 10:44:10,210 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 10 [2019-08-05 10:44:10,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:10,210 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 10:44:10,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:10,210 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 10:44:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:10,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:10,211 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1] [2019-08-05 10:44:10,211 INFO L418 AbstractCegarLoop]: === Iteration 24 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:10,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash 843650949, now seen corresponding path program 12 times [2019-08-05 10:44:10,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:10,219 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:10,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:10,483 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-05 10:44:10,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:10,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:10,484 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:10,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:10,485 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 10:44:10,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:10,617 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 10:44:10,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:10,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:44:10,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:10,618 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:10,618 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:10,619 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:10,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:10,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:44:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 10:44:10,622 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 10 [2019-08-05 10:44:10,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:10,622 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 10:44:10,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:10,622 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 10:44:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:10,623 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:10,623 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-08-05 10:44:10,623 INFO L418 AbstractCegarLoop]: === Iteration 25 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:10,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:10,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1588008875, now seen corresponding path program 13 times [2019-08-05 10:44:10,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:10,633 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:10,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:10,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:10,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:10,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:10,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:10,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:10,767 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 10:44:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:10,882 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 10:44:10,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:10,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:44:10,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:10,883 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:10,883 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:10,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:44:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 10:44:10,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 10 [2019-08-05 10:44:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:10,886 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 10:44:10,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 10:44:10,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:10,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:10,887 INFO L399 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1] [2019-08-05 10:44:10,887 INFO L418 AbstractCegarLoop]: === Iteration 26 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:10,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:10,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1612020421, now seen corresponding path program 14 times [2019-08-05 10:44:10,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:10,895 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:10,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,013 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-05 10:44:11,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:11,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:11,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:11,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:11,015 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 10:44:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,144 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 10:44:11,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:11,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:44:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,145 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:11,146 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:11,146 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:44:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 10:44:11,148 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 10 [2019-08-05 10:44:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,149 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 10:44:11,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 10:44:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:11,149 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,149 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1] [2019-08-05 10:44:11,150 INFO L418 AbstractCegarLoop]: === Iteration 27 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1612794987, now seen corresponding path program 15 times [2019-08-05 10:44:11,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,157 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:11,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:11,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:11,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:11,262 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 10:44:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,409 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2019-08-05 10:44:11,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:11,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:44:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,410 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:44:11,410 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:44:11,411 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:44:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-08-05 10:44:11,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:44:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-08-05 10:44:11,413 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 10 [2019-08-05 10:44:11,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,413 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-08-05 10:44:11,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2019-08-05 10:44:11,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:44:11,414 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,414 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-08-05 10:44:11,414 INFO L418 AbstractCegarLoop]: === Iteration 28 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1612819973, now seen corresponding path program 6 times [2019-08-05 10:44:11,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,420 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:44:11,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:44:11,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:44:11,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:44:11,528 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-08-05 10:44:11,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,665 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-08-05 10:44:11,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:44:11,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:44:11,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,666 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:44:11,666 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:44:11,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:11,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:44:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2019-08-05 10:44:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:44:11,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2019-08-05 10:44:11,668 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 10 [2019-08-05 10:44:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,669 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2019-08-05 10:44:11,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:44:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2019-08-05 10:44:11,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:11,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,670 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 10:44:11,670 INFO L418 AbstractCegarLoop]: === Iteration 29 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2064119109, now seen corresponding path program 7 times [2019-08-05 10:44:11,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,676 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:11,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:11,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:11,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:11,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:11,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:11,817 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand 11 states. [2019-08-05 10:44:11,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:11,916 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2019-08-05 10:44:11,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:11,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:11,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:11,918 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:44:11,918 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:44:11,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:44:11,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2019-08-05 10:44:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 10:44:11,922 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2019-08-05 10:44:11,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:11,922 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 10:44:11,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:11,922 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 10:44:11,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:11,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:11,926 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:44:11,926 INFO L418 AbstractCegarLoop]: === Iteration 30 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:11,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:11,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1980023969, now seen corresponding path program 16 times [2019-08-05 10:44:11,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:11,939 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:11,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:12,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:12,308 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 10:44:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,441 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-08-05 10:44:12,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:12,442 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:12,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,443 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:12,443 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:12,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:12,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:44:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:12,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 10:44:12,447 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2019-08-05 10:44:12,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,447 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 10:44:12,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 10:44:12,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:12,448 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,448 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1] [2019-08-05 10:44:12,448 INFO L418 AbstractCegarLoop]: === Iteration 31 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:12,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,448 INFO L82 PathProgramCache]: Analyzing trace with hash 383371781, now seen corresponding path program 17 times [2019-08-05 10:44:12,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,456 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:12,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:12,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:12,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:12,614 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 10:44:12,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:12,779 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-08-05 10:44:12,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:12,779 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:12,780 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:12,780 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:12,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:12,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:44:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:12,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 10:44:12,783 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2019-08-05 10:44:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:12,783 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 10:44:12,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 10:44:12,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:12,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:12,784 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-08-05 10:44:12,784 INFO L418 AbstractCegarLoop]: === Iteration 32 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:12,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1983631007, now seen corresponding path program 18 times [2019-08-05 10:44:12,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:12,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:12,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:12,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:12,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:12,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:12,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:12,899 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 10:44:13,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,047 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-08-05 10:44:13,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:13,047 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,048 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:13,048 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:13,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:13,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:44:13,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 10:44:13,051 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2019-08-05 10:44:13,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,052 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 10:44:13,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:13,052 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 10:44:13,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:13,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,053 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-08-05 10:44:13,053 INFO L418 AbstractCegarLoop]: === Iteration 33 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:13,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1566978363, now seen corresponding path program 19 times [2019-08-05 10:44:13,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:13,167 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:13,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:13,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:13,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:13,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:13,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:13,169 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 10:44:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,339 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-08-05 10:44:13,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:13,340 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,341 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:13,341 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:13,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:13,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:13,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:44:13,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:13,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 10:44:13,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2019-08-05 10:44:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,344 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 10:44:13,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 10:44:13,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:13,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,345 INFO L399 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1, 1] [2019-08-05 10:44:13,345 INFO L418 AbstractCegarLoop]: === Iteration 34 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:13,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1542966817, now seen corresponding path program 20 times [2019-08-05 10:44:13,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,353 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:13,472 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:13,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:13,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:13,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:13,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:13,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:13,474 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 10:44:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,627 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-08-05 10:44:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:13,627 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,628 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:13,628 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:13,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:44:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 10:44:13,631 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2019-08-05 10:44:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,632 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 10:44:13,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 10:44:13,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:13,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,632 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1] [2019-08-05 10:44:13,633 INFO L418 AbstractCegarLoop]: === Iteration 35 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:13,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1542192251, now seen corresponding path program 21 times [2019-08-05 10:44:13,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,639 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:13,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:13,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:13,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:13,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:13,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:13,826 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 10:44:13,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:13,986 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2019-08-05 10:44:13,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:13,987 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:13,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:13,987 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:44:13,987 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:44:13,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:44:13,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2019-08-05 10:44:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:44:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-08-05 10:44:13,990 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2019-08-05 10:44:13,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:13,990 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2019-08-05 10:44:13,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2019-08-05 10:44:13,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:44:13,991 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:13,991 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-08-05 10:44:13,991 INFO L418 AbstractCegarLoop]: === Iteration 36 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:13,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:13,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1542167265, now seen corresponding path program 7 times [2019-08-05 10:44:13,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:13,997 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:44:13,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:14,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:14,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:44:14,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:44:14,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:44:14,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:44:14,193 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-08-05 10:44:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:14,433 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-08-05 10:44:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:44:14,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:44:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:14,434 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:44:14,435 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:44:14,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:14,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:44:14,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-08-05 10:44:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:44:14,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-08-05 10:44:14,438 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 11 [2019-08-05 10:44:14,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:14,438 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-08-05 10:44:14,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:44:14,438 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2019-08-05 10:44:14,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:14,439 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:14,439 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 10:44:14,439 INFO L418 AbstractCegarLoop]: === Iteration 37 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:14,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:14,440 INFO L82 PathProgramCache]: Analyzing trace with hash -436820923, now seen corresponding path program 8 times [2019-08-05 10:44:14,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:14,445 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:14,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:14,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:14,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:14,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:14,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:14,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:14,588 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 12 states. [2019-08-05 10:44:15,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,118 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-08-05 10:44:15,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:15,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:15,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,119 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:44:15,119 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:44:15,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:44:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-08-05 10:44:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:15,121 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,121 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:15,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:15,122 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:15,122 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,122 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:44:15,122 INFO L418 AbstractCegarLoop]: === Iteration 38 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1251204757, now seen corresponding path program 22 times [2019-08-05 10:44:15,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,129 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:15,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:15,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:15,317 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,480 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:44:15,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:15,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,481 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:15,481 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:15,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:15,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:44:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:15,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:15,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,484 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:15,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:15,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:15,485 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,485 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1] [2019-08-05 10:44:15,485 INFO L418 AbstractCegarLoop]: === Iteration 39 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1000380539, now seen corresponding path program 23 times [2019-08-05 10:44:15,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:15,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:15,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:15,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:15,646 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:15,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:15,779 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:44:15,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:15,779 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:15,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:15,780 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:15,780 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:15,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:15,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:44:15,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:15,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:15,783 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:15,783 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:15,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:15,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:15,784 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1] [2019-08-05 10:44:15,784 INFO L418 AbstractCegarLoop]: === Iteration 40 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:15,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1363015211, now seen corresponding path program 24 times [2019-08-05 10:44:15,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:15,789 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:15,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:15,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:15,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:15,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:15,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:15,904 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:16,050 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:44:16,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:16,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:16,051 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:16,051 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:16,052 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:16,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:16,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:44:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:16,054 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:16,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:16,055 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:16,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:16,055 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:16,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:16,055 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:16,055 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-08-05 10:44:16,055 INFO L418 AbstractCegarLoop]: === Iteration 41 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:16,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1331692859, now seen corresponding path program 25 times [2019-08-05 10:44:16,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,233 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:16,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:16,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:16,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:16,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:16,235 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:16,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:16,592 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:44:16,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:16,592 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:16,593 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:16,593 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:16,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:16,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:44:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:16,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:16,596 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:16,596 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:16,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:16,596 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:16,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:16,597 INFO L399 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1] [2019-08-05 10:44:16,597 INFO L418 AbstractCegarLoop]: === Iteration 42 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:16,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash -587334933, now seen corresponding path program 26 times [2019-08-05 10:44:16,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,604 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:16,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:16,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:16,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:16,734 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:16,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:16,948 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:44:16,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:16,948 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:16,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:16,949 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:16,949 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:16,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:16,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:44:16,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:16,951 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:16,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:16,951 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:16,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:16,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:16,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:16,952 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:16,952 INFO L399 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1, 1] [2019-08-05 10:44:16,952 INFO L418 AbstractCegarLoop]: === Iteration 43 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:16,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:16,953 INFO L82 PathProgramCache]: Analyzing trace with hash -563323387, now seen corresponding path program 27 times [2019-08-05 10:44:16,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:16,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:16,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:17,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:17,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:17,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:17,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:17,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:17,259 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:17,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:17,449 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:44:17,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:17,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:17,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:17,450 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:17,450 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:17,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:44:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:17,452 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:17,453 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:17,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:17,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:17,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:17,453 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1] [2019-08-05 10:44:17,453 INFO L418 AbstractCegarLoop]: === Iteration 44 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:17,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:17,454 INFO L82 PathProgramCache]: Analyzing trace with hash -562548821, now seen corresponding path program 28 times [2019-08-05 10:44:17,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:17,458 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:17,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:17,928 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:17,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:17,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:17,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:17,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:17,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:17,930 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:18,123 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2019-08-05 10:44:18,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:18,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:18,125 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:44:18,125 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:44:18,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:44:18,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2019-08-05 10:44:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:44:18,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-08-05 10:44:18,127 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 12 [2019-08-05 10:44:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:18,127 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-08-05 10:44:18,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:18,128 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2019-08-05 10:44:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:44:18,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:18,128 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-08-05 10:44:18,128 INFO L418 AbstractCegarLoop]: === Iteration 45 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:18,129 INFO L82 PathProgramCache]: Analyzing trace with hash -562523835, now seen corresponding path program 8 times [2019-08-05 10:44:18,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:18,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:44:18,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:18,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:18,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:44:18,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:44:18,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:44:18,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:44:18,393 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-08-05 10:44:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:18,581 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2019-08-05 10:44:18,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:44:18,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:44:18,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:18,582 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:44:18,582 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:44:18,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:44:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-08-05 10:44:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:44:18,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-08-05 10:44:18,584 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 12 [2019-08-05 10:44:18,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:18,585 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-08-05 10:44:18,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:44:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2019-08-05 10:44:18,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:18,585 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:18,585 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 10:44:18,586 INFO L418 AbstractCegarLoop]: === Iteration 46 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:18,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:18,586 INFO L82 PathProgramCache]: Analyzing trace with hash -656550587, now seen corresponding path program 9 times [2019-08-05 10:44:18,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:18,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:18,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:19,216 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:44:19,454 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:44:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:19,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:19,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:19,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:19,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:19,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:19,640 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand 13 states. [2019-08-05 10:44:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:19,772 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-08-05 10:44:19,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:19,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:19,774 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:44:19,774 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:44:19,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:44:19,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2019-08-05 10:44:19,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:19,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:19,776 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:19,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:19,776 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:19,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:19,777 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:19,777 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:19,777 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:44:19,777 INFO L418 AbstractCegarLoop]: === Iteration 47 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:19,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:19,778 INFO L82 PathProgramCache]: Analyzing trace with hash -132645665, now seen corresponding path program 29 times [2019-08-05 10:44:19,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:19,783 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:19,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:19,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:19,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:19,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:19,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:19,958 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:20,101 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:20,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:20,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:20,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:20,102 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:20,102 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:20,103 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:20,104 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:20,105 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:20,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:20,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:20,105 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:20,105 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1] [2019-08-05 10:44:20,106 INFO L418 AbstractCegarLoop]: === Iteration 48 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:20,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:20,106 INFO L82 PathProgramCache]: Analyzing trace with hash -947029499, now seen corresponding path program 30 times [2019-08-05 10:44:20,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:20,111 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:20,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:20,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:20,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:20,254 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:20,410 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:20,411 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:20,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:20,411 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:20,411 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:20,412 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:20,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:20,414 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:20,414 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:20,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:20,415 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:20,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:20,415 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:20,415 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1] [2019-08-05 10:44:20,415 INFO L418 AbstractCegarLoop]: === Iteration 49 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:20,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash -696205281, now seen corresponding path program 31 times [2019-08-05 10:44:20,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:20,421 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:20,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:20,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:20,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:20,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:20,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:20,604 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:20,797 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:20,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:20,798 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:20,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:20,798 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:20,798 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:20,799 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:20,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:20,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:20,801 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:20,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:20,801 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:20,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:20,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:20,802 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:20,802 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2019-08-05 10:44:20,803 INFO L418 AbstractCegarLoop]: === Iteration 50 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:20,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:20,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1667190469, now seen corresponding path program 32 times [2019-08-05 10:44:20,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:20,808 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:20,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:20,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:20,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:20,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:20,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:20,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:20,963 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:21,135 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:21,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:21,135 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:21,136 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:21,136 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:21,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:21,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:21,139 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:21,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:21,139 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:21,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:21,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:21,140 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2019-08-05 10:44:21,140 INFO L418 AbstractCegarLoop]: === Iteration 51 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1027517601, now seen corresponding path program 33 times [2019-08-05 10:44:21,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:21,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:21,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:21,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:21,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:21,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:21,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:21,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:21,435 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:21,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:21,629 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:21,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:21,630 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:21,631 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:21,631 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:21,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:21,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:21,633 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:21,633 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:21,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:21,634 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:21,634 INFO L399 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1] [2019-08-05 10:44:21,634 INFO L418 AbstractCegarLoop]: === Iteration 52 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:21,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:21,635 INFO L82 PathProgramCache]: Analyzing trace with hash -283159675, now seen corresponding path program 34 times [2019-08-05 10:44:21,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:21,640 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:21,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:22,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:22,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:22,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:22,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:22,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:22,137 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,292 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:23,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:23,292 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:23,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,293 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:23,293 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:23,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:23,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:23,295 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:23,296 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:23,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:23,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:23,297 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:23,297 INFO L399 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1, 1] [2019-08-05 10:44:23,297 INFO L418 AbstractCegarLoop]: === Iteration 53 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:23,297 INFO L82 PathProgramCache]: Analyzing trace with hash -259148129, now seen corresponding path program 35 times [2019-08-05 10:44:23,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:23,302 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:23,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:23,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:23,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:23,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:23,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:23,431 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:23,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,632 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:23,632 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:23,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,633 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:23,633 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:23,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:23,636 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:23,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:23,636 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:23,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:23,637 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:23,637 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1] [2019-08-05 10:44:23,637 INFO L418 AbstractCegarLoop]: === Iteration 54 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:23,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:23,637 INFO L82 PathProgramCache]: Analyzing trace with hash -258373563, now seen corresponding path program 36 times [2019-08-05 10:44:23,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:23,642 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:23,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,785 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:23,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:23,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:23,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:23,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:23,787 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:23,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,998 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2019-08-05 10:44:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:23,999 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:23,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,999 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:44:23,999 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:44:24,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:24,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:44:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-08-05 10:44:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:44:24,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-08-05 10:44:24,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2019-08-05 10:44:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:24,002 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-08-05 10:44:24,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:24,002 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-08-05 10:44:24,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:44:24,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:24,002 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-08-05 10:44:24,003 INFO L418 AbstractCegarLoop]: === Iteration 55 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:24,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:24,003 INFO L82 PathProgramCache]: Analyzing trace with hash -258348577, now seen corresponding path program 9 times [2019-08-05 10:44:24,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:24,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:44:24,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:24,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:24,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:44:24,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:44:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:44:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:44:24,184 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-08-05 10:44:24,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:24,474 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-08-05 10:44:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:44:24,475 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:44:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:24,476 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:44:24,476 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:44:24,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:44:24,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2019-08-05 10:44:24,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:44:24,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2019-08-05 10:44:24,478 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 13 [2019-08-05 10:44:24,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:24,478 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2019-08-05 10:44:24,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:44:24,478 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2019-08-05 10:44:24,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:24,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:24,478 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 10:44:24,479 INFO L418 AbstractCegarLoop]: === Iteration 56 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:24,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1121764421, now seen corresponding path program 10 times [2019-08-05 10:44:24,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:24,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:24,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:24,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:24,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:24,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:24,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:24,761 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand 14 states. [2019-08-05 10:44:24,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:24,912 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2019-08-05 10:44:24,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:24,913 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:24,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:24,913 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:44:24,914 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:44:24,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:44:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2019-08-05 10:44:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:24,916 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:24,916 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:24,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:24,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:24,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:24,917 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:44:24,917 INFO L418 AbstractCegarLoop]: === Iteration 57 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:24,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:24,917 INFO L82 PathProgramCache]: Analyzing trace with hash 182947819, now seen corresponding path program 37 times [2019-08-05 10:44:24,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:24,923 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:24,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:25,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:25,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:25,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:25,145 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:25,308 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:25,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:25,309 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:25,309 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:25,309 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:25,310 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:25,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:25,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:25,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:25,311 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:25,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:25,311 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:25,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:25,312 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:25,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:25,312 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1] [2019-08-05 10:44:25,312 INFO L418 AbstractCegarLoop]: === Iteration 58 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:25,313 INFO L82 PathProgramCache]: Analyzing trace with hash 706852741, now seen corresponding path program 38 times [2019-08-05 10:44:25,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:25,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:25,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:25,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:25,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:25,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:25,462 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:25,633 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:25,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:25,634 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:25,634 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:25,635 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:25,635 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:25,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:25,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:25,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:25,637 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:25,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:25,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:25,638 INFO L399 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1] [2019-08-05 10:44:25,638 INFO L418 AbstractCegarLoop]: === Iteration 59 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash -107531093, now seen corresponding path program 39 times [2019-08-05 10:44:25,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:25,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:25,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:25,870 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:25,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:25,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:25,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:25,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:25,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:25,872 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:26,080 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:26,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:26,081 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:26,081 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:26,082 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:26,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:26,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:26,084 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:26,084 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:26,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:26,085 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:26,085 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1] [2019-08-05 10:44:26,085 INFO L418 AbstractCegarLoop]: === Iteration 60 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 143293125, now seen corresponding path program 40 times [2019-08-05 10:44:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:26,089 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:26,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:26,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:26,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:26,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:26,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:26,347 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:26,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:26,542 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:26,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:26,542 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:26,543 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:26,543 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:26,543 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:26,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:26,546 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:26,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:26,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:26,547 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-08-05 10:44:26,547 INFO L418 AbstractCegarLoop]: === Iteration 61 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:26,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1788278421, now seen corresponding path program 41 times [2019-08-05 10:44:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:26,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:26,553 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:26,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:26,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:26,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:26,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:26,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:26,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:26,720 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:26,931 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:26,932 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:26,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:26,932 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:26,932 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:26,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:26,935 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:26,935 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:26,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:26,936 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:26,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:26,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:26,936 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1] [2019-08-05 10:44:26,936 INFO L418 AbstractCegarLoop]: === Iteration 62 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:26,936 INFO L82 PathProgramCache]: Analyzing trace with hash -188019195, now seen corresponding path program 42 times [2019-08-05 10:44:26,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:26,942 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:26,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:27,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:27,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:27,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:27,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:27,165 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:27,395 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:27,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:27,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:27,397 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:27,397 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:27,397 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:27,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:27,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:27,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:27,400 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:27,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:27,401 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:27,401 INFO L399 BasicCegarLoop]: trace histogram [7, 3, 1, 1, 1, 1] [2019-08-05 10:44:27,401 INFO L418 AbstractCegarLoop]: === Iteration 63 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:27,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:27,401 INFO L82 PathProgramCache]: Analyzing trace with hash 556338731, now seen corresponding path program 43 times [2019-08-05 10:44:27,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:27,407 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:27,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:27,557 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:27,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:27,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:27,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:27,558 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:27,787 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:27,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:27,787 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:27,788 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:27,788 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:27,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:27,790 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:27,790 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:27,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:27,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:27,791 INFO L399 BasicCegarLoop]: trace histogram [8, 2, 1, 1, 1, 1] [2019-08-05 10:44:27,791 INFO L418 AbstractCegarLoop]: === Iteration 64 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:27,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:27,792 INFO L82 PathProgramCache]: Analyzing trace with hash 580350277, now seen corresponding path program 44 times [2019-08-05 10:44:27,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:27,797 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:27,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:27,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:27,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:27,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:27,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:27,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:27,973 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:28,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:28,217 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:28,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:28,218 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:28,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:28,218 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:28,218 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:28,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:28,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:28,221 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:28,221 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:28,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:28,222 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:28,222 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1] [2019-08-05 10:44:28,223 INFO L418 AbstractCegarLoop]: === Iteration 65 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:28,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash 581124843, now seen corresponding path program 45 times [2019-08-05 10:44:28,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:28,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:28,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:28,636 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:28,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:28,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:28,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:28,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:28,638 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:28,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:28,887 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-08-05 10:44:28,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:28,888 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:28,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:28,888 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:44:28,888 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:44:28,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:44:28,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-08-05 10:44:28,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:44:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-08-05 10:44:28,891 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 14 [2019-08-05 10:44:28,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:28,891 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-08-05 10:44:28,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2019-08-05 10:44:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:44:28,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:28,892 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-08-05 10:44:28,892 INFO L418 AbstractCegarLoop]: === Iteration 66 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:28,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 581149829, now seen corresponding path program 10 times [2019-08-05 10:44:28,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:28,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:44:28,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:29,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:29,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:44:29,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:44:29,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:44:29,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:44:29,141 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-08-05 10:44:29,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:29,419 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2019-08-05 10:44:29,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:44:29,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:44:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:29,419 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:44:29,419 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:44:29,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:29,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:44:29,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-08-05 10:44:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:44:29,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-08-05 10:44:29,421 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 14 [2019-08-05 10:44:29,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:29,421 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-08-05 10:44:29,421 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:44:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-08-05 10:44:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:29,421 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:29,422 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 10:44:29,422 INFO L418 AbstractCegarLoop]: === Iteration 67 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:29,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:29,422 INFO L82 PathProgramCache]: Analyzing trace with hash 414954821, now seen corresponding path program 11 times [2019-08-05 10:44:29,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:29,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:29,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:29,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:29,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:29,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:29,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:29,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:29,802 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 15 states. [2019-08-05 10:44:29,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:29,988 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-08-05 10:44:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:29,989 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:29,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:29,989 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:44:29,989 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:44:29,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:44:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-08-05 10:44:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:29,992 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:29,992 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:29,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:29,993 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:29,993 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:44:29,993 INFO L418 AbstractCegarLoop]: === Iteration 68 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:29,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:29,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1376411231, now seen corresponding path program 46 times [2019-08-05 10:44:29,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:29,998 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:29,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:30,277 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:30,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:30,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:30,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:30,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:30,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:30,278 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:30,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:30,481 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:30,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:30,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:30,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:30,483 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:30,483 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:30,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:30,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:30,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:30,485 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:30,486 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:30,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:30,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:30,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:30,486 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1] [2019-08-05 10:44:30,487 INFO L418 AbstractCegarLoop]: === Iteration 69 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:30,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:30,487 INFO L82 PathProgramCache]: Analyzing trace with hash 437594629, now seen corresponding path program 47 times [2019-08-05 10:44:30,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:30,491 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:30,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:30,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:30,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:30,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:30,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:30,724 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:30,927 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:30,928 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:30,928 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:30,929 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:30,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:30,931 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:30,931 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:30,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:30,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:30,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:30,932 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1] [2019-08-05 10:44:30,932 INFO L418 AbstractCegarLoop]: === Iteration 70 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:30,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:30,932 INFO L82 PathProgramCache]: Analyzing trace with hash 961499551, now seen corresponding path program 48 times [2019-08-05 10:44:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:30,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:30,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:31,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:31,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:31,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:31,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:31,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:31,098 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:31,305 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:31,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:31,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:31,306 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:31,307 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:31,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:31,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:31,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:31,308 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:31,309 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:31,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:31,309 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:31,309 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1] [2019-08-05 10:44:31,309 INFO L418 AbstractCegarLoop]: === Iteration 71 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:31,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash 147115717, now seen corresponding path program 49 times [2019-08-05 10:44:31,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:31,314 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:31,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:31,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:31,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:31,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:31,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:31,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:31,596 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:31,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:31,823 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:31,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:31,824 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:31,825 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:31,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:31,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:31,826 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:31,827 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:31,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:31,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:31,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:31,828 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-08-05 10:44:31,828 INFO L418 AbstractCegarLoop]: === Iteration 72 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:31,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:31,828 INFO L82 PathProgramCache]: Analyzing trace with hash 397939935, now seen corresponding path program 50 times [2019-08-05 10:44:31,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:31,833 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:31,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:32,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:32,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:32,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:32,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:32,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:32,001 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:32,261 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:32,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:32,262 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:32,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:32,262 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:32,262 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:32,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:32,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:32,265 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:32,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:32,266 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:32,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:32,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:32,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:32,266 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-08-05 10:44:32,267 INFO L418 AbstractCegarLoop]: === Iteration 73 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:32,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:32,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1533631611, now seen corresponding path program 51 times [2019-08-05 10:44:32,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:32,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:32,272 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:32,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:32,436 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:32,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:32,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:32,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:32,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:32,438 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:32,683 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:32,684 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:32,685 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:32,685 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:32,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:32,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:32,687 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:32,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:32,688 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:32,688 INFO L399 BasicCegarLoop]: trace histogram [7, 4, 1, 1, 1, 1] [2019-08-05 10:44:32,688 INFO L418 AbstractCegarLoop]: === Iteration 74 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 66627615, now seen corresponding path program 52 times [2019-08-05 10:44:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:32,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:32,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:32,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:32,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:32,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:32,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:32,881 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,135 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:33,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:33,135 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,136 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:33,136 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:33,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:33,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:33,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:33,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:33,138 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:33,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,139 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:33,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:33,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:33,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,139 INFO L399 BasicCegarLoop]: trace histogram [8, 3, 1, 1, 1, 1] [2019-08-05 10:44:33,139 INFO L418 AbstractCegarLoop]: === Iteration 75 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:33,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,140 INFO L82 PathProgramCache]: Analyzing trace with hash 810985541, now seen corresponding path program 53 times [2019-08-05 10:44:33,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,144 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:33,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:33,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:33,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:33,372 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,647 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:33,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:33,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:33,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,648 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:33,648 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:33,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:33,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,650 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:33,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:33,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,651 INFO L399 BasicCegarLoop]: trace histogram [9, 2, 1, 1, 1, 1] [2019-08-05 10:44:33,651 INFO L418 AbstractCegarLoop]: === Iteration 76 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:33,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash 834997087, now seen corresponding path program 54 times [2019-08-05 10:44:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,655 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:33,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:33,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:33,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:33,842 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:34,116 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:34,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:34,117 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:34,117 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:34,117 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:34,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:34,120 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:34,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:34,120 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:34,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:34,120 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:34,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:34,121 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:34,121 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2019-08-05 10:44:34,121 INFO L418 AbstractCegarLoop]: === Iteration 77 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:34,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 835771653, now seen corresponding path program 55 times [2019-08-05 10:44:34,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:34,127 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:34,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:34,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:34,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:34,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:34,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:34,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:34,921 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:35,208 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2019-08-05 10:44:35,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:35,209 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:35,209 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:44:35,210 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:44:35,210 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:44:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-08-05 10:44:35,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:44:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-08-05 10:44:35,212 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2019-08-05 10:44:35,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:35,212 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2019-08-05 10:44:35,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:35,212 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2019-08-05 10:44:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:44:35,212 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:35,212 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-08-05 10:44:35,212 INFO L418 AbstractCegarLoop]: === Iteration 78 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:35,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:35,213 INFO L82 PathProgramCache]: Analyzing trace with hash 835796639, now seen corresponding path program 11 times [2019-08-05 10:44:35,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:35,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:44:35,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:35,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:35,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:44:35,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:44:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:44:35,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:44:35,385 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-08-05 10:44:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:35,694 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2019-08-05 10:44:35,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:44:35,694 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:44:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:35,695 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:44:35,695 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:44:35,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:44:35,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2019-08-05 10:44:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:44:35,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-08-05 10:44:35,697 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 15 [2019-08-05 10:44:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:35,698 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-08-05 10:44:35,698 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:44:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2019-08-05 10:44:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:35,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:35,698 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 10:44:35,699 INFO L418 AbstractCegarLoop]: === Iteration 79 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash -21306299, now seen corresponding path program 12 times [2019-08-05 10:44:35,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:35,704 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:35,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:35,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:35,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:35,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:35,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:35,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:35,914 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 16 states. [2019-08-05 10:44:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:36,111 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2019-08-05 10:44:36,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:36,112 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:36,113 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:44:36,113 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:44:36,113 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:44:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2019-08-05 10:44:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:36,115 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:36,115 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:36,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:36,116 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:36,116 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 10:44:36,116 INFO L418 AbstractCegarLoop]: === Iteration 80 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash -280928661, now seen corresponding path program 56 times [2019-08-05 10:44:36,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:36,122 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:36,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:36,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:36,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:36,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:36,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:36,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:36,334 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:36,567 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:36,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:36,568 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:36,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:36,568 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:36,568 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:36,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:36,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:36,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:36,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:36,571 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:36,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:36,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:36,572 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:36,572 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1] [2019-08-05 10:44:36,572 INFO L418 AbstractCegarLoop]: === Iteration 81 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash 680527749, now seen corresponding path program 57 times [2019-08-05 10:44:36,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:36,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:36,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:36,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:36,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:36,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:36,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:36,791 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:37,018 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:37,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:37,019 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:37,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:37,019 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:37,019 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:37,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:37,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:37,021 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:37,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:37,022 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:37,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:37,022 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:37,022 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1] [2019-08-05 10:44:37,023 INFO L418 AbstractCegarLoop]: === Iteration 82 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:37,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -258288853, now seen corresponding path program 58 times [2019-08-05 10:44:37,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:37,028 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:37,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:37,159 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:44:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:37,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:37,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:37,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:37,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:37,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:37,507 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:37,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:37,740 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:37,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:37,740 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:37,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:37,741 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:37,741 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:37,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:37,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:37,743 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:37,743 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:37,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:37,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:37,744 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1] [2019-08-05 10:44:37,744 INFO L418 AbstractCegarLoop]: === Iteration 83 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:37,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:37,744 INFO L82 PathProgramCache]: Analyzing trace with hash 265616069, now seen corresponding path program 59 times [2019-08-05 10:44:37,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:37,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:37,748 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:37,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:37,930 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:37,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:37,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:37,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:37,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:37,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:37,931 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:38,173 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:38,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:38,174 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:38,174 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:38,174 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:38,175 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:38,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:38,176 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:38,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:38,176 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:38,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:38,177 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:38,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:38,177 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1] [2019-08-05 10:44:38,177 INFO L418 AbstractCegarLoop]: === Iteration 84 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:38,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:38,177 INFO L82 PathProgramCache]: Analyzing trace with hash -548767765, now seen corresponding path program 60 times [2019-08-05 10:44:38,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:38,182 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:38,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:38,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:38,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:38,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:38,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:38,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:38,434 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:38,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:38,690 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:38,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:38,691 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:38,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:38,692 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:38,692 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:38,692 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:38,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:38,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:38,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:38,694 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:38,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:38,694 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:38,695 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-08-05 10:44:38,695 INFO L418 AbstractCegarLoop]: === Iteration 85 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash -297943547, now seen corresponding path program 61 times [2019-08-05 10:44:38,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:38,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:38,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:38,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:38,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:38,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:38,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:38,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:38,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:38,934 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:39,207 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:39,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:39,208 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:39,208 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:39,208 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:39,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:39,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:39,210 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:39,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:39,211 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:39,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:39,211 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:39,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:39,211 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:39,211 INFO L399 BasicCegarLoop]: trace histogram [7, 5, 1, 1, 1, 1] [2019-08-05 10:44:39,212 INFO L418 AbstractCegarLoop]: === Iteration 86 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:39,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2065452203, now seen corresponding path program 62 times [2019-08-05 10:44:39,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:39,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:39,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:39,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:39,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:39,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:39,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:39,404 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:39,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:39,722 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:39,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:39,724 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:39,724 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:39,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:39,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:39,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:39,725 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:39,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:39,726 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:39,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:39,726 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:39,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:39,726 INFO L399 BasicCegarLoop]: trace histogram [8, 4, 1, 1, 1, 1] [2019-08-05 10:44:39,727 INFO L418 AbstractCegarLoop]: === Iteration 87 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:39,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -629255867, now seen corresponding path program 63 times [2019-08-05 10:44:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:39,732 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:39,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:40,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:40,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:40,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:40,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:40,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:40,014 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:40,312 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:40,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:40,312 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:40,313 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:40,313 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:40,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:40,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:40,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:40,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:40,315 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:40,316 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:40,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:40,316 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:40,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:40,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:40,316 INFO L399 BasicCegarLoop]: trace histogram [9, 3, 1, 1, 1, 1] [2019-08-05 10:44:40,317 INFO L418 AbstractCegarLoop]: === Iteration 88 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:40,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:40,317 INFO L82 PathProgramCache]: Analyzing trace with hash 115102059, now seen corresponding path program 64 times [2019-08-05 10:44:40,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:40,322 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:40,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:40,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:40,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:40,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:40,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:40,562 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:40,872 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:40,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:40,872 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:40,873 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:40,873 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:40,873 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:40,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:40,875 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:40,876 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:40,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:40,876 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:40,876 INFO L399 BasicCegarLoop]: trace histogram [10, 2, 1, 1, 1, 1] [2019-08-05 10:44:40,877 INFO L418 AbstractCegarLoop]: === Iteration 89 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash 139113605, now seen corresponding path program 65 times [2019-08-05 10:44:40,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:40,881 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:40,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:41,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:41,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:41,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:41,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:41,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:41,089 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:41,416 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:41,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:41,416 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:41,417 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:41,417 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:41,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:41,419 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:41,419 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:41,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:41,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:41,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:41,420 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1] [2019-08-05 10:44:41,421 INFO L418 AbstractCegarLoop]: === Iteration 90 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash 139888171, now seen corresponding path program 66 times [2019-08-05 10:44:41,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:41,426 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:41,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:41,608 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:41,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:41,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:41,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:41,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:41,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:41,610 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:41,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:41,941 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2019-08-05 10:44:41,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:41,941 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:41,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:41,942 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:44:41,942 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:44:41,942 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:44:41,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-08-05 10:44:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:44:41,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-08-05 10:44:41,944 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 16 [2019-08-05 10:44:41,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:41,945 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-08-05 10:44:41,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:41,945 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2019-08-05 10:44:41,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:44:41,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:41,946 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-08-05 10:44:41,946 INFO L418 AbstractCegarLoop]: === Iteration 91 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:41,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:41,946 INFO L82 PathProgramCache]: Analyzing trace with hash 139913157, now seen corresponding path program 12 times [2019-08-05 10:44:41,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:41,950 WARN L254 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:44:41,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:42,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:42,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:44:42,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:44:42,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:44:42,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:44:42,128 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-08-05 10:44:42,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:42,491 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2019-08-05 10:44:42,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:44:42,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:44:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:42,493 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:44:42,493 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:44:42,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:44:42,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-08-05 10:44:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:44:42,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-08-05 10:44:42,495 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16 [2019-08-05 10:44:42,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:42,495 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-08-05 10:44:42,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:44:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-08-05 10:44:42,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:42,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:42,496 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 10:44:42,496 INFO L418 AbstractCegarLoop]: === Iteration 92 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash -660499131, now seen corresponding path program 13 times [2019-08-05 10:44:42,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:42,502 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:42,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:42,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:42,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:42,771 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:42,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:42,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:42,771 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 17 states. [2019-08-05 10:44:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:42,997 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2019-08-05 10:44:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:42,997 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:42,997 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:44:42,998 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:44:42,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:42,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:44:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-08-05 10:44:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:42,999 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:42,999 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:43,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:43,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:43,000 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:43,001 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-08-05 10:44:43,001 INFO L418 AbstractCegarLoop]: === Iteration 93 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash -118857761, now seen corresponding path program 67 times [2019-08-05 10:44:43,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:43,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:43,006 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:43,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:43,280 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:43,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:43,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:43,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:43,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:43,281 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:43,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:43,520 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:43,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:43,521 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:43,522 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:43,522 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:43,522 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:43,524 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:43,524 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:43,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:43,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:43,525 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:43,525 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1] [2019-08-05 10:44:43,525 INFO L418 AbstractCegarLoop]: === Iteration 94 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:43,525 INFO L82 PathProgramCache]: Analyzing trace with hash -378480123, now seen corresponding path program 68 times [2019-08-05 10:44:43,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:43,531 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:43,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:43,916 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:43,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:43,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:43,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:43,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:43,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:43,917 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:44,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:44,165 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:44,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:44,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:44,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:44,166 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:44,166 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:44,166 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:44,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:44,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:44,168 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:44,168 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:44,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:44,169 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:44,170 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1] [2019-08-05 10:44:44,170 INFO L418 AbstractCegarLoop]: === Iteration 95 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:44,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:44,170 INFO L82 PathProgramCache]: Analyzing trace with hash 582976287, now seen corresponding path program 69 times [2019-08-05 10:44:44,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:44,176 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:44,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:44,377 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:44,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:44,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:44,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:44,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:44,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:44,379 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:44,651 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:44,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:44,652 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:44,652 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:44,653 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:44,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:44,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:44,654 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:44,655 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:44,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:44,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:44,655 INFO L399 BasicCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1] [2019-08-05 10:44:44,655 INFO L418 AbstractCegarLoop]: === Iteration 96 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:44,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:44,656 INFO L82 PathProgramCache]: Analyzing trace with hash -355840315, now seen corresponding path program 70 times [2019-08-05 10:44:44,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:44,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:44,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:44,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:44,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:44,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:44,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:44,967 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:45,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:45,307 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:45,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:45,308 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:45,309 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:45,309 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:45,309 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:45,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:45,311 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:45,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:45,311 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:45,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:45,311 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:45,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:45,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:45,312 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1] [2019-08-05 10:44:45,312 INFO L418 AbstractCegarLoop]: === Iteration 97 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:45,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:45,312 INFO L82 PathProgramCache]: Analyzing trace with hash 168064607, now seen corresponding path program 71 times [2019-08-05 10:44:45,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:45,317 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:45,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:45,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:45,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:45,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:45,522 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:45,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:45,811 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:45,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:45,811 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:45,812 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:45,812 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:45,813 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:45,815 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:45,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:45,815 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:45,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:45,816 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:45,816 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2019-08-05 10:44:45,816 INFO L418 AbstractCegarLoop]: === Iteration 98 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:45,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:45,816 INFO L82 PathProgramCache]: Analyzing trace with hash -646319227, now seen corresponding path program 72 times [2019-08-05 10:44:45,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:45,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:45,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:45,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:46,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:46,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:46,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:46,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:46,136 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:46,436 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:46,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:46,438 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:46,438 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:46,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:46,440 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:46,441 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:46,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:46,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:46,441 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2019-08-05 10:44:46,442 INFO L418 AbstractCegarLoop]: === Iteration 99 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:46,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash -395495009, now seen corresponding path program 73 times [2019-08-05 10:44:46,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:46,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:46,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:46,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:46,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:46,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:46,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:46,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:46,735 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:47,052 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:47,053 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:47,053 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:47,054 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:47,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:47,055 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:47,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:47,056 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:47,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:47,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:47,056 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:47,057 INFO L399 BasicCegarLoop]: trace histogram [8, 5, 1, 1, 1, 1] [2019-08-05 10:44:47,057 INFO L418 AbstractCegarLoop]: === Iteration 100 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:47,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1967900741, now seen corresponding path program 74 times [2019-08-05 10:44:47,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:47,061 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:47,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:47,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:47,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:47,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:47,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:47,286 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:47,626 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:47,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:47,627 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:47,627 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:47,628 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:47,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:47,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:47,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:47,629 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:47,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:47,630 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:47,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:47,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:47,631 INFO L399 BasicCegarLoop]: trace histogram [9, 4, 1, 1, 1, 1] [2019-08-05 10:44:47,631 INFO L418 AbstractCegarLoop]: === Iteration 101 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash -726807329, now seen corresponding path program 75 times [2019-08-05 10:44:47,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:47,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:47,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:47,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:47,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:47,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:47,848 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:48,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:48,185 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:48,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:48,186 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:48,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:48,186 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:48,187 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:48,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:48,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:48,189 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:48,189 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:48,189 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:48,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:48,190 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:48,190 INFO L399 BasicCegarLoop]: trace histogram [10, 3, 1, 1, 1, 1] [2019-08-05 10:44:48,190 INFO L418 AbstractCegarLoop]: === Iteration 102 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:48,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 17550597, now seen corresponding path program 76 times [2019-08-05 10:44:48,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:48,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:48,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:48,472 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:48,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:48,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:48,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:48,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:48,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:48,473 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:49,427 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:44:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:49,614 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:49,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:49,614 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:49,615 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:49,615 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:49,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:49,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:49,617 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:49,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:49,617 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:49,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:49,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:49,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:49,618 INFO L399 BasicCegarLoop]: trace histogram [11, 2, 1, 1, 1, 1] [2019-08-05 10:44:49,618 INFO L418 AbstractCegarLoop]: === Iteration 103 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:49,619 INFO L82 PathProgramCache]: Analyzing trace with hash 41562143, now seen corresponding path program 77 times [2019-08-05 10:44:49,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:49,626 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:49,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:50,149 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:50,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:50,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:50,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:50,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:50,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:50,150 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:50,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:50,560 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:50,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:50,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:50,561 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:50,561 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:50,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:50,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:50,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:50,563 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:50,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:50,563 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:50,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:50,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:50,564 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:50,564 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1] [2019-08-05 10:44:50,564 INFO L418 AbstractCegarLoop]: === Iteration 104 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:50,564 INFO L82 PathProgramCache]: Analyzing trace with hash 42336709, now seen corresponding path program 78 times [2019-08-05 10:44:50,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:50,570 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:50,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:50,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:50,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:50,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:50,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:50,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:50,903 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:51,282 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2019-08-05 10:44:51,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:51,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:51,284 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:44:51,284 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:44:51,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:44:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2019-08-05 10:44:51,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:44:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-08-05 10:44:51,286 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2019-08-05 10:44:51,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:51,286 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-08-05 10:44:51,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2019-08-05 10:44:51,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:44:51,286 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:51,287 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-08-05 10:44:51,287 INFO L418 AbstractCegarLoop]: === Iteration 105 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:51,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:51,287 INFO L82 PathProgramCache]: Analyzing trace with hash 42361695, now seen corresponding path program 13 times [2019-08-05 10:44:51,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:51,292 WARN L254 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:44:51,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:51,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:51,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:44:51,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:44:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:44:51,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:44:51,493 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-08-05 10:44:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:51,895 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2019-08-05 10:44:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:44:51,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:44:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:51,896 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:44:51,896 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:44:51,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:44:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 33. [2019-08-05 10:44:51,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:44:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2019-08-05 10:44:51,898 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 17 [2019-08-05 10:44:51,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:51,898 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2019-08-05 10:44:51,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:44:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2019-08-05 10:44:51,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:51,899 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:51,899 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 10:44:51,899 INFO L418 AbstractCegarLoop]: === Iteration 106 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:51,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:51,900 INFO L82 PathProgramCache]: Analyzing trace with hash 999359557, now seen corresponding path program 14 times [2019-08-05 10:44:51,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:51,904 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:51,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:52,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:52,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:52,140 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:52,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:52,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:52,140 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 18 states. [2019-08-05 10:44:52,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:52,388 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2019-08-05 10:44:52,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:52,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:52,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:52,390 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:44:52,390 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:44:52,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:52,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:44:52,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2019-08-05 10:44:52,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:52,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:52,391 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:52,392 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:52,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:52,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:52,392 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-08-05 10:44:52,392 INFO L418 AbstractCegarLoop]: === Iteration 107 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:52,393 INFO L82 PathProgramCache]: Analyzing trace with hash 610372843, now seen corresponding path program 79 times [2019-08-05 10:44:52,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:52,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:52,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:52,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:52,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:52,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:52,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:52,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:52,617 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:52,901 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:52,902 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:52,902 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:52,903 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:52,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:52,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:52,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:52,905 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:52,906 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:52,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:52,906 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:52,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:52,906 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:52,907 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1] [2019-08-05 10:44:52,907 INFO L418 AbstractCegarLoop]: === Iteration 108 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:52,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:52,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1152014213, now seen corresponding path program 80 times [2019-08-05 10:44:52,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:52,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:52,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:53,144 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:53,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:53,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:53,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:53,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:53,145 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,433 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:53,433 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,434 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:53,434 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:53,435 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:53,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:53,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:53,437 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,437 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:53,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:53,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,437 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1] [2019-08-05 10:44:53,438 INFO L418 AbstractCegarLoop]: === Iteration 109 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash 892391851, now seen corresponding path program 81 times [2019-08-05 10:44:53,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,443 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:53,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:53,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:53,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:53,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:53,672 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:53,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:53,963 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:53,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:53,963 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:53,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:53,964 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:53,964 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:53,965 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:53,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:53,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:53,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:53,967 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:53,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:53,968 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:53,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:53,968 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:53,968 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:53,968 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1] [2019-08-05 10:44:53,969 INFO L418 AbstractCegarLoop]: === Iteration 110 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:53,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:53,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1853848261, now seen corresponding path program 82 times [2019-08-05 10:44:53,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:53,974 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:53,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:54,214 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:54,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:54,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:54,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:54,215 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:54,557 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:54,557 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:54,558 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:54,558 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:54,559 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:54,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:54,560 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:54,561 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:54,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:54,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:54,561 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:54,561 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1] [2019-08-05 10:44:54,562 INFO L418 AbstractCegarLoop]: === Iteration 111 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:54,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash 915031659, now seen corresponding path program 83 times [2019-08-05 10:44:54,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:54,567 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:54,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:54,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:54,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:54,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:54,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:54,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:54,849 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:55,268 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:55,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:55,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:55,270 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:55,270 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:55,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:55,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:55,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:55,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:55,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:55,271 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:55,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:55,272 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:55,272 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:55,272 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:55,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:55,272 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:55,272 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1] [2019-08-05 10:44:55,273 INFO L418 AbstractCegarLoop]: === Iteration 112 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:55,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1438936581, now seen corresponding path program 84 times [2019-08-05 10:44:55,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:55,279 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:55,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:55,413 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:44:55,720 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:55,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:55,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:55,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:55,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:55,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:55,721 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:56,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,079 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:56,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:56,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:56,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,080 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:56,080 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:56,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:56,083 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:56,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:56,083 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:56,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:56,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:56,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,084 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-08-05 10:44:56,084 INFO L418 AbstractCegarLoop]: === Iteration 113 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash 624552747, now seen corresponding path program 85 times [2019-08-05 10:44:56,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:56,090 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:56,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:56,361 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:56,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:56,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:56,362 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:56,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:56,363 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:56,735 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:56,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:56,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:56,736 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:56,736 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:56,736 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:56,738 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:56,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:56,738 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:56,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:56,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:56,739 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:56,739 INFO L399 BasicCegarLoop]: trace histogram [8, 6, 1, 1, 1, 1] [2019-08-05 10:44:56,740 INFO L418 AbstractCegarLoop]: === Iteration 114 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:56,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:56,740 INFO L82 PathProgramCache]: Analyzing trace with hash 875376965, now seen corresponding path program 86 times [2019-08-05 10:44:56,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:56,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:56,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:57,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:57,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:57,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:57,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:57,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:57,043 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:57,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:57,429 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:57,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:57,430 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:57,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:57,430 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:57,430 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:57,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:57,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:57,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:57,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:57,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:57,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:57,433 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:57,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:57,434 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:57,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:57,434 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:57,434 INFO L399 BasicCegarLoop]: trace histogram [9, 5, 1, 1, 1, 1] [2019-08-05 10:44:57,434 INFO L418 AbstractCegarLoop]: === Iteration 115 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:57,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:57,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1056194581, now seen corresponding path program 87 times [2019-08-05 10:44:57,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:57,441 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:57,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:57,719 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:44:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:58,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:58,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:58,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:58,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:58,022 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:58,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:58,416 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:58,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:58,417 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:58,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:58,418 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:58,418 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:58,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:58,422 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:58,422 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:58,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:58,422 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:58,423 INFO L399 BasicCegarLoop]: trace histogram [10, 4, 1, 1, 1, 1] [2019-08-05 10:44:58,423 INFO L418 AbstractCegarLoop]: === Iteration 116 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:58,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash 544064645, now seen corresponding path program 88 times [2019-08-05 10:44:58,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:58,429 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:58,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:58,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:58,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:58,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:58,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:58,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:58,676 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,170 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:59,171 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,171 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:59,171 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:59,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:59,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:59,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:59,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:59,173 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:59,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,174 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:59,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:59,174 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:59,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:59,174 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,174 INFO L399 BasicCegarLoop]: trace histogram [11, 3, 1, 1, 1, 1] [2019-08-05 10:44:59,174 INFO L418 AbstractCegarLoop]: === Iteration 117 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:59,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1288422571, now seen corresponding path program 89 times [2019-08-05 10:44:59,175 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:59,410 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:59,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:59,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:44:59,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:44:59,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:44:59,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:44:59,412 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:44:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:59,831 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:44:59,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:44:59,831 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:44:59,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:59,832 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:44:59,832 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:44:59,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:44:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:44:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:44:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:44:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:44:59,834 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:44:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:59,834 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:44:59,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:44:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:44:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:44:59,835 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:59,835 INFO L399 BasicCegarLoop]: trace histogram [12, 2, 1, 1, 1, 1] [2019-08-05 10:44:59,835 INFO L418 AbstractCegarLoop]: === Iteration 118 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:59,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:59,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1312434117, now seen corresponding path program 90 times [2019-08-05 10:44:59,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:59,840 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:44:59,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:00,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:45:00,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:45:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:45:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:00,101 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:45:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:00,615 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:45:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:45:00,615 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:45:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:00,616 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:45:00,616 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:45:00,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:45:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:45:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:45:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:45:00,618 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:45:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:00,618 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:45:00,618 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:45:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:45:00,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:45:00,619 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:00,619 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1] [2019-08-05 10:45:00,619 INFO L418 AbstractCegarLoop]: === Iteration 119 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1313208683, now seen corresponding path program 91 times [2019-08-05 10:45:00,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:00,625 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:45:00,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:00,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:00,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:45:00,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:45:00,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:45:00,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:00,851 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:45:01,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:01,301 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2019-08-05 10:45:01,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:45:01,302 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:45:01,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:01,302 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:45:01,302 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:45:01,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:45:01,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2019-08-05 10:45:01,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:45:01,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-08-05 10:45:01,305 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 18 [2019-08-05 10:45:01,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:01,305 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2019-08-05 10:45:01,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:45:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2019-08-05 10:45:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:45:01,306 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:01,306 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-08-05 10:45:01,306 INFO L418 AbstractCegarLoop]: === Iteration 120 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:01,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1313233669, now seen corresponding path program 14 times [2019-08-05 10:45:01,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:01,311 WARN L254 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:45:01,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,009 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:45:02,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:45:02,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:45:02,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:45:02,011 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-08-05 10:45:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:02,475 INFO L93 Difference]: Finished difference Result 50 states and 66 transitions. [2019-08-05 10:45:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:45:02,476 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:45:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:02,476 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:45:02,476 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:45:02,477 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:45:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-08-05 10:45:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:45:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2019-08-05 10:45:02,478 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 18 [2019-08-05 10:45:02,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:02,479 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2019-08-05 10:45:02,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:45:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2019-08-05 10:45:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:02,479 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:02,479 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 10:45:02,480 INFO L418 AbstractCegarLoop]: === Iteration 121 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:02,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash 915371333, now seen corresponding path program 15 times [2019-08-05 10:45:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:02,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:02,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:02,759 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:02,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:02,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:02,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:02,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:02,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:02,760 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 19 states. [2019-08-05 10:45:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,067 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-08-05 10:45:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:03,068 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,068 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:45:03,068 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:45:03,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:45:03,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2019-08-05 10:45:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:03,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:03,070 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:03,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,070 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:03,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:03,070 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:03,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:03,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,070 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-08-05 10:45:03,071 INFO L418 AbstractCegarLoop]: === Iteration 122 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1741685087, now seen corresponding path program 92 times [2019-08-05 10:45:03,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,075 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,364 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:03,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:03,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:03,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:03,365 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:03,676 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:03,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:03,676 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:03,677 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:03,677 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:03,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:03,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:03,679 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:03,679 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:03,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:03,679 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:03,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:03,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:03,680 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1] [2019-08-05 10:45:03,680 INFO L418 AbstractCegarLoop]: === Iteration 123 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:03,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1352698373, now seen corresponding path program 93 times [2019-08-05 10:45:03,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:03,685 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:03,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:03,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:03,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:03,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:03,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:03,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:03,934 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,256 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:04,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:04,257 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,257 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:04,257 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:04,258 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:04,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:04,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:04,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:04,260 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:04,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,261 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:04,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:04,261 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:04,261 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,261 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1] [2019-08-05 10:45:04,262 INFO L418 AbstractCegarLoop]: === Iteration 124 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1894339743, now seen corresponding path program 94 times [2019-08-05 10:45:04,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,268 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:04,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:04,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:04,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:04,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:04,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:04,536 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:04,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:04,877 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:04,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:04,877 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:04,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:04,878 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:04,878 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:04,878 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:04,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:04,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:04,880 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:04,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:04,880 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:04,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:04,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:04,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:04,881 INFO L399 BasicCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1] [2019-08-05 10:45:04,881 INFO L418 AbstractCegarLoop]: === Iteration 125 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1634717381, now seen corresponding path program 95 times [2019-08-05 10:45:04,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:04,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:04,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:05,130 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:05,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:05,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:05,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:05,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:05,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:05,131 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:05,629 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:05,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:05,630 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:05,630 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:05,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:05,631 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:05,632 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:05,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:05,632 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:05,632 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1] [2019-08-05 10:45:05,633 INFO L418 AbstractCegarLoop]: === Iteration 126 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:05,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1698793505, now seen corresponding path program 96 times [2019-08-05 10:45:05,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:05,637 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:05,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:06,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:06,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:06,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:06,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:06,109 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:06,474 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:06,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:06,475 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:06,476 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:06,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:06,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:06,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:06,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:06,478 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:06,478 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:06,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:06,478 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:06,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:06,478 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:06,479 INFO L399 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1] [2019-08-05 10:45:06,479 INFO L418 AbstractCegarLoop]: === Iteration 127 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:06,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:06,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1657357189, now seen corresponding path program 97 times [2019-08-05 10:45:06,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:06,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:06,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:06,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:06,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:06,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:06,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:06,823 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:07,206 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:07,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:07,206 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:07,207 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:07,207 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:07,207 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:07,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:07,209 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:07,209 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:07,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:07,210 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:07,210 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-08-05 10:45:07,210 INFO L418 AbstractCegarLoop]: === Iteration 128 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:07,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2113705185, now seen corresponding path program 98 times [2019-08-05 10:45:07,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:07,217 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:07,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:07,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:07,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:07,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:07,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:07,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:07,470 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:07,897 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:07,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:07,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:07,899 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:07,900 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:07,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:07,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:07,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:07,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:07,902 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:07,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:07,903 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:07,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:07,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:07,903 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:07,903 INFO L399 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-08-05 10:45:07,904 INFO L418 AbstractCegarLoop]: === Iteration 129 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:07,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1366878277, now seen corresponding path program 99 times [2019-08-05 10:45:07,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:07,909 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:07,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:08,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:08,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:08,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:08,194 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:08,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:08,612 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:08,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:08,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:08,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:08,613 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:08,613 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:08,613 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:08,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:08,615 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:08,616 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:08,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:08,616 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:08,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:08,616 INFO L399 BasicCegarLoop]: trace histogram [9, 6, 1, 1, 1, 1] [2019-08-05 10:45:08,617 INFO L418 AbstractCegarLoop]: === Iteration 130 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:08,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:08,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1617702495, now seen corresponding path program 100 times [2019-08-05 10:45:08,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:08,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:08,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:08,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:08,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:08,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:08,866 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:09,295 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:09,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:09,295 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:09,296 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:09,296 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:09,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:09,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:09,298 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:09,298 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:09,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:09,299 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:09,299 INFO L399 BasicCegarLoop]: trace histogram [10, 5, 1, 1, 1, 1] [2019-08-05 10:45:09,299 INFO L418 AbstractCegarLoop]: === Iteration 131 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:09,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:09,299 INFO L82 PathProgramCache]: Analyzing trace with hash -313869051, now seen corresponding path program 101 times [2019-08-05 10:45:09,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:09,304 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:09,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:09,567 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:09,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:09,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:09,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:09,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:09,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:09,568 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:10,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:10,007 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:10,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:10,008 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:10,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:10,008 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:10,008 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:10,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:10,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:10,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:10,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:10,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:10,010 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:10,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:10,010 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:10,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:10,011 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:10,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:10,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:10,011 INFO L399 BasicCegarLoop]: trace histogram [11, 4, 1, 1, 1, 1] [2019-08-05 10:45:10,011 INFO L418 AbstractCegarLoop]: === Iteration 132 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:10,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1286390175, now seen corresponding path program 102 times [2019-08-05 10:45:10,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,017 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:10,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:10,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:10,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:10,284 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:10,848 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:10,849 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:10,849 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:10,849 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:10,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:10,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:10,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:10,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:10,851 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:10,851 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:10,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:10,851 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:10,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:10,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:10,852 INFO L399 BasicCegarLoop]: trace histogram [12, 3, 1, 1, 1, 1] [2019-08-05 10:45:10,852 INFO L418 AbstractCegarLoop]: === Iteration 133 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:10,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:10,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2030748101, now seen corresponding path program 103 times [2019-08-05 10:45:10,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:10,857 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:10,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:11,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:11,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:11,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:11,126 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:11,595 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:11,595 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:11,596 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:11,596 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:11,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:11,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:11,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:11,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:11,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:11,598 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:11,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:11,599 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:11,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:11,599 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:11,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:11,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:11,600 INFO L399 BasicCegarLoop]: trace histogram [13, 2, 1, 1, 1, 1] [2019-08-05 10:45:11,600 INFO L418 AbstractCegarLoop]: === Iteration 134 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:11,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2054759647, now seen corresponding path program 104 times [2019-08-05 10:45:11,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:11,605 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:11,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:11,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:11,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:11,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:11,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:11,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:11,873 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:12,361 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:12,361 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:12,362 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:12,362 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:12,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:12,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:12,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:12,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:12,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:12,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:12,364 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:12,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:12,364 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:12,364 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2019-08-05 10:45:12,365 INFO L418 AbstractCegarLoop]: === Iteration 135 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:12,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:12,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2055534213, now seen corresponding path program 105 times [2019-08-05 10:45:12,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:12,369 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:12,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:12,634 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:12,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:12,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:12,635 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:12,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:12,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:12,636 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,136 INFO L93 Difference]: Finished difference Result 52 states and 68 transitions. [2019-08-05 10:45:13,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:13,137 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:13,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,137 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:45:13,137 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:45:13,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:45:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 36. [2019-08-05 10:45:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:45:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-08-05 10:45:13,139 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 19 [2019-08-05 10:45:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,140 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2019-08-05 10:45:13,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-08-05 10:45:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:45:13,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,140 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-08-05 10:45:13,141 INFO L418 AbstractCegarLoop]: === Iteration 136 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559199, now seen corresponding path program 15 times [2019-08-05 10:45:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,145 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:13,405 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:13,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:13,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:45:13,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:45:13,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:45:13,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:45:13,406 INFO L87 Difference]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-08-05 10:45:13,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:13,918 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2019-08-05 10:45:13,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:45:13,918 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:45:13,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:13,919 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:45:13,919 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:45:13,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:13,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:45:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-08-05 10:45:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:45:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2019-08-05 10:45:13,921 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 19 [2019-08-05 10:45:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:13,921 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2019-08-05 10:45:13,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:45:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2019-08-05 10:45:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:13,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:13,922 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 10:45:13,922 INFO L418 AbstractCegarLoop]: === Iteration 137 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:13,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1688263611, now seen corresponding path program 16 times [2019-08-05 10:45:13,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:13,926 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:13,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,202 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:14,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:14,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:14,204 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand 20 states. [2019-08-05 10:45:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:14,528 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-08-05 10:45:14,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:14,528 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:14,529 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:45:14,529 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:45:14,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:45:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2019-08-05 10:45:14,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:14,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:14,531 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:14,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:14,531 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:14,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:14,532 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:14,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:14,532 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:14,532 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-08-05 10:45:14,532 INFO L418 AbstractCegarLoop]: === Iteration 138 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:14,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:14,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1842341013, now seen corresponding path program 106 times [2019-08-05 10:45:14,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:14,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:14,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:14,900 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:14,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:14,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:14,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:14,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:14,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:14,901 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:15,235 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:15,235 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:15,236 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:15,236 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:15,236 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:15,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:15,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:15,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:15,238 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:15,238 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:15,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:15,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:15,239 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1] [2019-08-05 10:45:15,239 INFO L418 AbstractCegarLoop]: === Iteration 139 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:15,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1016027259, now seen corresponding path program 107 times [2019-08-05 10:45:15,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:15,245 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:15,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:15,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:15,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:15,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:15,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:15,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:15,628 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:16,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:16,089 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:16,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:16,090 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:16,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:16,090 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:16,091 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:16,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:16,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:16,093 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:16,093 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:16,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:16,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:16,094 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:16,094 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1] [2019-08-05 10:45:16,095 INFO L418 AbstractCegarLoop]: === Iteration 140 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:16,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:16,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1405013973, now seen corresponding path program 108 times [2019-08-05 10:45:16,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:16,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:16,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:16,514 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:16,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:16,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:16,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:16,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:16,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:16,516 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:16,885 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:16,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:16,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:16,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:16,887 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:16,887 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:16,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:16,889 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:16,889 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:16,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:16,889 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:16,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:16,890 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:16,890 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1] [2019-08-05 10:45:16,890 INFO L418 AbstractCegarLoop]: === Iteration 141 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:16,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:16,890 INFO L82 PathProgramCache]: Analyzing trace with hash -863372603, now seen corresponding path program 109 times [2019-08-05 10:45:16,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:16,895 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:16,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:17,519 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:17,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:17,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:17,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:17,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:17,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:17,520 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:17,905 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:17,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:17,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:17,906 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:17,906 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:17,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:17,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:17,908 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:17,908 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:17,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:17,909 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:17,909 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1] [2019-08-05 10:45:17,909 INFO L418 AbstractCegarLoop]: === Iteration 142 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:17,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:17,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1122994965, now seen corresponding path program 110 times [2019-08-05 10:45:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:17,913 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:17,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:18,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:18,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:18,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:18,191 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:18,587 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:18,588 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:18,588 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:18,589 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:18,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:18,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:18,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:18,591 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:18,591 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:18,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:18,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:18,592 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:18,592 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1] [2019-08-05 10:45:18,593 INFO L418 AbstractCegarLoop]: === Iteration 143 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:18,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:18,593 INFO L82 PathProgramCache]: Analyzing trace with hash -161538555, now seen corresponding path program 111 times [2019-08-05 10:45:18,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:18,597 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:18,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:18,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:18,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:18,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:18,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:18,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:18,865 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:19,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,278 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:19,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:19,279 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:19,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:19,279 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:19,279 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:19,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:19,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:19,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:19,281 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:19,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:19,281 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:19,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:19,281 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:19,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:19,282 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:19,282 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1] [2019-08-05 10:45:19,282 INFO L418 AbstractCegarLoop]: === Iteration 144 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1100355157, now seen corresponding path program 112 times [2019-08-05 10:45:19,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:19,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:19,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:19,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:19,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:19,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:19,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:19,569 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:19,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:19,997 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:19,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:20,000 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:20,000 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:20,000 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:20,000 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:20,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:20,001 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:20,002 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:20,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:20,002 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:20,002 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:20,002 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-08-05 10:45:20,003 INFO L418 AbstractCegarLoop]: === Iteration 145 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash -576450235, now seen corresponding path program 113 times [2019-08-05 10:45:20,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:20,008 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:20,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:20,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:20,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:20,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:20,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:20,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:20,307 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:20,820 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:20,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:20,820 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:20,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:20,820 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:20,820 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:20,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:20,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:20,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:20,822 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:20,822 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:20,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:20,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:20,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:20,822 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 1, 1, 1, 1] [2019-08-05 10:45:20,822 INFO L418 AbstractCegarLoop]: === Iteration 146 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:20,823 INFO L82 PathProgramCache]: Analyzing trace with hash -1390834069, now seen corresponding path program 114 times [2019-08-05 10:45:20,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:20,827 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:20,827 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:21,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:21,194 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:21,658 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:21,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:21,659 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:21,659 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:21,660 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:21,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:21,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:21,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:21,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:21,661 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:21,662 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:21,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:21,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:21,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:21,662 INFO L399 BasicCegarLoop]: trace histogram [10, 6, 1, 1, 1, 1] [2019-08-05 10:45:21,662 INFO L418 AbstractCegarLoop]: === Iteration 147 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:21,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1140009851, now seen corresponding path program 115 times [2019-08-05 10:45:21,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:21,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:21,667 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:21,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:21,946 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:21,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:21,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:21,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:21,947 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:22,428 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:22,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:22,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:22,429 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:22,429 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:22,429 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:22,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:22,431 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:22,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:22,431 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:22,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:22,431 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:22,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:22,432 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:22,432 INFO L399 BasicCegarLoop]: trace histogram [11, 5, 1, 1, 1, 1] [2019-08-05 10:45:22,432 INFO L418 AbstractCegarLoop]: === Iteration 148 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:22,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:22,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1223385899, now seen corresponding path program 116 times [2019-08-05 10:45:22,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:22,437 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:22,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:22,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:22,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:22,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:22,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:22,747 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:23,239 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:23,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:23,240 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:23,240 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:23,241 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:23,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:23,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:23,242 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:23,243 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:23,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:23,243 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:23,243 INFO L399 BasicCegarLoop]: trace histogram [12, 4, 1, 1, 1, 1] [2019-08-05 10:45:23,243 INFO L418 AbstractCegarLoop]: === Iteration 149 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:23,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:23,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1471322171, now seen corresponding path program 117 times [2019-08-05 10:45:23,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:23,247 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:23,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:23,514 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:23,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:23,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:23,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:23,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:23,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:23,515 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:24,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:24,025 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:24,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:24,026 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:24,026 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:24,027 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:24,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:24,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:24,029 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:24,029 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:24,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:24,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:24,030 INFO L399 BasicCegarLoop]: trace histogram [13, 3, 1, 1, 1, 1] [2019-08-05 10:45:24,030 INFO L418 AbstractCegarLoop]: === Iteration 150 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:24,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash -726964245, now seen corresponding path program 118 times [2019-08-05 10:45:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:24,035 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:24,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:24,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:24,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:24,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:24,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:24,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:24,936 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:25,460 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:25,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:25,461 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:25,461 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:25,461 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:25,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:25,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:25,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:25,463 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:25,464 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:25,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:25,464 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:25,464 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:25,464 INFO L399 BasicCegarLoop]: trace histogram [14, 2, 1, 1, 1, 1] [2019-08-05 10:45:25,465 INFO L418 AbstractCegarLoop]: === Iteration 151 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:25,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:25,465 INFO L82 PathProgramCache]: Analyzing trace with hash -702952699, now seen corresponding path program 119 times [2019-08-05 10:45:25,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:25,470 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:25,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:25,745 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:45:26,031 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:26,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:26,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:26,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:26,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:26,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:26,032 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:26,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:26,574 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:26,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:26,575 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:26,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:26,575 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:26,575 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:26,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:26,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:26,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:26,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:26,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:26,578 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:26,578 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:26,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:26,579 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:26,579 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1] [2019-08-05 10:45:26,579 INFO L418 AbstractCegarLoop]: === Iteration 152 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash -702178133, now seen corresponding path program 120 times [2019-08-05 10:45:26,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:26,583 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:26,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:26,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:26,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:26,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:26,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:26,904 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:27,479 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2019-08-05 10:45:27,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:27,479 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:27,480 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:45:27,480 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:45:27,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:45:27,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2019-08-05 10:45:27,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:45:27,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-08-05 10:45:27,482 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 20 [2019-08-05 10:45:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:27,482 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 55 transitions. [2019-08-05 10:45:27,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 55 transitions. [2019-08-05 10:45:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:45:27,482 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:27,483 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-08-05 10:45:27,483 INFO L418 AbstractCegarLoop]: === Iteration 153 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:27,483 INFO L82 PathProgramCache]: Analyzing trace with hash -702153147, now seen corresponding path program 16 times [2019-08-05 10:45:27,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:27,487 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:45:27,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:27,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:27,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:45:27,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:45:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:45:27,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:45:27,800 INFO L87 Difference]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-08-05 10:45:28,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:28,369 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-08-05 10:45:28,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:45:28,369 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:45:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:28,370 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:45:28,370 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:45:28,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:28,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:45:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-08-05 10:45:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:45:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2019-08-05 10:45:28,372 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 20 [2019-08-05 10:45:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:28,372 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2019-08-05 10:45:28,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:45:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2019-08-05 10:45:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:28,373 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:28,373 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 10:45:28,373 INFO L418 AbstractCegarLoop]: === Iteration 154 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:28,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:28,373 INFO L82 PathProgramCache]: Analyzing trace with hash -796568251, now seen corresponding path program 17 times [2019-08-05 10:45:28,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:28,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:28,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:28,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:28,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:28,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:28,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:28,784 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand 21 states. [2019-08-05 10:45:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:29,203 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-08-05 10:45:29,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:29,203 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:29,204 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:45:29,204 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:45:29,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:29,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:45:29,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2019-08-05 10:45:29,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:29,208 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:29,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:29,208 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:29,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:29,208 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:29,208 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:29,208 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-08-05 10:45:29,208 INFO L418 AbstractCegarLoop]: === Iteration 155 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:29,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1278000417, now seen corresponding path program 121 times [2019-08-05 10:45:29,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:29,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:29,213 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:29,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:29,956 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:29,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:29,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:29,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:29,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:29,958 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:30,351 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:30,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:30,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:30,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:30,352 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:30,352 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:30,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:30,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:30,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:30,354 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:30,354 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:30,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:30,354 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:30,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:30,355 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1] [2019-08-05 10:45:30,355 INFO L418 AbstractCegarLoop]: === Iteration 156 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:30,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:30,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1432077819, now seen corresponding path program 122 times [2019-08-05 10:45:30,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:30,361 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:30,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:30,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:30,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:30,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:30,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:30,702 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:31,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:31,171 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:31,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:31,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:31,172 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:31,172 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:31,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:31,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:31,174 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:31,174 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:31,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:31,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:31,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:31,175 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1] [2019-08-05 10:45:31,175 INFO L418 AbstractCegarLoop]: === Iteration 157 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash -605764065, now seen corresponding path program 123 times [2019-08-05 10:45:31,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:31,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:31,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:31,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:31,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:31,470 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:31,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:31,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:31,470 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:31,879 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:31,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:31,880 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:31,880 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:31,881 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:31,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:31,882 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:31,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:31,883 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:31,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:31,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:31,883 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1] [2019-08-05 10:45:31,884 INFO L418 AbstractCegarLoop]: === Iteration 158 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:31,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash -994750779, now seen corresponding path program 124 times [2019-08-05 10:45:31,884 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:31,888 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:31,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:32,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:32,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:32,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:32,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:32,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:32,181 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:32,606 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:32,607 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:32,607 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:32,607 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:32,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:32,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:32,609 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:32,609 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:32,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:32,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:32,610 INFO L399 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1] [2019-08-05 10:45:32,610 INFO L418 AbstractCegarLoop]: === Iteration 159 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:32,610 INFO L82 PathProgramCache]: Analyzing trace with hash -453109409, now seen corresponding path program 125 times [2019-08-05 10:45:32,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:32,614 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:32,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:33,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:33,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:33,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:33,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:33,007 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:33,442 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:33,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:33,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:33,443 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:33,443 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:33,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:33,445 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:33,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:33,445 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:33,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:33,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:33,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:33,446 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1] [2019-08-05 10:45:33,447 INFO L418 AbstractCegarLoop]: === Iteration 160 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:33,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:33,447 INFO L82 PathProgramCache]: Analyzing trace with hash -712731771, now seen corresponding path program 126 times [2019-08-05 10:45:33,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:33,452 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:33,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:33,819 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:33,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:33,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:33,820 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:33,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:33,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:33,821 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:34,275 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:34,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:34,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:34,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:34,276 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:34,276 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:34,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:34,279 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:34,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:34,279 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:34,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:34,279 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:34,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:34,280 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:34,280 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1] [2019-08-05 10:45:34,280 INFO L418 AbstractCegarLoop]: === Iteration 161 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:34,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash 248724639, now seen corresponding path program 127 times [2019-08-05 10:45:34,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:34,285 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:34,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:34,578 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:34,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:34,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:34,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:34,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:34,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:34,580 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:35,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:35,074 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:35,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:35,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:35,075 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:35,075 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:35,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:35,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:35,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:35,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:35,077 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:35,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:35,077 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:35,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:35,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:35,078 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1] [2019-08-05 10:45:35,078 INFO L418 AbstractCegarLoop]: === Iteration 162 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:35,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash -690091963, now seen corresponding path program 128 times [2019-08-05 10:45:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:35,082 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:35,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:35,357 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:45:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:35,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:35,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:35,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:35,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:35,769 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:36,360 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:36,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:36,360 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:36,360 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:36,360 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:36,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:36,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:36,362 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:36,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:36,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:36,362 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1] [2019-08-05 10:45:36,362 INFO L418 AbstractCegarLoop]: === Iteration 163 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:36,363 INFO L82 PathProgramCache]: Analyzing trace with hash -166187041, now seen corresponding path program 129 times [2019-08-05 10:45:36,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:36,367 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:36,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:36,681 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:36,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:36,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:36,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:36,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:36,683 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:37,190 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:37,191 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:37,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:37,191 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:37,191 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:37,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:37,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:37,193 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:37,193 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:37,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:37,193 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:37,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:37,194 INFO L399 BasicCegarLoop]: trace histogram [10, 7, 1, 1, 1, 1] [2019-08-05 10:45:37,194 INFO L418 AbstractCegarLoop]: === Iteration 164 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash -980570875, now seen corresponding path program 130 times [2019-08-05 10:45:37,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:37,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:37,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:37,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:37,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:37,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:37,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:37,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:37,598 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,117 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:38,118 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,118 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:38,118 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:38,119 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:38,120 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:38,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,120 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:38,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:38,120 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:38,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,121 INFO L399 BasicCegarLoop]: trace histogram [11, 6, 1, 1, 1, 1] [2019-08-05 10:45:38,121 INFO L418 AbstractCegarLoop]: === Iteration 165 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash -729746657, now seen corresponding path program 131 times [2019-08-05 10:45:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:38,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:38,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:38,420 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:38,958 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:38,958 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:38,959 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:38,959 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:38,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:38,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:38,961 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:38,961 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:38,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:38,961 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:38,962 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:38,962 INFO L399 BasicCegarLoop]: trace histogram [12, 5, 1, 1, 1, 1] [2019-08-05 10:45:38,962 INFO L418 AbstractCegarLoop]: === Iteration 166 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:38,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1633649093, now seen corresponding path program 132 times [2019-08-05 10:45:38,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:38,966 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:38,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:39,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:39,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:39,262 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:39,263 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:39,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:39,814 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:39,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:39,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:39,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:39,815 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:39,815 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:39,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:39,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:39,817 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:39,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:39,817 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:39,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:39,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:39,817 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:39,818 INFO L399 BasicCegarLoop]: trace histogram [13, 4, 1, 1, 1, 1] [2019-08-05 10:45:39,818 INFO L418 AbstractCegarLoop]: === Iteration 167 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:39,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1061058977, now seen corresponding path program 133 times [2019-08-05 10:45:39,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:39,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:39,822 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:39,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:40,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:40,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:40,220 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:40,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:40,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:40,221 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:40,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:40,785 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:40,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:40,786 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:40,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:40,786 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:40,786 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:40,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:40,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:40,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:40,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:40,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:40,788 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:40,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:40,788 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:40,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:40,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:40,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:40,788 INFO L399 BasicCegarLoop]: trace histogram [14, 3, 1, 1, 1, 1] [2019-08-05 10:45:40,789 INFO L418 AbstractCegarLoop]: === Iteration 168 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:40,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:40,789 INFO L82 PathProgramCache]: Analyzing trace with hash -316701051, now seen corresponding path program 134 times [2019-08-05 10:45:40,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:40,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:40,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:41,425 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:45:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:41,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:41,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:41,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:41,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:41,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:41,889 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:42,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:42,475 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:42,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:42,475 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:42,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:42,476 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:42,476 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:42,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:42,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:42,478 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:42,480 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:42,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:42,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:42,481 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:42,481 INFO L399 BasicCegarLoop]: trace histogram [15, 2, 1, 1, 1, 1] [2019-08-05 10:45:42,481 INFO L418 AbstractCegarLoop]: === Iteration 169 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:42,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:42,481 INFO L82 PathProgramCache]: Analyzing trace with hash -292689505, now seen corresponding path program 135 times [2019-08-05 10:45:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:42,486 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:42,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:42,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:42,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:42,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:42,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:42,816 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:43,417 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:43,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:43,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:43,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:43,418 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:43,418 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:43,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:43,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:43,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:43,419 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:43,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:43,420 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:43,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:43,420 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:43,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:43,420 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:43,421 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1] [2019-08-05 10:45:43,421 INFO L418 AbstractCegarLoop]: === Iteration 170 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:43,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:43,421 INFO L82 PathProgramCache]: Analyzing trace with hash -291914939, now seen corresponding path program 136 times [2019-08-05 10:45:43,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:43,425 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:43,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:43,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:43,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:43,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:43,719 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:44,335 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-08-05 10:45:44,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:44,335 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:44,336 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:45:44,336 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:45:44,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:45:44,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2019-08-05 10:45:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:45:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-08-05 10:45:44,338 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 21 [2019-08-05 10:45:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:44,338 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-08-05 10:45:44,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-08-05 10:45:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:45:44,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:44,339 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-08-05 10:45:44,339 INFO L418 AbstractCegarLoop]: === Iteration 171 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:44,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:44,339 INFO L82 PathProgramCache]: Analyzing trace with hash -291889953, now seen corresponding path program 17 times [2019-08-05 10:45:44,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:44,344 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:45:44,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:44,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:44,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:45:44,640 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:45:44,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:45:44,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:45:44,640 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-08-05 10:45:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:45,273 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2019-08-05 10:45:45,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:45:45,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:45:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:45,274 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:45:45,274 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:45:45,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:45:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-08-05 10:45:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:45:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2019-08-05 10:45:45,276 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 21 [2019-08-05 10:45:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:45,277 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2019-08-05 10:45:45,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:45:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2019-08-05 10:45:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:45,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:45,278 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 10:45:45,278 INFO L418 AbstractCegarLoop]: === Iteration 172 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1076184133, now seen corresponding path program 18 times [2019-08-05 10:45:45,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:45,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:45,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:45,603 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:45,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:45,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:45,604 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:45,605 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand 22 states. [2019-08-05 10:45:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:45,993 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2019-08-05 10:45:45,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:45,994 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:45,994 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:45:45,994 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:45:45,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:45,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:45:45,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-08-05 10:45:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:45,996 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:45,997 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:45,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:45,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:45,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:45,997 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1] [2019-08-05 10:45:45,997 INFO L418 AbstractCegarLoop]: === Iteration 173 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:45,997 INFO L82 PathProgramCache]: Analyzing trace with hash -963311125, now seen corresponding path program 137 times [2019-08-05 10:45:45,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:46,002 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:46,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:46,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:46,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:46,420 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:46,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:46,421 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:46,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:46,845 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:46,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:46,846 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:46,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:46,846 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:46,846 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:46,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:46,848 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:46,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:46,849 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:46,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:46,849 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:46,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:46,849 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1] [2019-08-05 10:45:46,849 INFO L418 AbstractCegarLoop]: === Iteration 174 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:46,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:46,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1444743291, now seen corresponding path program 138 times [2019-08-05 10:45:46,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:46,855 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:46,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:47,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:47,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:47,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:47,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:47,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:47,171 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:47,594 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:47,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:47,594 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:47,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:47,595 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:47,595 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:47,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:47,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:47,596 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:47,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:47,597 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:47,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:47,597 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:47,597 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:47,597 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1] [2019-08-05 10:45:47,597 INFO L418 AbstractCegarLoop]: === Iteration 175 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:47,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:47,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1598820693, now seen corresponding path program 139 times [2019-08-05 10:45:47,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:47,602 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:47,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:47,917 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:47,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:47,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:47,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:47,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:47,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:47,918 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:48,360 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:48,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:48,360 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:48,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:48,361 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:48,361 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:48,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:48,364 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:48,364 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:48,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:48,365 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:48,365 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1] [2019-08-05 10:45:48,365 INFO L418 AbstractCegarLoop]: === Iteration 176 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash -772506939, now seen corresponding path program 140 times [2019-08-05 10:45:48,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:48,371 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:48,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:48,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:48,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:48,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:48,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:48,759 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:49,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:49,221 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:49,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:49,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:49,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:49,222 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:49,222 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:49,222 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:49,223 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:49,224 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:49,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:49,224 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:49,225 INFO L399 BasicCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1] [2019-08-05 10:45:49,225 INFO L418 AbstractCegarLoop]: === Iteration 177 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:49,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:49,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1161493653, now seen corresponding path program 141 times [2019-08-05 10:45:49,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:49,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:49,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:49,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:49,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:49,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:49,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:49,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:49,614 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:50,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:50,086 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:50,087 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:50,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:50,087 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:50,088 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:50,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:50,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:50,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:50,089 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:50,090 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:50,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:50,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:50,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:50,090 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1] [2019-08-05 10:45:50,091 INFO L418 AbstractCegarLoop]: === Iteration 178 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:50,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:50,091 INFO L82 PathProgramCache]: Analyzing trace with hash -619852283, now seen corresponding path program 142 times [2019-08-05 10:45:50,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:50,095 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:50,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:50,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:50,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:50,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:50,422 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:50,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:50,913 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:50,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:50,914 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:50,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:50,914 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:50,914 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:50,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:50,916 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:50,916 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:50,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:50,916 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:50,917 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1] [2019-08-05 10:45:50,917 INFO L418 AbstractCegarLoop]: === Iteration 179 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:50,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:50,917 INFO L82 PathProgramCache]: Analyzing trace with hash -879474645, now seen corresponding path program 143 times [2019-08-05 10:45:50,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:50,921 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:50,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:51,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:51,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:51,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:51,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:51,270 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:51,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:51,878 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:51,878 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:51,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:51,879 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:51,879 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:51,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:51,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:51,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:51,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:51,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:51,881 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:51,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:51,881 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:51,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:51,882 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:51,882 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1] [2019-08-05 10:45:51,882 INFO L418 AbstractCegarLoop]: === Iteration 180 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:51,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:51,882 INFO L82 PathProgramCache]: Analyzing trace with hash 81981765, now seen corresponding path program 144 times [2019-08-05 10:45:51,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:51,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:51,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:52,224 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:52,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:52,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:52,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:52,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:52,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:52,225 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:52,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:52,751 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:52,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:52,751 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:52,752 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:52,752 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:52,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:52,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:52,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:52,754 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:52,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:52,755 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:52,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:52,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:52,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:52,755 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-08-05 10:45:52,756 INFO L418 AbstractCegarLoop]: === Iteration 181 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:52,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash -856834837, now seen corresponding path program 145 times [2019-08-05 10:45:52,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:52,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:52,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:53,080 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:53,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:53,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:53,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:53,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:53,081 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:53,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:53,620 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:53,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:53,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:53,621 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:53,621 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:53,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:53,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:53,623 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:53,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:53,624 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:53,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:53,624 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:53,625 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:53,625 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 1, 1, 1, 1] [2019-08-05 10:45:53,625 INFO L418 AbstractCegarLoop]: === Iteration 182 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:53,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:53,625 INFO L82 PathProgramCache]: Analyzing trace with hash -332929915, now seen corresponding path program 146 times [2019-08-05 10:45:53,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:53,630 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:53,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:54,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:54,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:54,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:54,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:54,092 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:54,653 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:54,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:54,654 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:54,654 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:54,654 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:54,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:54,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:54,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:54,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:54,656 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:54,656 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:54,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:54,656 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:54,657 INFO L399 BasicCegarLoop]: trace histogram [11, 7, 1, 1, 1, 1] [2019-08-05 10:45:54,657 INFO L418 AbstractCegarLoop]: === Iteration 183 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1147313749, now seen corresponding path program 147 times [2019-08-05 10:45:54,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:54,662 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:54,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:55,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:55,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:55,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:55,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:55,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:55,040 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:55,627 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:55,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:55,627 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:55,628 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:55,628 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:55,628 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:55,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:55,630 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:55,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:55,630 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:55,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:55,631 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:55,631 INFO L399 BasicCegarLoop]: trace histogram [12, 6, 1, 1, 1, 1] [2019-08-05 10:45:55,631 INFO L418 AbstractCegarLoop]: === Iteration 184 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:55,632 INFO L82 PathProgramCache]: Analyzing trace with hash -896489531, now seen corresponding path program 148 times [2019-08-05 10:45:55,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:55,636 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:55,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:55,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:55,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:55,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:55,950 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:56,604 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:56,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:56,605 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:56,605 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:56,605 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:56,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:56,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:56,606 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:56,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:56,606 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:56,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:56,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:56,607 INFO L399 BasicCegarLoop]: trace histogram [13, 5, 1, 1, 1, 1] [2019-08-05 10:45:56,607 INFO L418 AbstractCegarLoop]: === Iteration 185 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:56,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:56,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1466906219, now seen corresponding path program 149 times [2019-08-05 10:45:56,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:56,611 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:56,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:57,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:57,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:57,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:57,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:57,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:57,061 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:57,688 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:57,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:57,688 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:57,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:57,689 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:57,689 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:57,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:57,691 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:57,692 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:57,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:57,693 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:57,693 INFO L399 BasicCegarLoop]: trace histogram [14, 4, 1, 1, 1, 1] [2019-08-05 10:45:57,693 INFO L418 AbstractCegarLoop]: === Iteration 186 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1227801851, now seen corresponding path program 150 times [2019-08-05 10:45:57,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:57,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:57,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:58,046 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:58,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:58,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:58,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:58,047 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:58,676 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:58,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:58,677 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:58,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:58,677 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:58,677 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:58,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:58,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:58,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:58,679 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:58,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:58,679 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:58,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:58,680 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:58,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:58,680 INFO L399 BasicCegarLoop]: trace histogram [15, 3, 1, 1, 1, 1] [2019-08-05 10:45:58,680 INFO L418 AbstractCegarLoop]: === Iteration 187 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:58,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:58,681 INFO L82 PathProgramCache]: Analyzing trace with hash -483443925, now seen corresponding path program 151 times [2019-08-05 10:45:58,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:58,684 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:58,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:45:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:45:59,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:45:59,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:45:59,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:45:59,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:45:59,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:45:59,008 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:45:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:45:59,655 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:45:59,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:45:59,655 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:45:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:45:59,656 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:45:59,656 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:45:59,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:45:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:45:59,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:45:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:45:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:45:59,657 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:45:59,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:45:59,658 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:45:59,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:45:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:45:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:45:59,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:45:59,658 INFO L399 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1] [2019-08-05 10:45:59,659 INFO L418 AbstractCegarLoop]: === Iteration 188 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:45:59,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:45:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash -459432379, now seen corresponding path program 152 times [2019-08-05 10:45:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:45:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:45:59,664 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:45:59,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:00,122 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:00,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:00,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:46:00,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:46:00,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:46:00,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:46:00,123 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:46:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:00,784 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:46:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:46:00,785 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:46:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:00,785 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:46:00,785 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:46:00,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:00,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:46:00,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:46:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:46:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:46:00,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:46:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:00,788 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:46:00,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:46:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:46:00,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:46:00,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:00,789 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1] [2019-08-05 10:46:00,789 INFO L418 AbstractCegarLoop]: === Iteration 189 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:00,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash -458657813, now seen corresponding path program 153 times [2019-08-05 10:46:00,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:00,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:00,794 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:46:00,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:46:01,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:46:01,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:46:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:46:01,126 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:46:01,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:01,934 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2019-08-05 10:46:01,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:46:01,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:46:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:01,934 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:46:01,934 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:46:01,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:46:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2019-08-05 10:46:01,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:46:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-08-05 10:46:01,936 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 22 [2019-08-05 10:46:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:01,936 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2019-08-05 10:46:01,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:46:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2019-08-05 10:46:01,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:46:01,936 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:01,937 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-08-05 10:46:01,937 INFO L418 AbstractCegarLoop]: === Iteration 190 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash -458632827, now seen corresponding path program 18 times [2019-08-05 10:46:01,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:01,941 WARN L254 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:46:01,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:02,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:02,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:46:02,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:46:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:46:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:46:02,277 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-08-05 10:46:02,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:02,975 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2019-08-05 10:46:02,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:46:02,975 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:46:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:02,976 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:46:02,976 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:46:02,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:46:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2019-08-05 10:46:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:46:02,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2019-08-05 10:46:02,978 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 22 [2019-08-05 10:46:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:02,978 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2019-08-05 10:46:02,978 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:46:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2019-08-05 10:46:02,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:02,979 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:02,979 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 10:46:02,979 INFO L418 AbstractCegarLoop]: === Iteration 191 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:02,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:02,980 INFO L82 PathProgramCache]: Analyzing trace with hash -998034107, now seen corresponding path program 19 times [2019-08-05 10:46:02,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:02,985 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:02,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:03,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:03,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:03,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:03,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:03,402 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand 23 states. [2019-08-05 10:46:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:03,823 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2019-08-05 10:46:03,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:03,824 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:03,824 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:46:03,824 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:46:03,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:46:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2019-08-05 10:46:03,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:03,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:03,826 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:03,826 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:03,826 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:03,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:03,827 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:03,827 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1] [2019-08-05 10:46:03,827 INFO L418 AbstractCegarLoop]: === Iteration 192 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 202122335, now seen corresponding path program 154 times [2019-08-05 10:46:03,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:03,834 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:03,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:04,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:04,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:04,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:04,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:04,185 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:04,626 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:04,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:04,626 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:04,627 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:04,627 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:04,627 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:04,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:04,629 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:04,629 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:04,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:04,630 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:04,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:04,630 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:04,630 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1] [2019-08-05 10:46:04,630 INFO L418 AbstractCegarLoop]: === Iteration 193 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:04,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:04,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1837372923, now seen corresponding path program 155 times [2019-08-05 10:46:04,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:04,635 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:04,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:04,981 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:04,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:04,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:04,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:04,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:04,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:04,982 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:05,443 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:05,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:05,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:05,451 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:05,451 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:05,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:05,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:05,452 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:05,453 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:05,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:05,453 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:05,453 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 1, 1, 1, 1] [2019-08-05 10:46:05,454 INFO L418 AbstractCegarLoop]: === Iteration 194 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:05,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1976162207, now seen corresponding path program 156 times [2019-08-05 10:46:05,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:05,459 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:05,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:05,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:05,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:05,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:05,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:05,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:05,900 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:06,375 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:06,376 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:06,376 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:06,376 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:06,377 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:06,378 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:06,379 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:06,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:06,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:06,380 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:06,380 INFO L399 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1] [2019-08-05 10:46:06,380 INFO L418 AbstractCegarLoop]: === Iteration 195 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1822084805, now seen corresponding path program 157 times [2019-08-05 10:46:06,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:06,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:06,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:06,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:06,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:06,764 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:07,292 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:07,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:07,292 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:07,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:07,293 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:07,293 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:07,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:07,295 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:07,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:07,295 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:07,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:07,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:07,296 INFO L399 BasicCegarLoop]: trace histogram [14, 5, 1, 1, 1, 1] [2019-08-05 10:46:07,296 INFO L418 AbstractCegarLoop]: === Iteration 196 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:07,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1646568737, now seen corresponding path program 158 times [2019-08-05 10:46:07,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:07,300 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:07,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:07,638 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:07,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:07,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:07,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:07,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:07,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:07,639 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:08,152 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:08,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:08,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:08,153 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:08,154 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:08,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:08,155 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:08,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:08,156 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:08,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:08,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:08,156 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:08,156 INFO L399 BasicCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1] [2019-08-05 10:46:08,157 INFO L418 AbstractCegarLoop]: === Iteration 197 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2035555451, now seen corresponding path program 159 times [2019-08-05 10:46:08,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:08,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:08,162 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:08,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:08,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:08,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:08,552 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:08,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:08,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:08,553 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:09,151 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:09,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:09,151 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:09,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:09,152 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:09,152 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:09,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:09,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:09,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:09,153 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:09,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:09,154 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:09,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:09,154 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:09,154 INFO L399 BasicCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1] [2019-08-05 10:46:09,155 INFO L418 AbstractCegarLoop]: === Iteration 198 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1493914081, now seen corresponding path program 160 times [2019-08-05 10:46:09,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:09,159 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:09,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:11,906 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:11,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:11,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:11,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:11,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:11,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:11,907 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:12,537 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:12,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:12,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:12,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:12,538 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:12,538 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:12,538 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:12,540 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:12,540 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:12,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:12,540 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:12,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:12,541 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 1, 1, 1, 1] [2019-08-05 10:46:12,541 INFO L418 AbstractCegarLoop]: === Iteration 199 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:12,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1753536443, now seen corresponding path program 161 times [2019-08-05 10:46:12,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:12,545 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:12,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:12,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:12,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:12,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:12,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:12,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:12,910 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:13,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:13,479 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:13,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:13,480 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:13,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:13,480 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:13,480 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:13,481 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:13,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:13,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:13,482 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:13,482 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:13,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:13,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:13,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:13,483 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-08-05 10:46:13,483 INFO L418 AbstractCegarLoop]: === Iteration 200 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:13,484 INFO L82 PathProgramCache]: Analyzing trace with hash -792080033, now seen corresponding path program 162 times [2019-08-05 10:46:13,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:13,489 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:13,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:13,929 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:13,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:13,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:13,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:13,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:13,931 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:14,515 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:14,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:14,516 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:14,516 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:14,516 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:14,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:14,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:14,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:14,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:14,518 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:14,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:14,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:14,519 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-08-05 10:46:14,519 INFO L418 AbstractCegarLoop]: === Iteration 201 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1730896635, now seen corresponding path program 163 times [2019-08-05 10:46:14,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:14,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:14,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:14,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:14,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:14,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:14,878 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:15,485 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:15,486 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:15,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:15,486 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:15,486 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:15,487 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:15,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:15,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:15,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:15,488 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:15,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:15,488 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:15,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:15,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:15,489 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:15,489 INFO L399 BasicCegarLoop]: trace histogram [11, 8, 1, 1, 1, 1] [2019-08-05 10:46:15,489 INFO L418 AbstractCegarLoop]: === Iteration 202 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1206991713, now seen corresponding path program 164 times [2019-08-05 10:46:15,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:15,494 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:15,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:15,833 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:15,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:15,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:15,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:15,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:15,834 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:16,456 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:16,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:16,456 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:16,457 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:16,457 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:16,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:16,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:16,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:16,459 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:16,459 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:16,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:16,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:16,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:16,459 INFO L399 BasicCegarLoop]: trace histogram [12, 7, 1, 1, 1, 1] [2019-08-05 10:46:16,460 INFO L418 AbstractCegarLoop]: === Iteration 203 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:16,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2021375547, now seen corresponding path program 165 times [2019-08-05 10:46:16,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:16,464 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:16,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:16,860 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:16,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:16,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:16,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:16,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:16,861 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:17,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:17,613 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:17,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:17,614 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:17,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:17,614 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:17,614 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:17,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:17,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:17,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:17,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:17,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:17,616 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:17,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:17,616 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:17,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:17,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:17,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:17,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:17,617 INFO L399 BasicCegarLoop]: trace histogram [13, 6, 1, 1, 1, 1] [2019-08-05 10:46:17,617 INFO L418 AbstractCegarLoop]: === Iteration 204 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1770551329, now seen corresponding path program 166 times [2019-08-05 10:46:17,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:17,623 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:17,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:17,973 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:17,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:17,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:17,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:17,974 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:18,634 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:18,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:18,635 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:18,635 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:18,635 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:18,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:18,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:18,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:18,637 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:18,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:18,637 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:18,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:18,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:18,638 INFO L399 BasicCegarLoop]: trace histogram [14, 5, 1, 1, 1, 1] [2019-08-05 10:46:18,638 INFO L418 AbstractCegarLoop]: === Iteration 205 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 592844421, now seen corresponding path program 167 times [2019-08-05 10:46:18,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:18,643 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:18,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:19,087 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:19,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:19,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:19,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:19,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:19,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:19,088 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:19,760 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:19,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:19,760 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:19,761 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:19,761 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:19,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:19,763 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:19,763 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:19,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:19,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:19,764 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:19,764 INFO L399 BasicCegarLoop]: trace histogram [15, 4, 1, 1, 1, 1] [2019-08-05 10:46:19,764 INFO L418 AbstractCegarLoop]: === Iteration 206 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2101863649, now seen corresponding path program 168 times [2019-08-05 10:46:19,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:19,768 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:19,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:20,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:20,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:20,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:20,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:20,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:20,124 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:20,814 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:20,814 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:20,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:20,815 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:20,815 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:20,815 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:20,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:20,817 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:20,817 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:20,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:20,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:20,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:20,818 INFO L399 BasicCegarLoop]: trace histogram [16, 3, 1, 1, 1, 1] [2019-08-05 10:46:20,818 INFO L418 AbstractCegarLoop]: === Iteration 207 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:20,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:20,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1357505723, now seen corresponding path program 169 times [2019-08-05 10:46:20,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:20,823 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:20,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:21,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:21,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:21,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:21,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:21,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:21,162 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:21,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:21,867 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:21,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:21,867 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:21,867 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:21,868 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:21,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:21,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:21,869 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:21,870 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:21,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:21,870 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:21,870 INFO L399 BasicCegarLoop]: trace histogram [17, 2, 1, 1, 1, 1] [2019-08-05 10:46:21,870 INFO L418 AbstractCegarLoop]: === Iteration 208 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:21,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1333494177, now seen corresponding path program 170 times [2019-08-05 10:46:21,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:21,875 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:21,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:22,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:22,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:22,477 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:23,197 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:23,198 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:23,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:23,198 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:23,198 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:23,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:23,200 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:23,200 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:23,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:23,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:23,201 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:23,201 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1] [2019-08-05 10:46:23,201 INFO L418 AbstractCegarLoop]: === Iteration 209 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:23,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:23,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1332719611, now seen corresponding path program 171 times [2019-08-05 10:46:23,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:23,206 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:23,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:23,549 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:23,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:23,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:23,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:23,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:23,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:23,550 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:24,289 INFO L93 Difference]: Finished difference Result 64 states and 84 transitions. [2019-08-05 10:46:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:24,289 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:24,289 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:46:24,290 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:46:24,290 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:24,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:46:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2019-08-05 10:46:24,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:46:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-08-05 10:46:24,291 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 23 [2019-08-05 10:46:24,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:24,291 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2019-08-05 10:46:24,292 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:24,292 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2019-08-05 10:46:24,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:46:24,292 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:24,292 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-08-05 10:46:24,292 INFO L418 AbstractCegarLoop]: === Iteration 210 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:24,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1332694625, now seen corresponding path program 19 times [2019-08-05 10:46:24,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:24,296 WARN L254 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:46:24,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:24,635 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:24,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:24,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:46:24,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:46:24,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:46:24,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:46:24,636 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-08-05 10:46:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:25,395 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2019-08-05 10:46:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:46:25,395 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:46:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:25,396 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:46:25,396 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:46:25,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:46:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 45. [2019-08-05 10:46:25,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:46:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2019-08-05 10:46:25,398 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 23 [2019-08-05 10:46:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:25,398 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2019-08-05 10:46:25,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:46:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2019-08-05 10:46:25,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:25,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:25,399 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 10:46:25,399 INFO L418 AbstractCegarLoop]: === Iteration 211 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:25,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:25,399 INFO L82 PathProgramCache]: Analyzing trace with hash -874290107, now seen corresponding path program 20 times [2019-08-05 10:46:25,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:25,404 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:25,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:25,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:25,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:25,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:25,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:25,817 INFO L87 Difference]: Start difference. First operand 45 states and 66 transitions. Second operand 24 states. [2019-08-05 10:46:26,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:26,273 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2019-08-05 10:46:26,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:26,274 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:26,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:26,274 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:46:26,275 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:46:26,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:46:26,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2019-08-05 10:46:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:26,277 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:26,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:26,277 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:26,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:26,277 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:26,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:26,277 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:26,278 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1] [2019-08-05 10:46:26,278 INFO L418 AbstractCegarLoop]: === Iteration 212 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:26,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:26,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1970821227, now seen corresponding path program 172 times [2019-08-05 10:46:26,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:26,283 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:26,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:26,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:26,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:26,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:26,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:26,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:26,656 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:27,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:27,125 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:27,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:27,125 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:27,126 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:27,126 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:27,126 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:27,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:27,128 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:27,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:27,129 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:27,130 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1] [2019-08-05 10:46:27,130 INFO L418 AbstractCegarLoop]: === Iteration 213 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:27,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1123989627, now seen corresponding path program 173 times [2019-08-05 10:46:27,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:27,136 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:27,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:27,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:27,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:27,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:27,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:27,723 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:28,216 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:28,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:28,216 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:28,217 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:28,217 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:28,217 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:28,219 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:28,219 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:28,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:28,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:28,220 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:28,220 INFO L399 BasicCegarLoop]: trace histogram [17, 3, 1, 1, 1, 1] [2019-08-05 10:46:28,220 INFO L418 AbstractCegarLoop]: === Iteration 214 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:28,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:28,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1131482411, now seen corresponding path program 174 times [2019-08-05 10:46:28,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:28,224 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:28,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:28,682 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:28,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:28,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:28,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:28,684 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:29,197 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:29,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:29,197 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:29,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:29,198 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:29,198 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:29,198 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:29,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:29,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:29,200 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:29,200 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:29,200 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:29,200 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:29,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:29,200 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:29,200 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 1, 1, 1, 1] [2019-08-05 10:46:29,201 INFO L418 AbstractCegarLoop]: === Iteration 215 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:29,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:29,201 INFO L82 PathProgramCache]: Analyzing trace with hash 650050245, now seen corresponding path program 175 times [2019-08-05 10:46:29,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:29,206 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:29,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:30,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:30,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:30,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:30,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:30,143 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:30,682 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:30,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:30,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:30,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:30,683 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:30,683 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:30,683 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:30,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:30,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:30,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:30,685 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:30,685 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:30,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:30,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:30,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:30,685 INFO L399 BasicCegarLoop]: trace histogram [15, 5, 1, 1, 1, 1] [2019-08-05 10:46:30,686 INFO L418 AbstractCegarLoop]: === Iteration 216 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:30,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:30,686 INFO L82 PathProgramCache]: Analyzing trace with hash 495972843, now seen corresponding path program 176 times [2019-08-05 10:46:30,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:30,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:30,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:31,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:31,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:31,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:31,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:31,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:31,092 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:31,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:31,641 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:31,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:31,641 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:31,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:31,642 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:31,642 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:31,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:31,644 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:31,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:31,644 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:31,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:31,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:31,645 INFO L399 BasicCegarLoop]: trace histogram [14, 6, 1, 1, 1, 1] [2019-08-05 10:46:31,645 INFO L418 AbstractCegarLoop]: === Iteration 217 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1322286597, now seen corresponding path program 177 times [2019-08-05 10:46:31,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:31,651 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:31,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:32,052 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:32,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:32,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:32,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:32,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:32,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:32,053 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:32,769 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:32,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:32,770 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:32,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:32,770 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:32,770 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:32,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:32,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:32,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:32,772 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:32,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:32,772 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:32,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:32,773 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:32,773 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:32,773 INFO L399 BasicCegarLoop]: trace histogram [13, 7, 1, 1, 1, 1] [2019-08-05 10:46:32,774 INFO L418 AbstractCegarLoop]: === Iteration 218 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash 933299883, now seen corresponding path program 178 times [2019-08-05 10:46:32,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:32,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:32,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:33,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:33,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:33,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:33,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:33,184 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:33,771 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:33,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:33,771 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:33,772 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:33,772 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:33,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:33,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:33,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:33,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:33,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:33,774 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:33,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:33,774 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:33,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:33,774 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:33,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:33,774 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 1, 1, 1, 1] [2019-08-05 10:46:33,775 INFO L418 AbstractCegarLoop]: === Iteration 219 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:33,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:33,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1474941253, now seen corresponding path program 179 times [2019-08-05 10:46:33,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:33,779 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:33,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:34,151 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:34,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:34,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:34,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:34,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:34,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:34,152 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:34,756 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:34,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:34,756 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:34,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:34,757 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:34,757 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:34,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:34,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:34,759 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:34,759 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:34,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:34,760 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:34,760 INFO L399 BasicCegarLoop]: trace histogram [11, 9, 1, 1, 1, 1] [2019-08-05 10:46:34,760 INFO L418 AbstractCegarLoop]: === Iteration 220 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:34,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1215318891, now seen corresponding path program 180 times [2019-08-05 10:46:34,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:34,765 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:34,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:35,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:35,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:35,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:35,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:35,132 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:35,748 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:35,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:35,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:35,749 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:35,750 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:35,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:35,751 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:35,752 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:35,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:35,752 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:35,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:35,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:35,752 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-08-05 10:46:35,752 INFO L418 AbstractCegarLoop]: === Iteration 221 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:35,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:35,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2118191995, now seen corresponding path program 181 times [2019-08-05 10:46:35,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:35,757 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:35,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:36,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:36,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:36,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:36,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:36,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:36,135 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:36,779 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:36,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:36,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:36,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:36,780 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:36,780 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:36,780 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:36,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:36,782 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:36,782 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:36,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:36,783 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:36,783 INFO L399 BasicCegarLoop]: trace histogram [11, 9, 1, 1, 1, 1] [2019-08-05 10:46:36,784 INFO L418 AbstractCegarLoop]: === Iteration 222 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:36,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1237958699, now seen corresponding path program 182 times [2019-08-05 10:46:36,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:36,788 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:36,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:37,167 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:37,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:37,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:37,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:37,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:37,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:37,168 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:37,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:37,954 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:37,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:37,955 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:37,955 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:37,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:37,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:37,957 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:37,957 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:37,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:37,957 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:37,957 INFO L399 BasicCegarLoop]: trace histogram [12, 8, 1, 1, 1, 1] [2019-08-05 10:46:37,957 INFO L418 AbstractCegarLoop]: === Iteration 223 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:37,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:37,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1761863621, now seen corresponding path program 183 times [2019-08-05 10:46:37,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:37,962 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:37,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:38,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:38,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:38,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:38,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:38,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:38,338 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:39,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:39,017 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:39,018 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:39,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:39,018 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:39,018 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:39,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:39,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:39,020 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:39,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:39,020 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:39,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:39,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:39,020 INFO L399 BasicCegarLoop]: trace histogram [13, 7, 1, 1, 1, 1] [2019-08-05 10:46:39,021 INFO L418 AbstractCegarLoop]: === Iteration 224 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:39,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:39,021 INFO L82 PathProgramCache]: Analyzing trace with hash 947479787, now seen corresponding path program 184 times [2019-08-05 10:46:39,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:39,025 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:39,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:39,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:39,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:39,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:39,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:39,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:39,396 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:40,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:40,094 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:40,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:40,095 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:40,095 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:40,095 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:40,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:40,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:40,097 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:40,097 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:40,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:40,098 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:40,098 INFO L399 BasicCegarLoop]: trace histogram [14, 6, 1, 1, 1, 1] [2019-08-05 10:46:40,098 INFO L418 AbstractCegarLoop]: === Iteration 225 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:40,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1198304005, now seen corresponding path program 185 times [2019-08-05 10:46:40,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:40,103 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:40,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:40,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:40,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:40,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:40,475 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:41,190 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:41,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:41,190 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:41,191 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:41,191 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:41,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:41,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:41,192 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:41,193 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:41,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:41,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:41,193 INFO L399 BasicCegarLoop]: trace histogram [15, 5, 1, 1, 1, 1] [2019-08-05 10:46:41,193 INFO L418 AbstractCegarLoop]: === Iteration 226 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:41,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:41,194 INFO L82 PathProgramCache]: Analyzing trace with hash -733267541, now seen corresponding path program 186 times [2019-08-05 10:46:41,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:41,198 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:41,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:41,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:41,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:41,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:41,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:41,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:41,599 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:42,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:42,334 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:42,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:42,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:42,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:42,335 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:42,335 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:42,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:42,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:42,337 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:42,337 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:42,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:42,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:42,338 INFO L399 BasicCegarLoop]: trace histogram [16, 4, 1, 1, 1, 1] [2019-08-05 10:46:42,338 INFO L418 AbstractCegarLoop]: === Iteration 227 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:42,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:42,338 INFO L82 PathProgramCache]: Analyzing trace with hash 866991685, now seen corresponding path program 187 times [2019-08-05 10:46:42,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:42,342 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:42,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:42,927 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:42,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:42,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:42,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:42,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:42,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:42,928 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:43,684 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:43,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:43,685 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:43,685 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:43,685 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:43,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:43,687 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:43,687 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:43,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:43,687 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:43,687 INFO L399 BasicCegarLoop]: trace histogram [17, 3, 1, 1, 1, 1] [2019-08-05 10:46:43,688 INFO L418 AbstractCegarLoop]: === Iteration 228 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:43,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1611349611, now seen corresponding path program 188 times [2019-08-05 10:46:43,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:43,692 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:43,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 159 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:44,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:44,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:44,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:44,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:44,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:44,080 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:44,855 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:44,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:44,856 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:44,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:44,856 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:44,856 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:44,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:44,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:44,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:44,861 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:44,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:44,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:44,862 INFO L399 BasicCegarLoop]: trace histogram [18, 2, 1, 1, 1, 1] [2019-08-05 10:46:44,862 INFO L418 AbstractCegarLoop]: === Iteration 229 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:44,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1635361157, now seen corresponding path program 189 times [2019-08-05 10:46:44,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:44,866 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:44,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:45,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:45,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:45,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:45,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:45,241 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:46,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:46,035 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:46,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:46,035 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:46,036 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:46,036 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:46,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:46,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:46,038 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:46,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:46,038 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:46,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:46,038 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:46,038 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:46,039 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1] [2019-08-05 10:46:46,039 INFO L418 AbstractCegarLoop]: === Iteration 230 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:46,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1636135723, now seen corresponding path program 190 times [2019-08-05 10:46:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:46,043 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:46,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:46,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:46,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:46,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:46,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:46,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:46,435 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:47,247 INFO L93 Difference]: Finished difference Result 67 states and 88 transitions. [2019-08-05 10:46:47,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:47,248 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:47,248 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:46:47,248 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:46:47,249 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:46:47,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2019-08-05 10:46:47,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:46:47,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-08-05 10:46:47,250 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 24 [2019-08-05 10:46:47,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:47,251 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2019-08-05 10:46:47,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:47,251 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2019-08-05 10:46:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:46:47,252 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:47,252 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-08-05 10:46:47,252 INFO L418 AbstractCegarLoop]: === Iteration 231 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1636160709, now seen corresponding path program 20 times [2019-08-05 10:46:47,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:47,257 WARN L254 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:46:47,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:47,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:47,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:46:47,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:46:47,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:46:47,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:46:47,617 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-08-05 10:46:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:48,538 INFO L93 Difference]: Finished difference Result 68 states and 90 transitions. [2019-08-05 10:46:48,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:46:48,538 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:46:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:48,539 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:46:48,539 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:46:48,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:48,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:46:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 47. [2019-08-05 10:46:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:46:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 69 transitions. [2019-08-05 10:46:48,541 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 69 transitions. Word has length 24 [2019-08-05 10:46:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:48,541 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 69 transitions. [2019-08-05 10:46:48,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:46:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 69 transitions. [2019-08-05 10:46:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:48,541 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:48,541 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 10:46:48,542 INFO L418 AbstractCegarLoop]: === Iteration 232 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1333193403, now seen corresponding path program 21 times [2019-08-05 10:46:48,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:48,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:48,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:48,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:48,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:48,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:48,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:48,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:48,970 INFO L87 Difference]: Start difference. First operand 47 states and 69 transitions. Second operand 25 states. [2019-08-05 10:46:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:49,464 INFO L93 Difference]: Finished difference Result 69 states and 91 transitions. [2019-08-05 10:46:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:49,464 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:49,465 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:46:49,465 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:46:49,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:46:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2019-08-05 10:46:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:49,467 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:49,467 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:49,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:49,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:49,467 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:49,467 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1] [2019-08-05 10:46:49,468 INFO L418 AbstractCegarLoop]: === Iteration 233 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:49,468 INFO L82 PathProgramCache]: Analyzing trace with hash 965912031, now seen corresponding path program 191 times [2019-08-05 10:46:49,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:49,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:49,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:49,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:49,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:49,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:49,895 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:50,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:50,411 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:50,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:50,412 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:50,412 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:50,412 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:50,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:50,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:50,414 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:50,415 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:50,415 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:50,416 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:50,416 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1] [2019-08-05 10:46:50,416 INFO L418 AbstractCegarLoop]: === Iteration 234 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash -483943931, now seen corresponding path program 192 times [2019-08-05 10:46:50,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:50,422 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:50,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:50,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:50,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:50,858 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:50,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:50,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:50,858 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:51,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:51,388 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:51,388 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:51,389 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:51,389 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:51,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:51,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:51,391 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:51,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:51,391 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:51,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:51,391 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:51,392 INFO L399 BasicCegarLoop]: trace histogram [18, 3, 1, 1, 1, 1] [2019-08-05 10:46:51,392 INFO L418 AbstractCegarLoop]: === Iteration 235 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:51,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:51,392 INFO L82 PathProgramCache]: Analyzing trace with hash 716212511, now seen corresponding path program 193 times [2019-08-05 10:46:51,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:51,399 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:51,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:51,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:51,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:51,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:51,825 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:52,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:52,378 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:52,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:52,378 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:52,379 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:52,379 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:52,379 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:52,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:52,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:52,381 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:52,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:52,381 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:52,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:52,382 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:52,382 INFO L399 BasicCegarLoop]: trace histogram [17, 4, 1, 1, 1, 1] [2019-08-05 10:46:52,382 INFO L418 AbstractCegarLoop]: === Iteration 236 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:52,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1323282747, now seen corresponding path program 194 times [2019-08-05 10:46:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:52,387 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:52,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:53,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:53,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:53,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:53,235 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:53,807 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:53,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:53,807 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:53,808 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:53,808 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:53,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:53,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:53,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:53,810 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:53,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:53,810 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:53,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:53,810 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:53,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:53,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:53,811 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 1, 1, 1, 1] [2019-08-05 10:46:53,811 INFO L418 AbstractCegarLoop]: === Iteration 237 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:53,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:53,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1804714913, now seen corresponding path program 195 times [2019-08-05 10:46:53,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:53,816 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:53,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:54,226 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:54,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:54,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:54,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:54,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:54,227 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:54,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:54,821 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:54,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:54,821 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:54,822 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:54,822 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:54,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:54,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:54,824 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:54,825 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:54,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:54,826 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:54,826 INFO L399 BasicCegarLoop]: trace histogram [15, 6, 1, 1, 1, 1] [2019-08-05 10:46:54,826 INFO L418 AbstractCegarLoop]: === Iteration 238 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:54,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1958792315, now seen corresponding path program 196 times [2019-08-05 10:46:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:54,832 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:54,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:55,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:55,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:55,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:55,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:55,253 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:55,863 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:55,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:55,863 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:55,864 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:55,864 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:55,864 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:55,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:55,866 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:55,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:55,866 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:55,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:55,866 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:55,866 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:55,867 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 1, 1, 1, 1] [2019-08-05 10:46:55,867 INFO L418 AbstractCegarLoop]: === Iteration 239 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:55,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:55,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1132478561, now seen corresponding path program 197 times [2019-08-05 10:46:55,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:55,872 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:55,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:56,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:56,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:56,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:56,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:56,279 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:56,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:56,909 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:56,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:56,909 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:56,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:56,910 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:56,910 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:56,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:56,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:56,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:56,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:56,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:56,912 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:56,912 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:56,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:56,913 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:56,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:56,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:56,913 INFO L399 BasicCegarLoop]: trace histogram [13, 8, 1, 1, 1, 1] [2019-08-05 10:46:56,913 INFO L418 AbstractCegarLoop]: === Iteration 240 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:56,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1521465275, now seen corresponding path program 198 times [2019-08-05 10:46:56,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:56,919 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:56,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:57,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:57,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:57,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:57,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:57,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:57,525 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:58,263 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:58,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:58,264 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:58,264 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:58,264 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:58,265 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:58,266 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:58,266 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:58,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:58,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:58,267 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 1, 1, 1, 1] [2019-08-05 10:46:58,267 INFO L418 AbstractCegarLoop]: === Iteration 241 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:58,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -979823905, now seen corresponding path program 199 times [2019-08-05 10:46:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:58,273 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:58,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:58,677 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:58,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:58,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:58,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:58,678 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:46:59,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:46:59,348 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:46:59,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:46:59,349 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:46:59,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:46:59,349 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:46:59,349 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:46:59,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:46:59,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:46:59,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:46:59,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:46:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:46:59,351 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:46:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:46:59,351 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:46:59,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:46:59,355 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:46:59,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:46:59,355 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:46:59,355 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2019-08-05 10:46:59,356 INFO L418 AbstractCegarLoop]: === Iteration 242 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:46:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:46:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1239446267, now seen corresponding path program 200 times [2019-08-05 10:46:59,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:46:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:46:59,360 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:46:59,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:46:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:46:59,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:46:59,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:46:59,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:46:59,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:46:59,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:46:59,760 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:00,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:00,454 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:00,455 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:00,455 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:00,455 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:00,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:00,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:00,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:00,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:00,457 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:00,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:00,458 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:00,458 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:00,458 INFO L399 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1] [2019-08-05 10:47:00,458 INFO L418 AbstractCegarLoop]: === Iteration 243 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash -277989857, now seen corresponding path program 201 times [2019-08-05 10:47:00,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:00,463 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:00,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:00,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:00,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:00,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:00,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:00,864 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:01,576 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:01,577 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:01,577 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:01,577 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:01,578 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:01,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:01,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:01,579 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:01,579 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:01,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:01,580 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:01,580 INFO L399 BasicCegarLoop]: trace histogram [12, 9, 1, 1, 1, 1] [2019-08-05 10:47:01,580 INFO L418 AbstractCegarLoop]: === Iteration 244 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:01,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1216806459, now seen corresponding path program 202 times [2019-08-05 10:47:01,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:01,584 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:01,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:01,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:01,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:01,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:01,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:01,994 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:02,722 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:02,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:02,723 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:02,723 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:02,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:02,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:02,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:02,725 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:02,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:02,725 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:02,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:02,725 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:02,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:02,726 INFO L399 BasicCegarLoop]: trace histogram [13, 8, 1, 1, 1, 1] [2019-08-05 10:47:02,726 INFO L418 AbstractCegarLoop]: === Iteration 245 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:02,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:02,726 INFO L82 PathProgramCache]: Analyzing trace with hash -692901537, now seen corresponding path program 203 times [2019-08-05 10:47:02,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:02,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:02,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:03,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:03,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:03,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:03,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:03,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:03,269 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:04,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:04,046 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:04,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:04,047 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:04,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:04,047 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:04,047 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:04,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:04,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:04,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:04,049 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:04,049 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:04,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:04,050 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:04,050 INFO L399 BasicCegarLoop]: trace histogram [14, 7, 1, 1, 1, 1] [2019-08-05 10:47:04,050 INFO L418 AbstractCegarLoop]: === Iteration 246 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:04,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:04,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1507285371, now seen corresponding path program 204 times [2019-08-05 10:47:04,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:04,055 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:04,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:04,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:04,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:04,475 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:04,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:04,476 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:05,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:05,242 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:05,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:05,242 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:05,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:05,243 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:05,243 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:05,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:05,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:05,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:05,244 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:05,245 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:05,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:05,245 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:05,245 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:05,245 INFO L399 BasicCegarLoop]: trace histogram [15, 6, 1, 1, 1, 1] [2019-08-05 10:47:05,246 INFO L418 AbstractCegarLoop]: === Iteration 247 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:05,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:05,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1256461153, now seen corresponding path program 205 times [2019-08-05 10:47:05,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:05,250 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:05,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:05,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:05,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:05,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:05,661 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:06,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:06,447 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:06,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:06,448 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:06,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:06,448 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:06,448 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:06,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:06,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:06,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:06,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:06,450 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:06,450 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:06,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:06,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:06,450 INFO L399 BasicCegarLoop]: trace histogram [16, 5, 1, 1, 1, 1] [2019-08-05 10:47:06,451 INFO L418 AbstractCegarLoop]: === Iteration 248 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:06,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:06,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1106934597, now seen corresponding path program 206 times [2019-08-05 10:47:06,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:06,455 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:06,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:06,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:06,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:06,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:06,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:06,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:06,883 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:07,700 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:07,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:07,701 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:07,701 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:07,701 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:07,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:07,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:07,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:07,703 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:07,703 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:07,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:07,704 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:07,704 INFO L399 BasicCegarLoop]: trace histogram [17, 4, 1, 1, 1, 1] [2019-08-05 10:47:07,704 INFO L418 AbstractCegarLoop]: === Iteration 249 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:07,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1587773473, now seen corresponding path program 207 times [2019-08-05 10:47:07,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:07,709 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:07,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:08,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:08,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:08,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:08,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:08,109 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:09,078 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:09,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:09,079 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:09,079 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:09,079 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:09,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:09,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:09,081 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:09,081 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:09,081 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:09,082 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:09,082 INFO L399 BasicCegarLoop]: trace histogram [18, 3, 1, 1, 1, 1] [2019-08-05 10:47:09,082 INFO L418 AbstractCegarLoop]: === Iteration 250 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:09,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:09,082 INFO L82 PathProgramCache]: Analyzing trace with hash -843415547, now seen corresponding path program 208 times [2019-08-05 10:47:09,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:09,087 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:09,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:09,491 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:09,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:09,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:09,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:09,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:09,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:09,493 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:10,339 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:10,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:10,340 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:10,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:10,340 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:10,340 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:10,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:10,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:10,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:10,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:10,342 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:10,342 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:10,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:10,343 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:10,343 INFO L399 BasicCegarLoop]: trace histogram [19, 2, 1, 1, 1, 1] [2019-08-05 10:47:10,343 INFO L418 AbstractCegarLoop]: === Iteration 251 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash -819404001, now seen corresponding path program 209 times [2019-08-05 10:47:10,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:10,349 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:10,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:10,853 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:10,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:10,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:10,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:10,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:10,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:10,854 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:11,716 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:11,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:11,720 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:11,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:11,721 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:11,721 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:11,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:11,722 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:11,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:11,722 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:11,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:11,723 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:11,723 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1] [2019-08-05 10:47:11,723 INFO L418 AbstractCegarLoop]: === Iteration 252 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:11,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:11,724 INFO L82 PathProgramCache]: Analyzing trace with hash -818629435, now seen corresponding path program 210 times [2019-08-05 10:47:11,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:11,730 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:11,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:12,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:12,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:12,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:12,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:12,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:12,123 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:13,009 INFO L93 Difference]: Finished difference Result 70 states and 92 transitions. [2019-08-05 10:47:13,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:13,010 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:13,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:13,010 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:47:13,010 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:47:13,011 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:47:13,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2019-08-05 10:47:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:47:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-08-05 10:47:13,012 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 25 [2019-08-05 10:47:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:13,012 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2019-08-05 10:47:13,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2019-08-05 10:47:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:47:13,013 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:13,013 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-08-05 10:47:13,013 INFO L418 AbstractCegarLoop]: === Iteration 253 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash -818604449, now seen corresponding path program 21 times [2019-08-05 10:47:13,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:13,019 WARN L254 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:47:13,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:13,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:13,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:47:13,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:47:13,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:47:13,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:47:13,680 INFO L87 Difference]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-08-05 10:47:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:14,582 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2019-08-05 10:47:14,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:47:14,583 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:47:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:14,583 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:47:14,583 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:47:14,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:47:14,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2019-08-05 10:47:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:47:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2019-08-05 10:47:14,585 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 25 [2019-08-05 10:47:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:14,586 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2019-08-05 10:47:14,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:47:14,586 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2019-08-05 10:47:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:14,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:14,586 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 10:47:14,587 INFO L418 AbstractCegarLoop]: === Iteration 254 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1620673605, now seen corresponding path program 22 times [2019-08-05 10:47:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:14,592 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:14,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:15,041 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:15,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:15,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:15,042 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:15,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:15,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:15,043 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand 26 states. [2019-08-05 10:47:15,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:15,582 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2019-08-05 10:47:15,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:15,582 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:15,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:15,583 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:47:15,583 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:47:15,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:15,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:47:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2019-08-05 10:47:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:15,585 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:15,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:15,585 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:15,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:15,586 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:15,586 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1] [2019-08-05 10:47:15,586 INFO L418 AbstractCegarLoop]: === Iteration 255 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash -121501973, now seen corresponding path program 211 times [2019-08-05 10:47:15,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:15,591 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:15,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:16,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:16,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:16,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:16,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:16,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:16,037 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:16,594 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:16,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:16,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:16,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:16,595 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:16,595 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:16,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:16,597 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:16,598 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:16,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:16,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:16,598 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 1, 1, 1, 1] [2019-08-05 10:47:16,599 INFO L418 AbstractCegarLoop]: === Iteration 256 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:16,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2117363835, now seen corresponding path program 212 times [2019-08-05 10:47:16,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:16,606 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:16,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:17,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:17,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:17,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:17,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:17,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:17,061 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:17,636 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:17,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:17,638 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:17,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:17,638 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:17,638 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:17,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:17,640 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:17,640 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:17,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:17,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:17,641 INFO L399 BasicCegarLoop]: trace histogram [19, 3, 1, 1, 1, 1] [2019-08-05 10:47:17,641 INFO L418 AbstractCegarLoop]: === Iteration 257 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash 727747499, now seen corresponding path program 213 times [2019-08-05 10:47:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:17,647 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:17,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:18,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:18,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:18,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:18,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:18,089 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:18,789 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:18,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:18,789 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:18,790 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:18,790 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:18,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:18,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:18,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:18,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:18,792 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:18,792 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:18,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:18,792 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:18,793 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:18,793 INFO L399 BasicCegarLoop]: trace histogram [18, 4, 1, 1, 1, 1] [2019-08-05 10:47:18,793 INFO L418 AbstractCegarLoop]: === Iteration 258 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:18,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:18,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1927903941, now seen corresponding path program 214 times [2019-08-05 10:47:18,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:18,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:18,798 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:18,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:19,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:19,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:19,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:19,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:19,229 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:19,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:19,850 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:19,851 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:19,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:19,851 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:19,851 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:19,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:19,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:19,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:19,853 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:19,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:19,853 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:19,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:19,854 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:19,854 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:19,854 INFO L399 BasicCegarLoop]: trace histogram [17, 5, 1, 1, 1, 1] [2019-08-05 10:47:19,854 INFO L418 AbstractCegarLoop]: === Iteration 259 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:19,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:19,855 INFO L82 PathProgramCache]: Analyzing trace with hash -111591317, now seen corresponding path program 215 times [2019-08-05 10:47:19,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:19,859 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:19,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:20,281 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:20,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:20,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:20,282 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:20,282 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:20,918 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:20,918 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:20,919 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:20,919 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:20,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:20,920 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:20,921 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:20,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:20,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:20,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:20,921 INFO L399 BasicCegarLoop]: trace histogram [16, 6, 1, 1, 1, 1] [2019-08-05 10:47:20,922 INFO L418 AbstractCegarLoop]: === Iteration 260 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash -593023483, now seen corresponding path program 216 times [2019-08-05 10:47:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:20,930 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:20,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:21,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:21,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:21,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:21,368 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:22,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:22,027 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:22,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:22,028 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:22,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:22,028 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:22,029 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:22,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:22,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:22,031 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:22,031 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:22,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:22,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:22,032 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:22,032 INFO L399 BasicCegarLoop]: trace histogram [15, 7, 1, 1, 1, 1] [2019-08-05 10:47:22,033 INFO L418 AbstractCegarLoop]: === Iteration 261 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:22,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:22,033 INFO L82 PathProgramCache]: Analyzing trace with hash -747100885, now seen corresponding path program 217 times [2019-08-05 10:47:22,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:22,040 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:22,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:22,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:22,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:22,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:22,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:22,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:22,717 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:23,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:23,396 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:23,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:23,397 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:23,397 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:23,398 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:23,398 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:23,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:23,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:23,402 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:23,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:23,403 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:23,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:23,403 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:23,403 INFO L399 BasicCegarLoop]: trace histogram [14, 8, 1, 1, 1, 1] [2019-08-05 10:47:23,403 INFO L418 AbstractCegarLoop]: === Iteration 262 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 79212869, now seen corresponding path program 218 times [2019-08-05 10:47:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:23,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:23,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:24,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:24,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:24,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:24,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:24,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:24,077 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:24,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:24,771 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:24,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:24,772 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:24,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:24,772 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:24,772 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:24,773 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:24,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:24,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:24,774 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:24,774 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:24,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:24,774 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:24,774 INFO L399 BasicCegarLoop]: trace histogram [13, 9, 1, 1, 1, 1] [2019-08-05 10:47:24,775 INFO L418 AbstractCegarLoop]: === Iteration 263 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:24,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:24,775 INFO L82 PathProgramCache]: Analyzing trace with hash -309773845, now seen corresponding path program 219 times [2019-08-05 10:47:24,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:24,780 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:24,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:25,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:25,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:25,315 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:26,049 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:26,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:26,050 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:26,050 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:26,050 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:26,051 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:26,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:26,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:26,052 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:26,052 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:26,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:26,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:26,053 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:26,053 INFO L399 BasicCegarLoop]: trace histogram [12, 10, 1, 1, 1, 1] [2019-08-05 10:47:26,053 INFO L418 AbstractCegarLoop]: === Iteration 264 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:26,054 INFO L82 PathProgramCache]: Analyzing trace with hash 231867525, now seen corresponding path program 220 times [2019-08-05 10:47:26,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:26,059 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:26,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:26,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:26,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:26,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:26,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:26,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:26,488 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:27,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:27,235 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:27,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:27,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:27,236 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:27,236 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:27,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:27,238 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:27,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:27,238 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:27,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:27,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:27,239 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:27,239 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-08-05 10:47:27,239 INFO L418 AbstractCegarLoop]: === Iteration 265 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:27,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:27,240 INFO L82 PathProgramCache]: Analyzing trace with hash -27754837, now seen corresponding path program 221 times [2019-08-05 10:47:27,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:27,247 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:27,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:27,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:27,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:27,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:27,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:27,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:27,677 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:28,437 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:28,438 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:28,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:28,438 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:28,438 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:28,439 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:28,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:28,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:28,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:28,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:28,440 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:28,440 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:28,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:28,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:28,441 INFO L399 BasicCegarLoop]: trace histogram [12, 10, 1, 1, 1, 1] [2019-08-05 10:47:28,441 INFO L418 AbstractCegarLoop]: === Iteration 266 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:28,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:28,442 INFO L82 PathProgramCache]: Analyzing trace with hash 933701573, now seen corresponding path program 222 times [2019-08-05 10:47:28,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:28,447 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:28,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:29,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:29,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:29,054 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:29,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:29,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:29,055 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:29,855 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:29,856 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:29,856 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:29,856 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:29,857 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:29,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:29,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:29,858 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:29,858 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:29,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:29,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:29,859 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:29,859 INFO L399 BasicCegarLoop]: trace histogram [13, 9, 1, 1, 1, 1] [2019-08-05 10:47:29,859 INFO L418 AbstractCegarLoop]: === Iteration 267 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:29,860 INFO L82 PathProgramCache]: Analyzing trace with hash -5115029, now seen corresponding path program 223 times [2019-08-05 10:47:29,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:29,864 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:29,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:30,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:30,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:30,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:30,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:30,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:30,329 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:31,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:31,130 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:31,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:31,131 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:31,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:31,131 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:31,131 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:31,131 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:31,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:31,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:31,133 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:31,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:31,133 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:31,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:31,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:31,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:31,133 INFO L399 BasicCegarLoop]: trace histogram [14, 8, 1, 1, 1, 1] [2019-08-05 10:47:31,133 INFO L418 AbstractCegarLoop]: === Iteration 268 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:31,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:31,134 INFO L82 PathProgramCache]: Analyzing trace with hash 518789893, now seen corresponding path program 224 times [2019-08-05 10:47:31,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:31,138 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:31,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:31,568 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:31,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:31,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:31,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:31,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:31,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:31,569 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:32,384 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:32,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:32,384 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:32,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:32,385 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:32,385 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:32,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:32,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:32,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:32,386 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:32,387 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:32,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:32,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:32,387 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:32,387 INFO L399 BasicCegarLoop]: trace histogram [15, 7, 1, 1, 1, 1] [2019-08-05 10:47:32,388 INFO L418 AbstractCegarLoop]: === Iteration 269 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash -295593941, now seen corresponding path program 225 times [2019-08-05 10:47:32,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:32,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:32,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:32,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:32,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:32,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:32,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:32,848 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:33,688 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:33,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:33,688 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:33,689 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:33,689 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:33,689 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:33,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:33,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:33,691 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:33,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:33,691 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:33,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:33,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:33,691 INFO L399 BasicCegarLoop]: trace histogram [16, 6, 1, 1, 1, 1] [2019-08-05 10:47:33,692 INFO L418 AbstractCegarLoop]: === Iteration 270 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:33,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:33,692 INFO L82 PathProgramCache]: Analyzing trace with hash -44769723, now seen corresponding path program 226 times [2019-08-05 10:47:33,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:33,698 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:33,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:34,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:34,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:34,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:34,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:34,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:34,406 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:35,273 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:35,273 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:35,273 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:35,273 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:35,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:35,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:35,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:35,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:35,275 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:35,275 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:35,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:35,275 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:35,276 INFO L399 BasicCegarLoop]: trace histogram [17, 5, 1, 1, 1, 1] [2019-08-05 10:47:35,276 INFO L418 AbstractCegarLoop]: === Iteration 271 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:35,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:35,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1976341269, now seen corresponding path program 227 times [2019-08-05 10:47:35,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:35,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:35,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:35,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:35,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:35,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:35,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:35,728 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:36,610 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:36,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:36,611 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:36,611 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:36,611 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:36,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:36,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:36,613 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:36,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:36,613 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:36,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:36,613 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:36,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:36,614 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:36,614 INFO L399 BasicCegarLoop]: trace histogram [18, 4, 1, 1, 1, 1] [2019-08-05 10:47:36,614 INFO L418 AbstractCegarLoop]: === Iteration 272 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:36,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:36,614 INFO L82 PathProgramCache]: Analyzing trace with hash -376082043, now seen corresponding path program 228 times [2019-08-05 10:47:36,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:36,619 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:36,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:37,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:37,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:37,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:37,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:37,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:37,054 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:37,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:37,984 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:37,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:37,984 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:37,985 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:37,985 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:37,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:37,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:37,986 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:37,987 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:37,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:37,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:37,987 INFO L399 BasicCegarLoop]: trace histogram [19, 3, 1, 1, 1, 1] [2019-08-05 10:47:37,987 INFO L418 AbstractCegarLoop]: === Iteration 273 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash 368275883, now seen corresponding path program 229 times [2019-08-05 10:47:37,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:37,992 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:37,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:38,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:38,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:38,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:38,429 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:39,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:39,482 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:39,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:39,483 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:39,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:39,483 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:39,483 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:39,484 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:39,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:39,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:39,485 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:39,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:39,485 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:39,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:39,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:39,486 INFO L399 BasicCegarLoop]: trace histogram [20, 2, 1, 1, 1, 1] [2019-08-05 10:47:39,486 INFO L418 AbstractCegarLoop]: === Iteration 274 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash 392287429, now seen corresponding path program 230 times [2019-08-05 10:47:39,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:39,492 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:39,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:39,928 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:39,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:39,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:39,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:39,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:39,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:39,930 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:40,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:40,869 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:40,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:40,870 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:40,870 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:40,870 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:40,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:40,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:40,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:40,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:40,872 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:40,872 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:40,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:40,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:40,873 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1] [2019-08-05 10:47:40,873 INFO L418 AbstractCegarLoop]: === Iteration 275 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:40,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash 393061995, now seen corresponding path program 231 times [2019-08-05 10:47:40,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:40,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:40,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:41,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:41,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:41,335 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:41,335 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:42,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:42,299 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-08-05 10:47:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:42,300 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:42,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:42,300 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:47:42,301 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:47:42,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:42,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:47:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2019-08-05 10:47:42,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:47:42,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-08-05 10:47:42,303 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 26 [2019-08-05 10:47:42,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:42,303 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 73 transitions. [2019-08-05 10:47:42,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 73 transitions. [2019-08-05 10:47:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:47:42,304 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:42,304 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-08-05 10:47:42,304 INFO L418 AbstractCegarLoop]: === Iteration 276 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:42,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:42,305 INFO L82 PathProgramCache]: Analyzing trace with hash 393086981, now seen corresponding path program 22 times [2019-08-05 10:47:42,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:42,310 WARN L254 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:47:42,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:42,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:42,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:47:42,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:47:42,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:47:42,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:47:42,762 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-08-05 10:47:43,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:43,748 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2019-08-05 10:47:43,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:47:43,749 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:47:43,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:43,749 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:47:43,749 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:47:43,749 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:43,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:47:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2019-08-05 10:47:43,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:47:43,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2019-08-05 10:47:43,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 26 [2019-08-05 10:47:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:43,751 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2019-08-05 10:47:43,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:47:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2019-08-05 10:47:43,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:43,752 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:43,752 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-08-05 10:47:43,752 INFO L418 AbstractCegarLoop]: === Iteration 277 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:43,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:43,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1298729659, now seen corresponding path program 23 times [2019-08-05 10:47:43,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:43,758 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:43,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:44,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:44,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:44,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:44,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:44,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:44,501 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand 27 states. [2019-08-05 10:47:45,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:45,079 INFO L93 Difference]: Finished difference Result 75 states and 99 transitions. [2019-08-05 10:47:45,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:45,080 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:45,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:45,080 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:47:45,080 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:47:45,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:47:45,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2019-08-05 10:47:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:45,083 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:45,083 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:45,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:45,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:45,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:45,084 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1] [2019-08-05 10:47:45,084 INFO L418 AbstractCegarLoop]: === Iteration 278 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:45,084 INFO L82 PathProgramCache]: Analyzing trace with hash 528402271, now seen corresponding path program 232 times [2019-08-05 10:47:45,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:45,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:45,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:45,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:45,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:45,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:45,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:45,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:45,577 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:46,172 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:46,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:46,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:46,173 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:46,173 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:46,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:46,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:46,175 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:46,175 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:46,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:46,175 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:46,176 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:46,176 INFO L399 BasicCegarLoop]: trace histogram [21, 2, 1, 1, 1, 1] [2019-08-05 10:47:46,176 INFO L418 AbstractCegarLoop]: === Iteration 279 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:46,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:46,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1213773307, now seen corresponding path program 233 times [2019-08-05 10:47:46,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:46,181 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:46,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:46,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:46,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:46,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:46,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:46,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:46,650 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:47,271 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:47,271 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:47,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:47,272 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:47,272 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:47,272 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:47,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:47,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:47,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:47,274 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:47,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:47,274 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:47,274 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:47,274 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:47,274 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:47,275 INFO L399 BasicCegarLoop]: trace histogram [20, 3, 1, 1, 1, 1] [2019-08-05 10:47:47,275 INFO L418 AbstractCegarLoop]: === Iteration 280 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:47,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:47,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1085332127, now seen corresponding path program 234 times [2019-08-05 10:47:47,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:47,280 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:47,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:47,747 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:47,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:47,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:47,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:47,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:47,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:47,748 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:48,394 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:48,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:48,394 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:48,395 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:48,395 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:48,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:48,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:48,397 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:48,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:48,397 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:48,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:48,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:48,397 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:48,398 INFO L399 BasicCegarLoop]: trace histogram [19, 4, 1, 1, 1, 1] [2019-08-05 10:47:48,398 INFO L418 AbstractCegarLoop]: === Iteration 281 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:48,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:48,398 INFO L82 PathProgramCache]: Analyzing trace with hash -364523835, now seen corresponding path program 235 times [2019-08-05 10:47:48,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:48,403 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:48,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:48,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:48,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:48,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:48,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:48,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:48,876 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:49,664 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:49,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:49,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:49,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:49,665 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:49,665 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:49,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:49,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:49,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:49,668 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:49,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:49,668 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:49,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:49,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:49,668 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:49,668 INFO L399 BasicCegarLoop]: trace histogram [18, 5, 1, 1, 1, 1] [2019-08-05 10:47:49,669 INFO L418 AbstractCegarLoop]: === Iteration 282 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash 835632607, now seen corresponding path program 236 times [2019-08-05 10:47:49,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:49,676 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:49,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:50,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:50,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:50,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:50,318 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:51,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:51,002 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:51,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:51,003 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:51,004 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:51,004 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:51,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:51,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:51,005 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:51,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:51,006 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:51,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:51,006 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:51,006 INFO L399 BasicCegarLoop]: trace histogram [17, 6, 1, 1, 1, 1] [2019-08-05 10:47:51,007 INFO L418 AbstractCegarLoop]: === Iteration 283 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1203862651, now seen corresponding path program 237 times [2019-08-05 10:47:51,008 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:51,012 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:51,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:51,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:51,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:51,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:51,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:51,499 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:52,198 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:52,199 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:52,199 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:52,199 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:52,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:52,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:52,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:52,201 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:52,202 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:52,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:52,202 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:52,202 INFO L399 BasicCegarLoop]: trace histogram [16, 7, 1, 1, 1, 1] [2019-08-05 10:47:52,202 INFO L418 AbstractCegarLoop]: === Iteration 284 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1685294817, now seen corresponding path program 238 times [2019-08-05 10:47:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:52,211 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:52,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:52,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:52,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:52,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:52,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:52,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:52,678 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:53,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:53,401 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:53,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:53,402 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:53,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:53,402 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:53,402 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:53,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:53,404 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:53,404 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:53,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:53,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:53,405 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:53,405 INFO L399 BasicCegarLoop]: trace histogram [15, 8, 1, 1, 1, 1] [2019-08-05 10:47:53,405 INFO L418 AbstractCegarLoop]: === Iteration 285 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:53,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:53,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1839372219, now seen corresponding path program 239 times [2019-08-05 10:47:53,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:53,412 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:53,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:53,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:53,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:53,973 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:53,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:53,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:53,974 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:54,870 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:54,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:54,871 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:54,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:54,871 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:54,871 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:54,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:54,873 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:54,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:54,873 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:54,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:54,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:54,874 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:54,874 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 1, 1, 1, 1] [2019-08-05 10:47:54,874 INFO L418 AbstractCegarLoop]: === Iteration 286 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1013058465, now seen corresponding path program 240 times [2019-08-05 10:47:54,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:54,880 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:54,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:55,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:55,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:55,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:55,446 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:56,213 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:56,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:56,214 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:56,214 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:56,214 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:56,214 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:56,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:56,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:56,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:56,216 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:56,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:56,216 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:56,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:56,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:56,216 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:56,217 INFO L399 BasicCegarLoop]: trace histogram [13, 10, 1, 1, 1, 1] [2019-08-05 10:47:56,217 INFO L418 AbstractCegarLoop]: === Iteration 287 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:56,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:56,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1402045179, now seen corresponding path program 241 times [2019-08-05 10:47:56,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:56,221 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:56,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:56,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:56,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:56,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:56,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:56,716 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:57,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:57,508 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:57,509 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:57,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:57,509 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:57,509 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:57,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:57,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:57,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:57,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:57,511 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:57,511 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:57,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:57,511 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:57,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:57,511 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:57,511 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-08-05 10:47:57,511 INFO L418 AbstractCegarLoop]: === Iteration 288 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:57,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:57,512 INFO L82 PathProgramCache]: Analyzing trace with hash -860403809, now seen corresponding path program 242 times [2019-08-05 10:47:57,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:57,516 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:57,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:57,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:57,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:57,986 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:47:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:47:58,793 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:47:58,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:47:58,793 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:47:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:47:58,794 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:47:58,794 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:47:58,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:47:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:47:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:47:58,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:47:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:47:58,796 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:47:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:47:58,796 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:47:58,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:47:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:47:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:47:58,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:47:58,796 INFO L399 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-08-05 10:47:58,797 INFO L418 AbstractCegarLoop]: === Iteration 289 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:47:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:47:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1120026171, now seen corresponding path program 243 times [2019-08-05 10:47:58,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:47:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:47:58,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:47:58,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:47:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:47:59,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:47:59,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:47:59,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:47:59,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:47:59,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:47:59,271 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:48:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:00,287 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:48:00,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:00,287 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:48:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:00,288 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:00,288 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:00,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:48:00,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:00,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:48:00,290 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:48:00,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:00,290 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:48:00,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:00,290 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:48:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:00,291 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:00,291 INFO L399 BasicCegarLoop]: trace histogram [13, 10, 1, 1, 1, 1] [2019-08-05 10:48:00,291 INFO L418 AbstractCegarLoop]: === Iteration 290 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:00,291 INFO L82 PathProgramCache]: Analyzing trace with hash -158569761, now seen corresponding path program 244 times [2019-08-05 10:48:00,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:00,297 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:48:00,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:00,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:00,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:00,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:00,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:00,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:00,817 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:48:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:01,673 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:48:01,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:01,674 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:48:01,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:01,674 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:01,674 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:01,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:01,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:01,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:48:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:48:01,676 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:48:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:01,676 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:48:01,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:48:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:01,677 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:01,677 INFO L399 BasicCegarLoop]: trace histogram [14, 9, 1, 1, 1, 1] [2019-08-05 10:48:01,677 INFO L418 AbstractCegarLoop]: === Iteration 291 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:01,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:01,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1097386363, now seen corresponding path program 245 times [2019-08-05 10:48:01,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:01,682 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:48:01,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:02,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:02,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:02,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:02,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:02,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:02,147 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:48:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:03,020 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:48:03,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:03,021 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:48:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:03,021 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:03,021 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:03,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:48:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:48:03,023 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:48:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:03,023 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:48:03,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:48:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:03,024 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:03,024 INFO L399 BasicCegarLoop]: trace histogram [15, 8, 1, 1, 1, 1] [2019-08-05 10:48:03,024 INFO L418 AbstractCegarLoop]: === Iteration 292 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -573481441, now seen corresponding path program 246 times [2019-08-05 10:48:03,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:03,029 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:48:03,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:03,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:03,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:03,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:03,493 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:48:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:04,389 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:48:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:04,389 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:48:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:04,390 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:04,390 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:04,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:04,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:04,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:48:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:04,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:48:04,392 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:48:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:04,392 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:48:04,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:04,392 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:48:04,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:04,392 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:04,393 INFO L399 BasicCegarLoop]: trace histogram [16, 7, 1, 1, 1, 1] [2019-08-05 10:48:04,393 INFO L418 AbstractCegarLoop]: === Iteration 293 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:04,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:04,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1387865275, now seen corresponding path program 247 times [2019-08-05 10:48:04,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:04,398 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:48:04,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:05,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:05,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:05,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:05,152 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:48:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:06,081 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:48:06,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:06,081 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:48:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:06,082 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:06,082 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:06,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:06,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:06,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:48:06,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:48:06,084 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:48:06,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:06,084 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:48:06,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:06,084 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:48:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:06,084 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:06,084 INFO L399 BasicCegarLoop]: trace histogram [17, 6, 1, 1, 1, 1] [2019-08-05 10:48:06,085 INFO L418 AbstractCegarLoop]: === Iteration 294 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1137041057, now seen corresponding path program 248 times [2019-08-05 10:48:06,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:06,091 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:48:06,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:06,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:06,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:06,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:06,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:06,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:06,576 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-08-05 10:48:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:48:07,555 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2019-08-05 10:48:07,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:48:07,556 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:48:07,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:48:07,556 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:48:07,557 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:48:07,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:48:07,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:48:07,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2019-08-05 10:48:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:48:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-08-05 10:48:07,558 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 27 [2019-08-05 10:48:07,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:48:07,559 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2019-08-05 10:48:07,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:48:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2019-08-05 10:48:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:48:07,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:48:07,559 INFO L399 BasicCegarLoop]: trace histogram [18, 5, 1, 1, 1, 1] [2019-08-05 10:48:07,560 INFO L418 AbstractCegarLoop]: === Iteration 295 === [SimultaneousIncrementErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:48:07,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:48:07,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1226354693, now seen corresponding path program 249 times [2019-08-05 10:48:07,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:48:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:48:07,565 WARN L254 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:48:07,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:48:08,023 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:48:08,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:48:08,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:48:08,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:48:08,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:48:08,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:48:08,024 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. Received shutdown request... [2019-08-05 10:48:08,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:48:08,549 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:48:08,556 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:48:08,556 INFO L202 PluginConnector]: Adding new model SimultaneousIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:48:08 BoogieIcfgContainer [2019-08-05 10:48:08,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:48:08,557 INFO L168 Benchmark]: Toolchain (without parser) took 246540.87 ms. Allocated memory was 134.7 MB in the beginning and 125.3 MB in the end (delta: -9.4 MB). Free memory was 112.4 MB in the beginning and 74.6 MB in the end (delta: 37.8 MB). Peak memory consumption was 28.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:08,557 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:48:08,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.44 ms. Allocated memory is still 134.7 MB. Free memory was 112.4 MB in the beginning and 110.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:08,558 INFO L168 Benchmark]: Boogie Preprocessor took 25.90 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:08,558 INFO L168 Benchmark]: RCFGBuilder took 347.39 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 100.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:08,558 INFO L168 Benchmark]: TraceAbstraction took 246120.80 ms. Allocated memory was 134.7 MB in the beginning and 125.3 MB in the end (delta: -9.4 MB). Free memory was 99.9 MB in the beginning and 74.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:48:08,560 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.22 ms. Allocated memory is still 134.7 MB. Free memory was 113.6 MB in the beginning and 113.4 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.44 ms. Allocated memory is still 134.7 MB. Free memory was 112.4 MB in the beginning and 110.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.90 ms. Allocated memory is still 134.7 MB. Free memory was 110.5 MB in the beginning and 109.3 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.39 ms. Allocated memory is still 134.7 MB. Free memory was 109.3 MB in the beginning and 100.1 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 246120.80 ms. Allocated memory was 134.7 MB in the beginning and 125.3 MB in the end (delta: -9.4 MB). Free memory was 99.9 MB in the beginning and 74.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was constructing difference of abstraction (52states) and FLOYD_HOARE automaton (currently 15 states, 27 states before enhancement),while ReachableStatesComputation was computing reachable states (38 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 246.0s OverallTime, 295 OverallIterations, 23 TraceHistogramMax, 138.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3074 SDtfs, 2488 SDslu, 44962 SDs, 0 SdLazy, 156388 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 111.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5664 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 5369 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 107.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=277, 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.4s AutomataMinimizationTime, 294 MinimizatonAttempts, 4439 StatesRemovedByMinimization, 292 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 104.2s InterpolantComputationTime, 5665 NumberOfCodeBlocks, 5665 NumberOfCodeBlocksAsserted, 295 NumberOfCheckSat, 5370 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402126 SizeOfPredicates, 590 NumberOfNonLiveVariables, 21480 ConjunctsInSsa, 20595 ConjunctsInUnsatCore, 295 InterpolantComputations, 1 PerfectInterpolantSequences, 0/28720 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown